Efficient K-Nearest Neighbor Graph Construction Using MapReduce for Large-Scale Data Sets
Authors:
- 1 January 2014
- journal article
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E97.D (12) , 3142-3154
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- Query-driven iterated neighborhood graph search for large scale indexing2012
- Randomized approximate nearest neighbors algorithmProceedings of the National Academy of Sciences, 2011
- Fast agglomerative clustering using information of k-nearest neighborsPattern Recognition, 2010
- Data clustering: 50 years beyond K-meansPattern Recognition Letters, 2010
- Fast construction of k-nearest neighbor graphs for point cloudsIEEE Transactions on Visualization and Computer Graphics, 2010
- Nearest-neighbor-preserving embeddingsACM Transactions on Algorithms, 2007
- A fast all nearest neighbor algorithm for applications involving large point-cloudsComputers & Graphics, 2007
- Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces2006
- Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensionsIEEE Transactions on Knowledge and Data Engineering, 2005
- A Global Geometric Framework for Nonlinear Dimensionality ReductionScience, 2000