Approximate nearest neighbor algorithm based on navigable small world graphs

[1]  C. Sneha,et al.  USER-BASED COLLABORATIVE-FILTERING RECOMMENDATION , 2015 .

[2]  Gonzalo Navarro,et al.  Succinct nearest neighbor search , 2011, Inf. Syst..

[3]  Vladimir Krylov,et al.  Scalable Distributed Algorithm for Approximate Nearest Neighbor Search Problem in High Dimensional General Metric Spaces , 2012, SISAP.

[4]  Piotr Indyk,et al.  Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality , 2012, Theory Comput..

[5]  Benjamin Bustos,et al.  On nonmetric similarity search problems in complex domains , 2011, CSUR.

[6]  Edgar Chávez,et al.  Navigating K-Nearest Neighbor Graphs to Solve Nearest Neighbor Searches , 2010, MCPR.

[7]  Andrea Esuli,et al.  CoPhIR: a Test Collection for Content-Based Image Retrieval , 2009, ArXiv.

[8]  Karl Aberer,et al.  Distributed similarity search in high dimensions using locality sensitive hashing , 2009, EDBT '09.

[9]  Marco Patella,et al.  Approximate similarity search: A multi-faceted problem , 2009, J. Discrete Algorithms.

[10]  Gonzalo Navarro,et al.  Effective Proximity Retrieval by Ordering Permutations , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Anne-Marie Kermarrec,et al.  Peer to Peer Multidimensional Overlays: Approximating Complex Structures , 2007, OPODIS.

[12]  Anne-Marie Kermarrec,et al.  VoroNet: A scalable object network based on Voronoi tessellations , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[13]  Oskar Sandberg,et al.  Neighbor Selection and Hitting Probability in Small-World Graphs , 2007, ArXiv.

[14]  Oskar Sandberg,et al.  The Structure and Dynamics of Navigable Networks , 2007 .

[15]  Ian Clarke,et al.  The evolution of navigable small-world networks , 2006, ArXiv.

[16]  Jun Sakuma,et al.  Fast approximate similarity search in extremely high-dimensional data sets , 2005, 21st International Conference on Data Engineering (ICDE'05).

[17]  Gonzalo Navarro,et al.  Probabilistic proximity searching algorithms based on compact partitions , 2002, J. Discrete Algorithms.

[18]  Chak-Kuen Wong,et al.  Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees , 1977, Acta Informatica.

[19]  Jon Louis Bentley,et al.  Quad trees a data structure for retrieval on composite keys , 1974, Acta Informatica.

[20]  Steven Salzberg,et al.  A Weighted Nearest Neighbor Algorithm for Learning with Symbolic Features , 2004, Machine Learning.

[21]  Gonzalo Navarro,et al.  Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces , 2003, Inf. Process. Lett..

[22]  Ricardo A. Baeza-Yates,et al.  Searching in metric spaces , 2001, CSUR.

[23]  John Riedl,et al.  Item-based collaborative filtering recommendation algorithms , 2001, WWW '01.

[24]  Gonzalo Navarro,et al.  A Probabilistic Spell for the Curse of Dimensionality , 2001, ALENEX.

[25]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.

[26]  Gonzalo Navarro,et al.  Searching in metric spaces by spatial approximation , 1999, 6th International Symposium on String Processing and Information Retrieval. 5th International Workshop on Groupware (Cat. No.PR00268).

[27]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[28]  Rafail Ostrovsky,et al.  Efficient search for approximate nearest neighbor in high dimensional spaces , 1998, STOC '98.

[29]  Piotr Indyk,et al.  Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.

[30]  Sunil Arya,et al.  An optimal algorithm for approximate nearest neighbor searching fixed dimensions , 1998, JACM.

[31]  Kenneth L. Clarkson,et al.  Nearest Neighbor Queries in Metric Spaces , 1997, STOC '97.

[32]  Dragutin Petkovic,et al.  Query by Image and Video Content: The QBIC System , 1995, Computer.

[33]  Myron Flickner,et al.  Query by Image and Video Content , 1995 .

[34]  Sunil Arya,et al.  Approximate nearest neighbor queries in fixed dimensions , 1993, SODA '93.

[35]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

[36]  Richard A. Harshman,et al.  Indexing by Latent Semantic Analysis , 1990, J. Am. Soc. Inf. Sci..

[37]  W. Rychlik,et al.  A computer program for choosing optimal oligonucleotides for filter hybridization, sequencing and in vitro amplification of DNA. , 1989, Nucleic acids research.

[38]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[39]  Peter E. Hart,et al.  Nearest neighbor pattern classification , 1967, IEEE Trans. Inf. Theory.