Localized signature table: Fast similarity search on transaction data

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2004, Pages 314-323

  Jing, Qiang ^a   Kalnis, Panos ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Data Mining; Indexing; Similarity Search; Transaction Data

Indexed keywords

DATASETS; INDEXING; SIMILARITY SEARCH; TRANSACTION DATA;

COMPUTATIONAL METHODS; DATA MINING; DATA PROCESSING; ELECTRONIC COMMERCE; NUMERICAL ANALYSIS; PROBLEM SOLVING; SENSITIVITY ANALYSIS;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

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

References (19)

1. C. C. Aggarwal, J. L. Wolf, and P. S. Yu. A new method for similarity indexing of market basket data. In Proc. of the ACM SIGMOD Int. Conf. on Management of Data, pages 407-418, 1999.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. of the 20th Int. Conf. on Very Large Data Bases, pages 487-499, 1994.
3. K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft. When is "nearest neighbor" meaningful? Lecture Notes in Computer Science, 1540:217-235, 1999.
4. K. Chakrabarti and S. Mehrotra. Local dimensionality reduction: A new approach to indexing high dimensional spaces. In Proc. of the 26th Int. Conf. on Very Large Data Bases, pages 89-100, 2000.
5. S. C. Deerwester, S. T. Dumais, T. K. Landauer, G. W. Furnas, and R. A. Harshman. Indexing by latent semantic analysis. J. of the American Society of Information Science, 41(6):391-407, 1990.
6. A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the EM algorithm. J. of the Royal Statistical Society, Series B, 39:1-38, 1977.
7. C. Faloutsos and H. V. Jagadish. On B-tree indices for skewed distributions. In Proc. of the 18th Int. Conf. on Very Large Data Bases, pages 363-374, 1992.
8. A. Gionis, D. Gunopulos, and N. Koudas. Efficient and tunable similar set retrieval. In Proc. of the ACM SIGMOD Int. Conf. on Management of Data, 2001.
9. A. Guttman. R-trees: a dynamic index structure for spatial searching. Readings in database systems, pages 599-609, 1988.
10. A. K. Jain and R. C. Dubes. Algorithms for clustering data. Prentice-Hall, Inc., 1988.
11. Q. Jing, R. Yang, P. Kalnis, and A. K. H. Tung. Localized signature table: Fast similarity search on transaction data. Technical Report, 2003.
12. N. Mamoulis, D. W. Cheung, and W. Lian. Similarity search in sets and categorical data using the signature tree. In Proc. of the 19th IEEE Int. Conf. on Data Engineering, 2003.
13. A. Nanopoulos and Y. Manolopoulos. Efficient similarity search for market basket data. The VLDB Journal, 11(2):138-152, 2002.
14. C. Ordonez, E. Omiecinski, and N. Ezquerra. A fast algorithm to cluster high dimensional basket data. In Proc. of the 17th IEEE Int. Conf. on Data Mining, pages 633-636, 2001.
15. N. Roussopoulos, S. Kelley, and F. Vincent. Nearest neighbor queries. In Proc. of the ACM SIGMOD Int. Conf. on Management of data, pages 71-79, 1995.
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 Int. Conf. on Very Large Data Bases, pages 516-526, 2000.
17. R. Sibson. SLINK: an optimally efficient algorithm for the single-link cluster method. The Computer Journal, 16(1):30-34, 1973.
18. The UCI KDD Archive, http://kdd.ics.uci.edu.
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. of the 24th Int. Conf. on Very Large Data Bases, pages 194-205, 1998.