Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer_journal/efficient-similarity-search-for-market-basket-data-CZ09TwOtt3
References (29)
-
U. Deppisch (1986)
S-tree: a dynamic balanced signature index for office retrieval -
C. Faloutsos, M. Ranganathan, Y. Manolopoulos (1994)
Fast subsequence matching in time-series databases -
J. Konstan, Bradley Miller, D. Maltz, Jonathan Herlocker, Lee Gordon, J. Riedl (1997)
GroupLens: applying collaborative filtering to Usenet newsCommun. ACM, 40
-
Gísli Hjaltason, H. Samet (1995)
Ranking in Spatial Databases -
N. Roussopoulos, Stephen Kelley, F. Vincent (1995)
Nearest neighbor queries -
R. Agrawal, R. Srikant (1994)
Fast Algorithms for Mining Association Rules in Large Databases -
R. Sacks-Davis, K. Ramamohanarao (1983)
A two level superimposed coding scheme for partial match retrievalInf. Syst., 8
-
Ming-Syan Chen, Jong Park, Philip Yu (1998)
Efficient Data Mining for Path Traversal PatternsIEEE Trans. Knowl. Data Eng., 10
-
R. Agrawal, C. Faloutsos, A. Swami (1993)
Efficient Similarity Search In Sequence Databases -
Y. Ishikawa, H. Kitagawa, N. Ohbo (1993)
Evaluation of signature files as set access facilities in OODBsProceedings of the 1993 ACM SIGMOD international conference on Management of data
-
Ke Wang, Chuyuan Xu, B. Liu (1999)
Clustering transactions using large items -
W. Hill, Larry Stead, Mark Rosenstein, G. Furnas (1995)
Recommending and evaluating choices in a virtual community of use -
(1999)
Modern Information Retrieval -
A. Nanopoulos, Dimitrios Katsaros, Y. Manolopoulos (2003)
A Data Mining Algorithm for Generalized Web PrefetchingIEEE Trans. Knowl. Data Eng., 15
-
A. Gionis, D. Gunopulos, Nick Koudas (2001)
Efficient and tumble similar set retrieval, 30
-
B. Sarwar, G. Karypis, J. Konstan, J. Riedl (2000)
Analysis of recommendation algorithms for e-commerce -
Stefan Berchtold, Christian Böhm, H. Kriegel (1998)
The pyramid-technique: towards breaking the curse of dimensionality -
A. Guttman (1984)
R-trees: a dynamic index structure for spatial searching -
Eleni Tousidou, A. Nanopoulos, Y. Manolopoulos (2000)
Improved Methods for Signature-Tree ConstructionComput. J., 43
-
Jong Park, Ming-Syan Chen, Philip Yu (1997)
Using a Hash-Based Method with Transaction Trimming for Mining Association RulesIEEE Trans. Knowl. Data Eng., 9
-
Norio Katayama, S. Satoh (1997)
The SR-tree: an index structure for high-dimensional nearest neighbor queries -
C. Faloutsos, H. Jagadish (1992)
On B-Tree Indices for Skewed Distributions -
B. Sarwar, G. Karypis, J. Konstan, J. Riedl (2000)
Application of Dimensionality Reduction in Recommender Systems -
J. Hellerstein, A. Pfeffer (1997)
THE RD-TREE: AN INDEX STRUCTURE FOR SETS -
C. Aggarwal, J. Wolf, Philip Yu (1999)
A new method for similarity indexing of market basket data -
S. Helmer, G. Moerkotte (1996)
Evaluation of Main Memory Join Algorithms for Joins with Set Comparison Join Predicates -
David Goldberg, D. Nichols, B. Oki, D. Terry (1992)
Using collaborative filtering to weave an information tapestryCommun. ACM, 35
-
R. Sibson (1973)
SLINK: An Optimally Efficient Algorithm for the Single-Link Cluster MethodComput. J., 16
-
S. Guha, R. Rastogi, Kyuseok Shim (1998)
CURE: an efficient clustering algorithm for large databases
- Publisher
- Springer Journals
- Copyright
- Copyright © 2002 by Springer-Verlag Berlin Heidelberg
- Subject
- Computer Science; Database Management
- ISSN
- 1066-8888
- eISSN
- 0949-877X
- DOI
- 10.1007/s00778-002-0068-7
- Publisher site
- See Article on Publisher Site
Abstract
Several organizations have developed very large market basket databases for the maintenance of customer transactions. New applications, e.g., Web recommendation systems, present the requirement for processing similarity queries in market basket databases. In this paper, we propose a novel scheme for similarity search queries in basket data. We develop a new representation method, which, in contrast to existing approaches, is proven to provide correct results. New algorithms are proposed for the processing of similarity queries. Extensive experimental results, for a variety of factors, illustrate the superiority of the proposed scheme over the state-of-the-art method.
Journal
The VLDB Journal – Springer Journals
Published: Oct 1, 2002