Show simple item record

dc.contributor.authorKucuktunc, O.en_US
dc.contributor.authorFerhatosmanoglu, H.en_US
dc.date.accessioned2015-07-28T12:00:13Z
dc.date.available2015-07-28T12:00:13Z
dc.date.issued2013-03en_US
dc.identifier.issn1041-4347
dc.identifier.urihttp://hdl.handle.net/11693/12136
dc.description.abstractTraditional search methods try to obtain the most relevant information and rank it according to the degree of similarity to the queries. Diversity in query results is also preferred by a variety of applications since results very similar to each other cannot capture all aspects of the queried topic. In this paper, we focus on the -diverse k-nearest neighbor search problem on spatial and multidimensional data. Unlike the approach of diversifying query results in a postprocessing step, we naturally obtain diverse results with the proposed geometric and index-based methods. We first make an analogy with the concept of Natural Neighbors (NatN) and propose a natural neighbor-based method for 2D and 3D data and an incremental browsing algorithm based on Gabriel graphs for higher dimensional spaces. We then introduce a diverse browsing method based on the distance browsing feature of spatial index structures, such as R-trees. The algorithm maintains a Priority Queue with mindivdist of the objects depending on both relevancy and angular diversity and efficiently prunes nondiverse items and nodes. We experiment with a number of spatial and high-dimensional data sets, including Factual’s (http://www.factual.com/) US points-of-interest data set of 13M entries. On the experimental setup, the diverse browsing method is shown to be more efficient (regarding disk accesses) than k-NN search on R-trees, and more effective (regarding Maximal Marginal Relevance (MMR)) than the diverse nearest neighbor search techniques found in the literature.en_US
dc.language.isoEnglishen_US
dc.source.titleIEEE Transactions on Knowledge & Data Engineeringen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/TKDE.2011.251en_US
dc.subjectDiversityen_US
dc.subjectDiverse nearest neighbor searchen_US
dc.subjectAngular similarityen_US
dc.subjectNatural neighborsen_US
dc.subjectGabriel graphen_US
dc.titleλ-diverse nearest neighbors browsing for multidimensional dataen_US
dc.typeArticleen_US
dc.departmentDepartment of Computer Engineeringen_US
dc.citation.spage481en_US
dc.citation.epage493en_US
dc.citation.volumeNumber25en_US
dc.citation.issueNumber3en_US
dc.identifier.doi10.1109/TKDE.2011.251en_US
dc.publisherInstitute of Electrical and Electronics Engineersen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record