Finding all nearest neighbors with a single graph traversal
Finding the nearest neighbor is a key operation in data analysis and mining. An important variant of nearest neighbor query is the all nearest neighbor (ANN) query, which reports all nearest neighbors for a given set of query objects. Existing studies on ANN queries have focused on Euclidean space....
Saved in:
Main Authors: | XU, Yixin, QI Jianzhong, BOROVICA‐GAJIC Renata, KULIK Lars |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2018
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/8276 https://ink.library.smu.edu.sg/context/sis_research/article/9279/viewcontent/Finding_All_Nearest_Neighbors_with_a_Single_Graph_Traversal.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Ranked Reverse Nearest Neighbor Search
by: LEE, Ken C. K., et al.
Published: (2008) -
Continuous Obstructed Nearest Neighbor Queries in Spatial Databases
by: GAO, Yunjun, et al.
Published: (2009) -
Dynamic Nearest Neighbor Queries in Euclidean Space
by: NUTANONG, Sarana, et al.
Published: (2017) -
Two ellipse-based pruning methods for group nearest neighbor queries
by: Li, H., et al.
Published: (2013) -
Authenticated multistep nearest neighbor search
by: Papadopoulos, S., et al.
Published: (2013)