Subspace similarity search using the ideas of ranking and top-k retrieval

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2010, Pages 4-9

  Bernecker, Thomas ^a   Emrich, Tobias ^a   Graf, Franz ^a   Kriegel, Hans Peter ^a   Kröger, Peer ^a   Renz, Matthias ^a   Schubert, Erich ^a   Zimek, Arthur ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

NEAREST NEIGHBORS; SIMILARITY QUERY; SIMILARITY SEARCH;

INFORMATION RETRIEVAL;

EID: 77952667427     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDEW.2010.5452771     Document Type: Conference Paper

References (19)

1. A. Asuncion and D. J. Newman. UCI Machine Learning Repository. http://www.ics.uci.edu/~mlearn/MLRepository. html, 2007.
2. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-Tree: An efficient and robust access method for points and rectangles. In Proc. SIGMOD, pages 322-331, 1990.
3. S. Berchtold, D. A. Keim, and H.-P. Kriegel. The X-Tree: An index structure for high-dimensional data. In Proc. VLDB, 1996.
4. A. P. de Vries, N. Mamoulis, N. Nes, and M. Kersten. Efficient k-NN search on vertically decomposed data. In Proc. SIGMOD, 2002.
5. R. Fagin. Combining fuzzy information from multiple systems. JCSS, 58:83-99, 1999.
6. R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. JCSS, 66(4):614-656, 2003.
7. A. Guttman. R-Trees: A dynamic index structure for spatial searching. In Proc. SIGMOD, 1984.
8. I. Guyon and A. Elisseeff. An introduction to variable and feature selection. J. Mach. Learn. Res., 3:1157-1182, 2003.
9. U. Güntzer, W.-T. Balke, and W. Kießling. Optimizing multi-feature queries for image databases. In Proc. VLDB, 2000.
10. X. He. Incremental semi-supervised subspace learning for image retrieval. In Proc. ACM MM, 2005.
11. N. Katayama and S. Satoh. The SR-tree: An index structure for high-dimensional nearest neighbor queries. In Proc. SIGMOD, 1997.
12. M. Koskela, J. Laaksonen, and E. Oja. Use of image subset features in image retrieval with self-organizing maps. In Proc. CIVR, 2004.
13. H.-P. Kriegel, P. Kröger, M. Schubert, and Z. Zhu. Efficient query processing in arbitrary subspaces using vector approximations. In Proc. SSDBM, 2006.
14. H.-P. Kriegel, P. Kröger, and A. Zimek. Clustering high dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering. ACM TKDD, 3(1):1-58, 2009.
15. X. Lian and L. Chen. Similarity search in arbitrary subspaces under Lp-norm. In Proc. ICDE, 2008.
16. S. Nepal and M. V. Ramakrishna. Query processing issues in image (multimedia) databases. In Proc. ICDE, 1999.
17. H. Samet. Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann, San Francisco, 2006.
18. T. Seidl and H.-P. Kriegel. Optimal multi-step k-nearest neighbor search. In Proc. SIGMOD, 1998.
19. R. Weber, H.-J. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proc. VLDB, 1998.