Please use this identifier to cite or link to this item: http://hdl.handle.net/11701/15246
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDobrynin, Vladimir Yu.-
dc.contributor.authorRooney, Niall-
dc.contributor.authorSerdyuk, Julian A.-
dc.date.accessioned2019-01-16T15:55:59Z-
dc.date.available2019-01-16T15:55:59Z-
dc.date.issued2018-12-
dc.identifier.citationDobrynin V. Yu., Rooney N., Serdyuk J. A. Setting lower bounds on Jensen—Shannon divergence and its application to nearest neighbor document search. Vestnik of Saint Petersburg University. Applied Mathematics. Computer Science. Control Processes, 2018, vol. 14, iss. 4, pp. 334–345.en_GB
dc.identifier.other10.21638/11702/spbu10.2018.406-
dc.identifier.urihttp://hdl.handle.net/11701/15246-
dc.description.abstractThe Jensen—Shannon divergence provides a mechanism to determine nearest neighbours in a document collection to a specific query document. This is an effective mechanism however for exhaustive search this can be a time-consuming process. In this paper, we show by setting lower bounds on the Jensen—Shannon divergence search we can reduce by up to a factor of 60% the level of calculation for exhaustive search and 98% for approximate search, based on the nearest neighbour search in a real-world document collection. In these experiments a document corpus that contains 1 854 654 articles published in New York Times from 1987-01-01 till 2007-06-19 (The New York Times Annotated Corpus) was used. As queries, 100 documents from same document corpus were selected randomly. We assess the effect on performance based on the reduction in the number of log function calculations. Approximate nearest neighbour search is based on clustering of documents using Contextual Document Clustering algorithm. We perform an approximated nearest neighbour search by finding the best matching set of cluster attractors to a query and limiting the search for documents to the attractors’ corresponding clusters.en_GB
dc.language.isoenen_GB
dc.publisherSt Petersburg State Universityen_GB
dc.relation.ispartofseriesVestnik of St Petersburg University. Applied Mathematics. Computer Science. Control Processes;Volume 14; Issue 4-
dc.subjectJensen—Shannon divergenceen_GB
dc.subjectnearest neighbors searchen_GB
dc.subjectdimensionality reductionen_GB
dc.titleSetting lower bounds on Jensen—Shannon divergence and its application to nearest neighbor document searchen_GB
dc.typeArticleen_GB
Appears in Collections:Issue 4

Files in This Item:
File Description SizeFormat 
06-Dobrynin.pdf311,25 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.