Rank-based similarity search: Reducing the dimensional dependence

NII Technical Reports

Volumn , Issue 4, 2012, Pages

  Houle, Michael E ^a   Nett, Michael ^b  

^a NATIONAL INSTITUTE OF INFORMATICS   (Japan)

^b UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING APPLICATIONS; DATA SETS; HIGH PROBABILITY; K-NN SEARCH; OVERALL EXECUTION; PROBABILISTIC DATA; QUERY RESULTS; SIMILARITY SEARCH;

NICKEL COMPOUNDS;

DATA STRUCTURES;

EID: 84866660591     PISSN: 13465597     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (42)

1. A. Andoni and P Indyk. E2LSH 0.1: User Manual, 2005. Software available at www.mit.edu/andoni/LSH/.
2. A. Asuncion and D. J. Newman. UCI machine learning repository, 2007.
3. K. S. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft. When is "nearest neighbor" meaningful? In ICDT '99: Proceedings of the 7th International Conference on Database Theory, pages 217-"235, London, UK, 1999. Springer-"Verlag.
4. A. Beygelzimer, S. Kakade, and J. Langford. Cover trees for nearest neighbor. In ICML '06: Proc. 23rd Intern. Conf on Machine Learning, pages 97-"104, 2006.
5. I. Bozkaya and M. Ozsoyoglu. Indexing large metric spaces for similarity search queries. ACM Trans. Database Syst., 24(3):361-"404, 1999.
6. M. M. Breunig, 11.-"P Kriegel, R. I. Ng, and J. Sander. Lof: identifying density-"based local outliers. SIGMOD Rec., 29(2):93-"104, 2000.
7. S. Brin. Near neighbor search in large metric spaces. In VLDB '95: Proceedings of the 21 th International Conference on Very Large Data Bases, pages 574 584, 1995.
8. V. Chandola, A. Banerjee, and V. Kumar. Anomaly detection: A survey. ACM Comput. Surv., 41(3):1-"58, 2009.
9. E. Chavez, G. Navarro, R. Baeza-"Yates, and J. L. MarroquIn. Searching in metric spaces. ACM Comput. Surv.. 33(3):273-"321, 2001.
10. P. Ciaccia, M. Patella, and P. Zezula. M-"tree: An efficient access method for similarity search in metric spaces. In VLDB'97, Proc. 23rd Intern. Conf on Very Large Data Bases, pages 426-"435, 1997.
11. T. Cover and P. Hart. Nearest neighbor pattern classification. Information Theory; IEEE Transactions on, 13(1) :21-"27, 1967.
12. T. de Vries, S. Chawla, and M. E. Houle. Finding local anomalies in very high dimensional space. In Proc. 2010 IEEE Intern. Conf on Data Mining, pages 128-"137, 2010.
13. M. Ester, 11.-"P. Kriegel, J. Sander, and X. Xu. A density-"based algorithm for discovering clusters in large spatial databases with noise. In Proc. 2nd mt. Conf on Knowl. Discovery and Data Mining (KDD), pages 226-"231, 1996.
14. J. M. Geusebroek, G. J. Burghouts, and A. W. M. Smeulders. The Amsterdam library of object images. Intern. J. Computer Vision, 61(1):103-"112, 2005.
15. A. Gionis, P. Indyk, and R. Motwani. Similarity search in high dimensions via hashing. In VLDB '99: Proc. 25th Intern. Conf on Very Large Data Bases, pages 518-"529, 1999.
16. J. E. Goodman and J. O'Rourke, editors. Handbook of Discrete and Computational Geometry. CRC Press, 1997.
17. N. Goyal, Y. Lifshits, and H. Schutze. Disorder inequality: A combinatorial approach to nearest neighbor search. In WSDM'08: Proc. Intern. Conf on Web Search and Web Data Mining, pages 25-"32, 2008.
18. S. Guha, R. Rastogi, and K. Shim. ROCK: A robust clustering algorithm for categorical attributes. Information Systems, 25(5):345-"366, 2000.
19. A. Gupta, R. Krauthgamer, and J. R. Lee. Bounded geometries, fractals, and low-"distortion embeddings. In FOCS '03: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, page 534, 2003.
20. A. Guttman. R-"trees: A dynamic index structure for spatial searching. In B. Yormark, editor, SIGMOD'84, Proceedings of Annual Meeting, Boston, Massachusetts, June 18-"21, 1984, pages 47-"57, 1984.
21. J. Han and M. Kamber. Data Mining: Concepts and Techniques. Morgan Kaufmann, San Francisco, CA, USA, 2006.
22. M. E. Houle. The relevant set correlation model for data clustering. Statistical Analysis and Data Mining, 1(3): 157-"176, 2008.
23. M. E. Houle and J. Sakuma. Fast approximate similarity search in extremely high-"dimensional data sets. In ICDE '05: Proc. 21st Intern. Conf on Data Engineering, pages 619-"630, 2005.
24. P Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In STOC '98: Proc. 30th ACM Symp. on Theory of computing, pages 604-"613, 1998.
25. D. R. Karger and M. Ruhl. Finding nearest neighbors in growth-"restricted metrics. In STOC '02: Proc. 34th ACM Symp. on Theory of Computing, pages 741-"750, 2002.
26. N. Katayama and S. Satoh. The sr-"tree: An index structure for high-"dimensional nearest neighbor queries. In Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data, May 1997.
27. R. Krauthgamer and J. R. Lee. Navigating nets: simple algorithms for proximity search. In SODA '04: Proc. of 15th Annual ACM-"SIAM Symp. on Discrete Algorithms, pages 798-"807, 2004.
28. Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner. Gradient-" based learning applied to document recognition. Proceedings of the IEEE, 860 l):2278-"2324, November 1998.
29. Y. Lifshits and S. Zhang. Combinatorial algorithms for nearest neighbors, near-"duplicates and small-"world design. In SODA, pages 318-"326, 2009.
30. R. Motwani and P. Raghavan. Randomized algorithms. ACM Comput. Surv, 28(1):33-"37, 1996.
31. D. M. Mount and S. Arya. ANN: A library for approximate nearest neighbor searching, 2010.
32. M. Muja and D. O. Lowe. Fast approximate nearest neighbors with automatic algorithm configuration. In International Conference on Computer Vision Theory and Application VISSAPP'09), pages 331-"340. INSTICC Press, 2009.
33. O. Navarro. Searching in metric spaces by spatial approximation. In SPIRE '99: Proceedings of the String Processing and Information Retrieval Symposium & International Workshop on Groupware, page 141, Washington, DC, USA, 1999. IEEE Computer Society.
34. V. Pestov. On the geometry of similarity search: dimensionality curse and concentration of measure. Inf Process. Lett., 73(1-"2)47-"51, 2000.
35. W. Pugh. Skip lists: A probabilistic alternative to balanced trees. Commun. ACM, 33(6):668-"676, 1990.
36. Reuters Ltd. Reuters corpus, volume 2, multilingual corpus. http://trec. n ist. gov/data/reute rs/re uters. Ii toil.
37. H. Samet. Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann, San Francisco, CA, USA, 2006.
38. B. M. Sarwar, U. Karypis, J. A. Konstan, and J. I. Riedl. Application of dimensionality reduction in recommender system a case study. In In Proc ACM WebKDD Workshop, 2000.
39. C. J. Stone. Consistent parametric regression. Annals of Statistics, 5(4)595-"645, 1977.
40. D. Tschopp and S. N. Diggavi. Approximate nearest neighbor search through comparisons. CORR, abs/0909.2194, 2009.
41. R. Weber, 11.-"i. Schek, and S. Blott. A quantitative analysis and performance study for similarity-"search methods in high-" dimensional spaces. In VLDB '98: Proc 24rd Intern. Conf on Very Large Data Bases, pages 194-"205, 1998.
42. N. Ye. The Handbook of Data Mining. Lawrence Erlbaum, 2003.