The Community for Technology Leaders
Green Image
Issue No. 03 - March (2013 vol. 25)
ISSN: 1041-4347
pp: 481-493
O. Kucuktunc , Dept. of Comput. Sci. & Eng., Ohio State Univ., Columbus, OH, USA
H. Ferhatosmanoglu , Dept. of Comput. Eng., Bilkent Univ., Ankara, Turkey
Traditional 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 \lambda-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 ( 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.
Search problems, Nearest neighbor searches, Spatial databases, Search methods, Query processing, Diversity methods, Information retrieval, Gabriel graph, Diversity, diverse nearest neighbor search, angular similarity, natural neighbors

H. Ferhatosmanoglu and O. Kucuktunc, "λ-diverse nearest neighbors browsing for multidimensional data," in IEEE Transactions on Knowledge & Data Engineering, vol. 25, no. , pp. 481-493, 2013.
190 ms
(Ver 3.3 (11022016))