Approximate k-NN graph construction: A generic online approach

• المؤلفون الرئيسيون: ZHAO, Wan-Lei, WANG, Hui, NGO, Chong-wah
• التنسيق: text
• اللغة: English
• منشور في: Institutional Knowledge at Singapore Management University 2022
• الموضوعات: Measurement; Quantization (signal); Indexing; Task analysis; Nearest neighbor methods; Approximation algorithms; Time complexity; k-nearest neighbor graph; nearest neighbor search; high-dimensional; NN-descent; Databases and Information Systems
• الوصول للمادة أونلاين: 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
• المؤسسة: Singapore Management University

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...