Finding interesting associations without support pruning
- 7 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 489-500
- https://doi.org/10.1109/icde.2000.839448
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- On the resemblance and containment of documentsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Cure: an efficient clustering algorithm for large databasesInformation Systems, 2001
- Approximate nearest neighborsPublished by Association for Computing Machinery (ACM) ,1998
- Size-Estimation Framework with Applications to Transitive Closure and ReachabilityJournal of Computer and System Sciences, 1997
- Online aggregationACM SIGMOD Record, 1997
- Dynamic itemset counting and implication rules for market basket dataPublished by Association for Computing Machinery (ACM) ,1997
- Building a scalable and accurate copy detection mechanismPublished by Association for Computing Machinery (ACM) ,1996
- Randomized AlgorithmsPublished by Cambridge University Press (CUP) ,1995
- Mining association rules between sets of items in large databasesPublished by Association for Computing Machinery (ACM) ,1993
- Using collaborative filtering to weave an information tapestryCommunications of the ACM, 1992