Similarity search and dimensionality reduction: Not all dimensions are equally useful

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2973, Issue , 2004, Pages 831-842

  Digout, Christian ^a   Nascimento, Mario A ^a   Coman, Alexandru ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; DIGITAL STORAGE;

D-DIMENSIONAL SPACES; DIMENSIONALITY REDUCTION; HIGH DIMENSIONAL DATA; LIMITED STORAGE; QUERY PERFORMANCE; RANGE QUERY; SIMILARITY QUERY; SIMILARITY SEARCH;

QUERY PROCESSING;

EID: 35048862492     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24571-1_73     Document Type: Article

References (20)

1. C. C. Aggarwal, A. Hinneburg, and D. A. Keim. On the surprising behavior of distance metrics in high dimensional space. In Proc. of the 8th Intl. Conf. on Database Theory, volume 1973, pages 420-434, 2001.
2. R. Agrawal, C. Faloutsos, and A.N. Swami. Efficient Similarity Search In Sequence Databases. In Proc. of the 4th Intl. Conf. of Foundations of Data Organization and Algorithms, pages 69-84, 1993.
3. R. Baeza-Yates, W. Cunto, U. Manber, and S. Wu. Proximity matching using fixed-queries trees. In Proc. of the 5th Symposium on Combinatorial Pattern Matching, pages 198-212, 1994.
4. S. Berchtold, D.A. Keim, and H.-P. Kriegel. The X-tree: An index structure for high-dimensional data. In Proc. of the 22nd Intl. Conf. on Very Large Databases, pages 28-39, 1996.
5. K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft. When is "nearest neighbor" meaningful? In Proc. of the 7th Intl. Conf. on Database Theory, volume 1540, pages 217-235, 1999.
6. T. Bozkaya and M. Ozsoyoglu. Distance-based indexing for high-dimensional metric spaces. In Proc. of the 1997 ACM SIGMOD Intl. Conf. on Management of Data, pages 357-368, 1997.
7. B. Braunmuller, M. Ester, H.-P. Kriegel, and J. Sander. Multiple similarity queries: A basic DBMS operation for mining in metric databases. IEEE Transactions on Knowledge and Data Engineering, 13(1):79-95, 2001.
8. P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In Proc. of 23rd Intl. Conf. on Very Large Data Bases, pages 426-435, 1997.
9. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proc. of the 2nd Intl. Conf. on Knowledge Discovery and Data Mining, pages 226-231, 1996.
10. R.F. Santos Filho, A. Traina, C. Traina Jr., and C. Faloutsos. Similarity search without tears: The OMNI family of all-purpose access methods. In Proc. of the 17th Intl. Conf. on Data Engineering, pages 623-630, 2001.
11. A. Guttman. R-trees: A dynamic index structure for spatial searching. In Proc. of ACM SIGMOD Intl. Conf. on Management of Data, pages 47-57, 1984.
12. C. Traina Jr., A. Traina, C. Faloutsos, and B. Seeger. Fast indexing and visualization for metric data sets using slim-trees. IEEE Transactions on Knowledge and Data Engineering, 14(2):244-260, 2002.
13. N. Katayama and S. Satoh. The SR-tree: An index structure for high-dimensional nearest neighbor queries. In Proc. of the ACM SIGMOD Intl. Conf. on Management of Data, pages 369-380, 1997.
14. L. Liao and W. S. Noble. Combining pairwise sequence similarity and support vector machines for remote protein homology detection. In Proc. of the 6th Intl. Conf. on Research in Computational Molecular Biology, pages 225-232, 2002.
15. G. Lu. Multimedia Database Management Systems. Artech House, 1999.
16. Y. Sakurai, M. Yoshikawa, S. Uemura, and H. Kojima. The A-tree: An index structure for high-dimensional spaces using relative approximation. In Proc. of the 26th Intl. Conf. on Very Large Data Bases, pages 516-526, 2000.
17. R.O. Stehling, M.A. Nascimento, and A. X. Falcao. MiCRoM: A metric distance to compare segmented images. In Proc. of the 2002 Visual Information Systems Conf., pages 12-23, 2002.
18. R.O. Stehling, M.A. Nascimento, and A.X. Falcao. A compact and efficient image retrieval approach based on border/interior pixel classification. In Proc. of the 2002 ACM Intl. Conf. on Information and Knowledge Management, pages 102-109, 2002.
19. M.J. Swain and D.H. Ballard. Color indexing. Intl. Journal of Computer Vision, 7(1):11-32, 1991.
20. R. Weber, H.-J. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proc. of the 24th Intl. Conf. on Very Large Databases, pages 194-205, 1998.