Disorder inequality: A combinatorial approach to nearest neighbor search

WSDM'08 - Proceedings of the 2008 International Conference on Web Search and Data Mining

Volumn , Issue , 2008, Pages 25-32

  Goyal, Navin ^a   Lifshits, Yury ^b   Schütze, Hinrich ^c  

^a Georgia Institute of Technology   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITY OF STUTTGART   (Germany)

Author keywords

Disorder constant; Disorder dimension; Disorder inequality; Nearest neighbor search; Proximity search; Random walk; Randomized algorithms; Similarity search

Indexed keywords

COMBINATORIAL MATHEMATICS; LINEAR PROGRAMMING; QUADRATIC PROGRAMMING; QUERY PROCESSING; RANDOM PROCESSES; SEARCH ENGINES;

DISORDER CONSTANT; DISORDER DIMENSION; DISORDER INEQUALITY; NEAREST NEIGHBOR SEARCH; PROXIMITY SEARCH; RANDOM WALK; RANDOMIZED ALGORITHMS; SIMILARITY SEARCH;

ALGORITHMS;

EID: 42549130490     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1341531.1341538     Document Type: Conference Paper

References (43)

1. A. Agarwal and S. Chakrabarti. Learning random walks to rank nodes in graphs. In ICML '07, 2007.
2. A. Andoni and P. Indyk. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In FOCS'06, 2006.
3. R. Angelova and G. Weikum. Graph-based text classification: Learn from your neighbors. In SIGIR '06, 2006.
4. Z. Bar-Yossef, I. Keidar, and U. Schonfeld. Do not crawl in the dust: Different urls with similar text. In WWW'06, 2006.
5. M. Batko, D. Novak, and P. Zezula. MESSIF: Metric similarity search implementation framework. In DEL OS'07, 2007.
6. A. Beygelzimer, S. Kakade, and J. Langford. Cover trees for nearest neighbor. In ICML'06, 2006.
7. A. Blessing and H. Schütze. Inverted indexes for fast distributional similarity computations. To appear, 2007.
8. A. Z. Broder, M. Charikar, A. M. Frieze, and M. Mitzenmacher. Min-wise independent permutations. In STOC, 1998.
9. E. Chavez, G. Navarro, R. Baeza-Yates, and J. L. Marroquim Searching in metric spaces. ACM Computing Surveys, 2001.
10. K. L. Clarkson. Nearest-neighbor searching and metric space dimensions. In Nearest-Neighbor Methods for Learning and Vision: Theory and Practice, MIT Press, 2006.
11. R. Cole and L.-A. Gottlieb. Searching dynamic point sets in spaces with bounded doubling dimension. In STOC, 2006.
12. R. Cole, L.-A. Gottlieb, and M. Lewenstein. Dictionary matching and indexing with errors and don't cares. In STOC, pages 91-100, 2004.
13. J. Dean and M. R. Henzinger. Finding related web pages in the world wide web. In WWW'99, 1999.
14. M. Dubinko, R. Kumar, J. Magnani, J. Novak, P. Raghavan, and A. Tomkins. Visualizing tags over-time. In WWW'06, 2006.
15. R. Fagin, R. Kumar, and D. Sivakumar. Efficient similarity search and classification via rank aggregation. In SIGMOD'03, 2003.
16. D. Fetterly, M. Manasse, and M. Najork. Detecting phrase-level duplication on the world wide web. In SIGIR'05, 2005.
17. S. Har-Peled and M. Mendel. Fast construction of nets in low dimensional metrics, and their applications. SoCG'05, SIAM Journal on Computing 2006, 2006.
18. M. Henzinger, A. Heydon, M. Mitzenmacher, and M. Najork. Measuring index quality using random walks on the web. In WWW'99, 1999.
19. E. A. Hirsch and A. Kojevnikov. Unitwalk: A new SAT solver that uses local search guided by unit clause elimination. Annals of Mathematics and Artificial Intelligence, 2005.
20. G. Hjaltason and H. Samet. Index-driven similarity search in metric spaces. ACM Transactions on Database Systems, 2003.
21. B. Hoffmann, Y. Lifshits, and D. Nowotka. Maximal intersection queries in randomized graph models. In CSR '07, 2007.
22. S. Ilyinsky, M. Kuzmin, A. Melkov, and I. Segaovich. An efficient method to detect duplicates of web documents with the use of inverted index. In WWW'02, 2002.
23. P. Indyk. Nearest neighbors in high-dimensional spaces. Chapter 39 of Handbook of Discrete and Computational Geometry, CRC Press, Second Edition, 2004.
24. P. Indyk. Private communication, 2007.
25. P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In STOC, 1998.
26. D. R. Karger and M. Ruhl. Finding nearest neighbors in growth-restricted metrics. In STOC, 2002.
27. J. Kleinberg. The small-world phenomenon: an algorithm perspective. In STOC, pages 163-170, 2000.
28. J. M. Kleinberg. Two algorithms for nearest-neighbor search in high dimensions. In STOC, 1997.
29. J. A. Konstan, B. N. Miller, D. Maltz, J. L. Herlocker, L. R. Gordon, and J. Riedl. Grouplens: applying collaborative filtering to usenet news. Commun. ACM, 40(3):77-87, 1997.
30. R. Krauthgamer and J. R. Lee. Navigating nets: simple algorithms for proximity search. In SODA '04, 2004.
31. R. Krauthgamer and J. R. Lee. The black-box complexity of nearest-neighbor search. Theoretical Computer Science, 2005.
32. E. Kushilevitz, R. Ostrovsky, and Y. Rabani. Efficient search for approximate nearest neighbor in high dimensional spaces. SIAM J. Comput., 2000.
33. R. Lempel and S. Moran. Rank-stability and rank-similarity of link-basedweb ranking algorithms in authority-connected graphs. Information Retrieval, 2005.
34. D. D. Lewis, Y. Yang, T. G. Rose, and F. Li. RCV1: A new benchmark collection for text categorization research. Journal of Machine Learning Research, 2004.
35. Y. Lifshits. A guide to web research. Materials of mini-course at Stuttgart University. http://logic.pdmi.ras.ru/~yura/webguide.html, 2007.
36. Y. Lifshits and D. Nowotka. Estimation of the click volume by large scale regression analysis. In CSR'07, 2007.
37. Y. Lifshits and S. Zhang. Similarity search via combinatorial nets. Submitted.
38. G. Linden, B. Smith, and J. York. Amazon.com recommendations: item-to-item collaborative filtering. Internet Computing, 2003.
39. C. D. Manning, P. Raghavan, and H. Schütze. Introduction to Information Retrieval. Cambridge University Press, to appear in 2008.
40. C. D. Manning and H. Schütze. Foundations of Statistical Natural Language Processing. MIT Press, 1999.
41. A. Ntoulas, M. Najork, M. Manasse, and D. Fetterly. Detecting spam web pages through content analysis. In WWW'06, 2006.
42. M. T. Orchard. A fast nearest-neighbor search algorithm. In ICASSP'91, 1991.
43. C. Sahinalp and A. Utis. Hardness of string similarity search and other indexing problems. In ICALP'04, 2004.