Efficient similarity search for market basket data

VLDB Journal

Volumn 11, Issue 2, 2002, Pages 138-152

  Nanopoulos, Alexandros ^a   Manolopoulos, Yannis ^a  

^a ARISTOTLE UNIVERSITY OF THESSALONIKI   (Greece)

Author keywords

Data mining; Market basket data; Nearest neighbor; Similarity search

Indexed keywords

ALGORITHMS; DATA MINING; QUERY LANGUAGES; SEARCH ENGINES; WORLD WIDE WEB;

SIMILARITY SEARCH;

DATABASE SYSTEMS;

EID: 0036824040     PISSN: 10668888     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00778-002-0068-7     Document Type: Article

References (29)

1. Agrawal R, Faloutsos C, Swami A (1993) Efficient Similarity Search in Sequence Databases. Proc. International Conference on Foundations of Data Organization and Algorithms (FODO'93), pp 69-84
2. Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. Proc. International Conference on Very Large Databases (VLDB'94), pp 207-216
3. Aggarwal C, Wolf J, Yu PS (1999) A new method for similarity indexing of market basket data. Proc. ACM International Conference on Management of Data (SIGMOD'99)
4. Baeza-Yates R, Ribeiro-Neto B (1999) Modern information retrieval. Addison-Wesley, reading, Mass., USA
5. Berchtold S, Böhm C, Kriegel HP (1998) The Pyramid Technique: towards breaking the curse of dimensionality. Proc. ACM International Conference on Management of Data (SIGMOD'98), pp 142-153
6. Chen MS, Park J, Yu PS (1998) Efficient data mining for path traversal patterns. IEEE Trans Knowl Data Eng 10(2):209-221
7. Deppish U (1986) S-tree: a dynamic balanced signature index for office retrieval. Proc. ACM International Conference on Information Retrieval (SIGIR'86), pp 77-87
8. Faloutsos C, Jagadish H (1992) On B-tree indices for skewed distributions. Proc. International Conference on Very Large Databases (VLDB'92), pp 363-374
9. Faloutsos C, Ranganathan M, Manolopoulos Y (1994) Fast subsequence matching in time-series databases. Proc. ACM International Conference on Management of Data (SIGMOD'94), pp 419-429
10. Gionis A, Gunopulos D, Koudas N (2001) Efficient and tunable similar set retrieval. Proc. ACM International Conference on Management of Data (SIGMOD'01)
11. Goldberg D, Nichols D, Oki B, Terry D (1992) Using collaborative filtering to weave an information tapestry. Comm ACM 35(12):61-70
12. Guha S, Rastogi R, Shim K (2001) Cure: an efficient clustering algorithm for large databases. Inf Syst 26(1):35-58
13. Guttman A (1984) R-trees: a dynamic index structure for spatial searching. Proc. ACM International Conference on Management of Data (SIGMOD'84), pp 47-57
14. Hellerstein J, Pfeffer A (1994) The RD-tree: an index structure for sets. Tech. Report (1252), University of Wisconsin, Madison, Wis., USA
15. Helmer S, Moerkotte G (1997) Evaluation of main memory join algorithms for joins with set comparison join predicates. Proc. International Conference on Very Large Databases (VLDB'97), pp 386-395
16. Hjaltason G, Samet H (1995) Ranking in spatial databases. Proc. International Symp. on Large Spatial Databases (SSD'95), pp 83-95
17. Hill W, Stead L, Rosenstein M, Furnas G (1995) Recommending and evaluating choices in a virtual community of use. Proc. of Conference on Human factors in Computing Systems (CHI'95), pp 194-201
18. Ishikawa Y, Kitagawa H, Ohbo N (1993) Evaluation of signature files as set access facilities in OODBs. Proc. ACM International Conference on Management of Data (SIGMOD' 93), pp 247-256
19. Katayama N, Satoh S (1997) The SR-tree: an index structure for high dimensional nearest neighbor queries. Proc. ACM International Conference on Management of Data (SIGMOD'97), pp 369-380
20. Konstan J, Miller B, Maltz D, Herlocker J, Gordon L, Riedl J (1997) GroupLens: applying collaborative filtering to Usenet news. Comm ACM 40(3):77-87
21. Nanopoulos A, Katsaros D, Manolopoulos Y (2002) A data mining algorithm for generalized web prefetching. IEEE Trans Knowl Data Eng (accepted)
22. Park J, Chen MS, Yu P (1997) Using a hash-based method with transaction trimming for mining association rules. Trans Knowl Data Eng 9(5)
23. Roussopoulos N, Kelley S, Vincent F (1995) Nearest neighbor queries. Proc. ACM International Conference on Management of Data (SIGMOD'95), pp 71-79
24. Sacks-Davis R, Ramamohanarao K (1983) A two-level super-imposed coding scheme for partial match retrieval. Inf Syst 8(4)
25. Sarwar B, Karypis G, Konstan J, Riedl J (2000) Application of Dimensionality Reduction in Recommender Systems. WebKDD Workshop
26. Sarwar B, Karypis G, Konstan J, Riedl J (2000) Analysis of recommendation algorithms for e-commerce. Proc. ACM Conference on Electronic Commerce 2000 (EC'00), pp 158-167
27. Sibson R (1973) SLINK: an optimally efficient algorithm for the single link cluster method. Comput J 16
28. Tousidou E, Nanopoulos A, Manolopoulos Y (2000) Improved methods for signature tree construction. Comput J 43(4)
29. Wang K, Xu C, Liu B (1999) Clustering transactions using large items. Proc. International Conference on Information and Knowledge Management (CIKM'99), pp 483-490