Approximate k-NN graph construction: A generic online approach
Nearest neighbor search and k-nearest neighbor graph construction are two fundamental issues that arise from many disciplines such as multimedia information retrieval, data-mining, and machine learning. They become more and more imminent given the big data emerge in various fields in recent years. I...
Saved in:
Main Authors: | ZHAO, Wan-Lei, WANG, Hui, NGO, Chong-wah |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2022
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/7244 https://ink.library.smu.edu.sg/context/sis_research/article/8247/viewcontent/Approximate_k_NN_Graph_Construction.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
BORDER: Efficient computation of boundary points
by: Xia, C., et al.
Published: (2013) -
Monitoring Network Data Streams
by: ZHANG RUI
Published: (2010) -
Finding all nearest neighbors with a single graph traversal
by: XU, Yixin, et al.
Published: (2018) -
Efficient processing of KNN and skyjoin queries
by: HU JING
Published: (2010) -
Continuous Obstructed Nearest Neighbor Queries in Spatial Databases
by: GAO, Yunjun, et al.
Published: (2009)