A New Method for Similarity Indexing of Market Basket Data

SIGMOD Record (ACM Special Interest Group on Management of Data)

Volumn 28, Issue 2, 1999, Pages 407-418

  Aggarwal, Charu C ^a   Wolf, Joel L ^a   Yu, Philip S ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347761797     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/304181.304218     Document Type: Article

References (23)

1. C. C. Aggarwal, J. L. Wolf, P. S. Yu, M. Epelman. The S-Tree: An efficient index for multi-dimensional objects. Proceedings of the International Symposium on Spatial Databases, pages 350-370, Berlin, Germany, July 1997.
2. R. Agrawal, T. Imielinski, A. Swami. Mining Association Rules between sets of items in very large databases. Proceedings of the ACM SIGMOD Conference, pages 207-216, 1993.
3. R. Agrawal, R. Srikant. Past Algorithms for Mining Association Rules in Large Databases. Proceedings of the 20th VLDB Conference, pages 478-499, 1994.
4. S. Arya. Nearest Neighbor Searching and Applications. Ph. D. Thesis, University of Maryland, College Park, MD, 1995.
5. N. Beckman, H.-P. Kriegel, R. Schneider, B. Seeger. The R*-Tree: An Efficient and Robust Method for Points and Rectangles. Proceedings of the ACM SIGMOD Conference. 322-331, 1990.
6. S. Berchtold, C. Böhm, H.-P. Kriegel. The Pyramid Technique: Towards Breaking the Curse of Dimensionality. Proceedings of the ACM SIGMOD Conference, pages 142-153, June 1998.
7. S. Berchtold, B. Ertl, D. Keim, H.-P. Kriegel., T. Seidl. Fast Nearest Neighbor Search in High Dimensional Spaces. Proceedings of the 14th International Conference on Data Engineering, Orlando, 1998.
8. C. Faloutsos. Signature Files. Information Retrieval: Data Structures and Algorithms, W. B. Frakes, R. Baeza-Yates (Ed.), pages 44-65, 1992.
9. C. Faloutsos, R. Chan. Fast Text Access Methods for Optical and Large Magnetic Disks: Designs and Performance Comparison. Proceedings of the 14th VLDB Conference, pages 280-293, 1988.
10. C. Faloutsos, S. Christodoulakis. Description and Performance Analysis of Signature File Methods. ACM TOOIS, 5 (3), pages 237-257, 1987.
11. W. B. Frakes, R. Baeza-Yates (Editors). Information Retrieval: Data Structures and Algorithms. Prentice Hall PTR, New Jersey, 1992.
12. A. Guttman. R-Trees: A Dynamic Index Structure for Spatial Searching. Proceedings of the ACM SIGMOD Conference, 47-57, 1984.
13. K. Hinrichs, J. Nievergelt. The Grid File: A Data Structure to Support Proximity Queries on Spatial Objects. Proceedings of the WG'83, 100-113, 1983.
14. R. Jain, D. A. White. Similarity Indexing: Algorithms and Performance. Proceedings of SPIE Storage and Retrieval for Image and Video Databases IV, Vol. 2670, San Jose, CA, pages 62-75, 1996.
15. N. Katayama, S. Satoh. The SR-Tree: An Index Structure for High Dimensional Nearest Neighbor Queries. Proceedings of the ACM SIGMOD Conference, pages 369-380, 1997.
16. K.-I. Lin, H. V. Jagadish, C. Faloutsos. The TV-tree: An Index Structure for High Dimensional Data. VLDB Journal, 3 (4), pages 517-542, 1992.
17. N. Roussopoulos, S. Kelley, F. Vincent. Nearest Neighbor Queries. Proceedings of the ACM SIGMOD Conference, pages 71-79, 1995.
18. G. Salton. Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer. Addison-Wesley Publishing.
19. R. Sibson. SLINK: An optimally efficient algorithm for the single link cluster method. Computer Journal, Volume 16, pages 30-34, 1973.
20. T. Seidl, H-P. Kriegel. Optimal Multi-Step k-Nearest Neighbor Search. Proceedings of the ACM SIGMOD Conference, pages 154-165, 1998.
21. T. Seidl, H.-P. Kriegel. Efficient User-Adaptable Similarity Search in Large Multimedia Databases. Proceedings of the 23rd VLDB Conference, 1997.
22. T. Sellis, N. Roussopoulos, C. Faloutsos. The R+ Tree: A Dynamic Index for Multidimensional Objects. Proceedings of the 13th VLDB Conference, pages 507-518, 1987.
23. D. A. White, R. Jain. Similarity Indexing with the SS-Tree. Proceedings of the 12th International Conference on Data Engineering, New Orleans, USA, pages 516-523, February 1996.