Filters








18,816 Hits in 4.9 sec

BORDER: efficient computation of boundary points

Chenyi Xia, W. Hsu, M.L. Lee, B.C. Ooi
2006 IEEE Transactions on Knowledge and Data Engineering  
BORDER employs the state-of-the-art database technique -the Gorder kNN join and makes use of the special property of the reverse k-nearest neighbor (RkNN) .  ...  Our experimental study shows that BORDER detects boundary points effectively and efficiently on various datasets.  ...  The reverse k-nearest neighbors (RkNN) of an object p are points that look upon p as one of their k-nearest neighbors.  ... 
doi:10.1109/tkde.2006.38 fatcat:iqdkqmambzbztmb52zgexlwfhm

High-dimensional kNN joins with incremental updates

Cui Yu, Rui Zhang, Yaochun Huang, Hui Xiong
2009 Geoinformatica  
The k Nearest Neighbor (kNN) join operation associates each data object in one data set with its k nearest neighbors from the same or a different data set.  ...  The kNN join on high-dimensional data (high-dimensional kNN join) is an especially expensive operation.  ...  R× kN N S kNN join of R and S k the sequence number as a NN for a reverse nearest neighbor point RN N j the jth reverse nearest neighbor rID RN N j the sequence number of point RN N j in its data  ... 
doi:10.1007/s10707-009-0076-5 fatcat:mrtcovbqrzb7xkvr23rss272iu

Efficient k-nearest neighbor graph construction for generic similarity measures

Wei Dong, Charikar Moses, Kai Li
2011 Proceedings of the 20th international conference on World wide web - WWW '11  
K-Nearest Neighbor Graph (K-NNG) construction is an important operation with many web related applications, including collaborative filtering, similarity search, and many others in data mining and machine  ...  Our method is based on local search, has minimal space overhead and does not rely on any shared global index.  ...  The situation is worse when reverse K-NN is considered, as there is no limit on the size of reverse K-NN.  ... 
doi:10.1145/1963405.1963487 dblp:conf/www/DongCL11 fatcat:bsy4mgky6jbbtg7jp5p2lhr6qm

Approximate k-NN Graph Construction: a Generic Online Approach [article]

Wan-Lei Zhao, Hui Wang, Chong-Wah Ngo
2020 arXiv   pre-print
Each sample along with its k-nearest neighbors are joined into the k-nearest neighbor graph by performing the nearest neighbor search sequentially on the graph under construction.  ...  On the other hand, the built k-nearest neighbor graph is used to support k-nearest neighbor search.  ...  In the flat k-NN graph, both the k nearest neighbors of one sample and its reverse neighbors are kept.  ... 
arXiv:1804.03032v5 fatcat:4go4mznqtrahjgfudlaiojxxsi

Reversed CF: A fast collaborative filtering algorithm using a k-nearest neighbor graph

Youngki Park, Sungchan Park, Woosung Jung, Sang-goo Lee
2015 Expert systems with applications  
One main idea of this approach is to reverse the process of finding k neighbors; instead of finding k similar neighbors of unrated items, RCF finds the k-nearest neighbors of rated items.  ...  In this paper, we present Reversed CF (RCF), a rapid CF algorithm which utilizes a k-nearest neighbor (k-NN) graph.  ...  In this paper, we present Reversed CF (RCF), 1 a fast CF algorithm using a k-nearest neighbor (k-NN) graph. One main idea of this approach is that it reverses the process of finding k neighbors.  ... 
doi:10.1016/j.eswa.2015.01.001 fatcat:uwyyphxonjhy7gumipoi5oyoom

Nearest Neighbors Problem [chapter]

D. J. O'Neil
2016 Encyclopedia of GIS  
SYNONYMS nearest neighbor, all-nearest-neighbors, all-k-nearest neighbors, reverse-nearestneighbor-problem, reverse-k-nearest-neighbors aNN, akNN, rNN, rkNN, range query DEFINITION Given a set of n points  ...  nearest neighbor.  reverse-k-nearest-neighbor (rkNN): rkNN is similar to rNN except that it finds all points such that the query point, q, is in the set of their k-nearest-neighbors.  ...  This example also demonstrates the k-nearest-nearest neighbors search. In this case, n could be all the gas stations in the world and k could be four.  ... 
doi:10.1007/978-3-319-23519-6_869-2 fatcat:nxmkyioqpvcpljvs3l2fje42nm

Nearest Neighbors Problem [chapter]

D.J. O'Neil
2008 Encyclopedia of GIS  
SYNONYMS nearest neighbor, all-nearest-neighbors, all-k-nearest neighbors, reverse-nearestneighbor-problem, reverse-k-nearest-neighbors aNN, akNN, rNN, rkNN, range query DEFINITION Given a set of n points  ...  nearest neighbor.  reverse-k-nearest-neighbor (rkNN): rkNN is similar to rNN except that it finds all points such that the query point, q, is in the set of their k-nearest-neighbors.  ...  This example also demonstrates the k-nearest-nearest neighbors search. In this case, n could be all the gas stations in the world and k could be four.  ... 
doi:10.1007/978-0-387-35973-1_869 fatcat:rqixgtsorne67kkl4deorqbmhi

Influence sets based on reverse nearest neighbor queries

Flip Korn, S. Muthukrishnan
2000 Proceedings of the 2000 ACM SIGMOD international conference on Management of data - SIGMOD '00  
neighbor called the reverse nearest neighbors.  ...  In uence sets based on reverse nearest neighbor RNN queries seem to capture the intuitive notion of in uence from our motivating examples.  ...  Reverse k-nearest neighbors. A rather simple extension of the in uence set of point q is to de ne it to be the set of all points that have q as one of their k nearest neighbors.  ... 
doi:10.1145/342009.335415 dblp:conf/sigmod/KornM00 fatcat:6fof7umbkrgxvofyye3ropiglu

A Voronoi-Based Group Reverse k Farthest Neighbor Query Method in the Obstacle Space

Yongshan Liu, Xiang Gong, Dehan Kong, Tianbao Hao, Xiaoqi Yan
2020 IEEE Access  
Then we get the candidate set using the theorem of transformation between k nearest neighbors and k farthest neighbors. Finally, the refining algorithm is given to get the final results.  ...  To this end, this paper proposed the V-OGRkFN(Voronoi-Obstacle Group Reverse k Farthest Neighbor) algorithm.  ...  Among them, the mutual transformation theorem between reverse k nearest neighbor and reverse k farthest neighbor is the main idea to the reverse k far neighbor query algorithm of obstacle group.  ... 
doi:10.1109/access.2020.2979739 fatcat:ovfyvjnltvhldjoz2rl44nsacq

Voronoi-Based Geospatial Query Processing with MapReduce

Afsin Akdogan, Ugur Demiryurek, Farnoush Banaei-Kashani, Cyrus Shahabi
2010 2010 IEEE Second International Conference on Cloud Computing Technology and Science  
Most of the existing query-answering approaches assume centralized processing on a single machine although GQs are intrinsically parallelizable.  ...  nearest neighbor (RNN), maximum reverse nearest neighbor (MaxRNN) and k nearest neighbor (kNN) queries.  ...  Given that p k is p i 's nearest neighbor, p k 's reverse nearest neighbor includes p i and possibly other points whose nearest neighbors are p k as well.  ... 
doi:10.1109/cloudcom.2010.92 dblp:conf/cloudcom/AkdoganDKS10 fatcat:cch3mr7fsjhazodyv3d3iiuzz4

Hub Labels on the database for large-scale graphs with the COLD framework

Alexandros Efentakis, Christodoulos Efstathiades, Dieter Pfoser
2017 Geoinformatica  
Our COLD framework (COmpressed Labels on the Database) may answer multiple distance queries (vertex-to-vertex, one-tomany, k-Nearest Neighbors, Reverse k-Nearest Neighbors, Reverse k-Farthest Neighbors  ...  Shortest-path computation on graphs is one of the most well-studied problems in algorithmic theory.  ...  k-Nearest Neighbor (kNN) queries One-to-Many queries Reverse k-Nearest Neighbor (RkNN) queries Reverse k-Farthest Neighbor (RkFN) queries We repeat the previous Reverse k-Farthest Neighbor experiments  ... 
doi:10.1007/s10707-016-0287-5 fatcat:sqz7o5bogbgevaq6iafh3ifa4e

Category- and selection-enabled nearest neighbor joins

Francesco Cafagna, Michael H. Böhlen, Annelies Bracher
2017 Information Systems  
This paper proposes a category-and selection-enabled nearest neighbor join (NNJ) between relation r and relation s, with similarity on T and support for category attributes C and selection predicate .  ...  Abstract This paper proposes a category-and selection-enabled nearest neighbor join (NNJ) between relation r and relation s, with similarity on T and support for category attributes C and selection predicate  ...  of an join and a k-nearest neighbor join, and a reverse k-nearest neighbor join [17] which determines the tuples that have the query points as one of their k-nearest neighbors.  ... 
doi:10.1016/j.is.2017.01.006 fatcat:l4bgy4mnongxlj6jksl5vcnriy

Analysis and evaluation of the top- $$k$$ k most influential location selection query

Jian Chen, Jin Huang, Zeyi Wen, Zhen He, Kerry Taylor, Rui Zhang
2014 Knowledge and Information Systems  
On determining the traversal order, while EEP leverages distance metrics between nodes, BIP relies on half plane pruning which avoids the repetitive estimations in EEP. As our experiments shown,  ...  Definition 1 (Reverse Nearest Neighbors) The customers who perceive a facility as their nearest facility are reverse nearest neighbors of this facility.  ...  Related Work Reverse Nearest Neighbor Korn and Muthukrishnan [16] first proposed the reverse nearest neighbor (RNN) query and define the RNNs of an object o to be the objects whose respective nearest  ... 
doi:10.1007/s10115-013-0720-0 fatcat:h7mtqrwfjvbtfl22ggwxpnwxvm

Hubness in Unsupervised Outlier Detection Techniques for High Dimensional Data –A Survey

R.Lakshmi Devi, R. Amalraj
2015 International Journal of Computer Applications Technology and Research  
Hubness is an aspect for the increase of dimensionality pertaining to nearest neighbors which has come to an attention.  ...  This survey article, discusses some important aspects of the hubness in detail and presents a comprehensive review on the state-of-the-art specialized algorithms for unsupervised outlier detection for  ...  The approach used in [8] is based on the relationship between k-Nearest Neighbor and Reverse Nearest Neighbor which involves two phases.  ... 
doi:10.7753/ijcatr0411.1004 fatcat:l3lxmvua2je7xpvxnp7k7ni2pa

Near neighbor join

Herald Kllapi, Boulos Harb, Cong Yu
2014 2014 IEEE 30th International Conference on Data Engineering  
The traditional approach taken is nearest neighbor join (also called similarity join), whose goal is to find, based on a given join function, the closest set of objects or all the objects within a distance  ...  In this paper, we propose a practical alternative approach called near neighbor join that, although does not find the closest neighbors, finds close neighbors, and can do so at extremely large scale when  ...  For each o i , let R nearest i be the top-k nearest neighbors of o i ; i.e., ∀(j, k), o j / ∈ R nearest i , o k ∈ R nearest i , F J (o i , o j ) ≥ F J (o i , o k ).  ... 
doi:10.1109/icde.2014.6816728 dblp:conf/icde/KllapiHY14 fatcat:jz67x6zpzzfjlgfimrnuumgh64
« Previous Showing results 1 — 15 out of 18,816 results