Similarity search in sets and categorical data using the signature tree

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2003, Pages 75-86

  Mamoulis, Nikos ^a   Cheung, David W ^a   Lian, Wang ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC INDEXING; DATA ACQUISITION; DATA MINING; DATA STRUCTURES; DATABASE SYSTEMS;

HIERARCHICAL INDEX; SIGNATURE TREE; SIMILARITY SEARCH;

ONLINE SEARCHING;

EID: 0344496711     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. C. C. Aggarwal, J. L. Wolf, and P. S. Yu. A New Method for Similarity Indexing of Market Basket Data. SIGMOD Conference, pages 407-418. 1999.
2. R. Agrawal and R. Srikant. Fast Algorithms for Mining Association Rules in Large Databases. VLDB Conference, pages 487-499. 1994.
3. K. S. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft. When Is "Nearest Neighbor" Meaningful? International Conference on Database Theory, pages 217-235. 1999.
4. T. Brinkhoff, H.-P. Kriegel, and B. Seeger. Efficient Processing of Spatial Joins Using R-Trees. SIGMOD Conference, pages 237-246, 1993.
5. A. Corral, Y. Manolopoulos, Y. Theodoridis, and M. Vassilakopoulos. Closest Pair Queries in Spatial Databases. SIGMOD Conference, pages 189-200. 2000.
6. A. P. de Vries, N. Mamoulis, N. Nes, and M. Kersten. Efficient k-NN Search on Vertically Decomposed Data. SIGMOD Conference, pages 322-333. 2002.
7. U. Deppisch. S-Tree: A Dynamic Balanced Signature Index for Office Retrieval. ACM SIGIR Conference, pages 77-87. 1986.
8. V. Gaede and O. Günther. Multidimensional Access Methods. ACM Computing Surveys, 30(2):170-231, 1998.
9. V. Ganti, J. Gehrke, and R. Ramakrishnan. CACTUS - clustering categorical data using summaries. ACM SIGKDD Conference on Knowledge Discovery and Data mining, pages 73-83, 1999.
10. D. Gibson, J. M. Kleinberg, and P. Raghavan. Clustering Categorical Data: An Approach Based on Dynamical Systems. VLDB Conference, pages 311-322. 1998.
11. A. Gionis, D. Gunopulos, and N. Koudas. Efficient and Tunable Similar Set Retrieval. SIGMOD Conference. 2001.
12. S. Guha, R. Rastogi, and K. Shim. ROCK: A Robust Clustering Algorithm for Categorical Attributes. International Conference on Data Engineering, pages 512-521. 1999.
13. A. Guttman. R-Trees: A Dynamic Index Structure for Spatial Searching. SIGMOD Conference, pages 47-57. 1984.
14. S. Helmer and G. Moerkotte. A Study of Four Index Structures for Set-Valued Attributes of Low Cardinality. Technical Report, University of Mannheim, number 2/99. 1999.
15. G. R. Hjaltson and H. Samet. Distance Browsing in Spatial Databases. TODS, 24(2):265-318, 1999.
16. A. K. Jain and R. C. Dubes. Algorithms for Clustering Data. Prentice-Hall, 1988.
17. I. Kamel and C. Faloutsos. Hilbert R-tree: An Improved R-tree using Fractals. VLDB Conference, pages 500-509. 1994.
18. F. Korn, N. Sidiropoulos, C. Faloutsos, E. Siegel, and Z. Protopapas. Fast Nearest Neighbor Search in Medical Image Databases. VLDB Conference, pages 215-226. 1996.
19. N. Koudas and K. C. Sevcik. High Dimensional Similarity Joins: Algorithms and Performance Evaluatin. International Conference on Data Engineering, pages 466-475. 1998.
20. N. Roussopoulos, S. Kelley, and F. Vincent. Nearest Neighbor Queries. SIGMOD Conference, pages 71-79. 1995.
21. Y. Sakurai, M. Yoshikawa, U. Uemura, and H. Kojima. The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation. VLDB Conference, pages 516-526. 2000.
22. The UCI KDD Archive. http://kdd.ics.uci.edu.
23. R. Webber, H.-J. Schek, and S. Blott. A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces. VLDB Conference, pages 194-205. 1998.