Finding near neighbors through cluster pruning

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2007, Pages 103-112

  Chierichetti, Flavio ^a   Panconesi, Alessandro ^a   Raghavan, Prabhakar ^b   Sozio, Mauro ^a   Tiberi, Alessandro ^a   Upfal, Eli ^c  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b YAHOO RESEARCH   (United States)

^c Brown Univerity   (United States)

Author keywords

Clustering; Generative model; Nearest neighbor

Indexed keywords

GENERATIVE MODELS; PREPROCESSING; RANDOMIZED TECHNIQUES;

COMPUTATION THEORY; INFORMATION MANAGEMENT; INFORMATION RETRIEVAL; PATTERN MATCHING; QUERY LANGUAGES; QUERY PROCESSING; RANDOM PROCESSES;

LEARNING SYSTEMS;

EID: 35448996113     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1265530.1265545     Document Type: Conference Paper

References (25)

1. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Wu. An optimal algorithm for nearest neighbor searching. In SODA '91
2. S. Berchtold, K. Keim, and H.-P. Kriegel. The X-Tree: An index structure for high dimensional data. In VLDB'96.
3. E. Kushilevitz, R. Ostrovsky, and Y. Rabani. Efficient search for approximate nearest neighbor in high dimensional spaces. SIAM Journal on Computing, 30(2):451-474, 2000.
4. M. Bern. Approximate closest point queries in high dimensions. Information Processing Letters, 45, 1993.
5. T Bozkaya and M. Ozsoyoglu. Distance-based indexing for high-dimensional metric spaces. In PODS'97.
6. K. Clarkson. Nearest neighbor queries in metric spaces. In STOC'97.
7. R. Motwani, P. Indyk. Approximate nearest neighbor - towards removing the curse of dimensionality. In STOC'98.
8. Vladimir Pestov. On the geometry of similarity search: dimensionality curse and concentration of measure. Information Processing Letters, To Appear.
9. K. S. Beyer, J. Goldstein, R. Ramakrishnan, and Uri Shaft. When is "nearest neighbor" meaningful? In ICDT '99.
10. K. P. Bennett, U. Fayyad, and D. Geiger. Density-based indexing for approximate nearest-neighbor queries. In KDD '99.
11. Sergey Brin. Near neighbor search in large metric spaces. In The VLDB Journal, 574-584, 1995.
12. R. Fagin, R. Kumar, and D. Sivakumar Efficient similarity search and classification via rank aggregation. SIGMOD '03.
13. A. Gionis, P. Indyk, and R. Motwani. Similarity search in high dimensions via hashing. In The VLDB Journal, 1999.
14. H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, New York, NY, 1987.
15. L. Ertz, M. Steinbach, and V. Kumar. Finding topics in collections of documents: A shared nearest neighbor approach. In Text Mine '01.
16. C. Buckley and A. F. Lewit. Optimization of inverted vector searches. In SIGIR '85, 97-110.
17. M. Steinbach, G. Karypis, and V. Kumar. A comparison of document clustering techniques. In KDD Workshop on Text Mining, 2000.
18. P. Willet. Recent trends in hierarchical document clustering: a critical review. In Information Processing and Management, vol. 24(5), 577-597, 1988.
19. D. Comer. The ubiquitous b-tree. In ACM Computing Surveys, 11(2):121137, 1979.
20. A. Guttman. R-trees: A dynamic index structure for spatial searching. In SIGMOD '84.
21. G. Karypis, E-H Han, and V. Kumar. Chameleon: Hierarchical Clustering Using Dynamic Modeling. IEEE Computer, 32(8):68-75, August 1999.
22. N. Katayama and S. Satoh. The sr-tree: An index structure for high-dimensional nearest neighbor queries. In SIGMOD'97.
23. A. N. Papadopoulos Y. Manolopoulos, A. Nanopoulos and Y. Theodoridis. R-trees have grown everywhere. In Technical Report available at http://www.rtreeportal.org/, 2003.
24. F. J. MacWilliams and N. J. A. Sloane. The Theory of Error Correcting Codes. Amsterdam: North-Holland, 1977.
25. J. Goldstein and Raghu Ramakrishnan. Contrast Plots and P-Sphere Trees: Space vs. Time in Nearest Neighbour Searches. In VLDB'00.