Charu C. Aggarwal
Philip S. Yu
- 1.Aggarwal C. C., and Yu P. S. Online Generation of Aseociation Itules. Proceedings of the Fourteenth Interna. tiona! Conference on Data Engineering, pages 402-411, Orlando, Florida, February 1998. Google Scholar
Digital Library
- 2.Agrawal R., Imielinski T., and Swami A. Mining association rules between sets of items in very large databases, Proceedings o/the A GM SIGMOD Conference on Management of data, pages 207-216, 1993. Google ScholarDigital Library
- 3.Agrawal It., and Sfilmnt It. Fast Algorithms for Mining Aenoeiation Rules in Large Databases. Proceedings of the ~Oth International Conference on Very I, arge Data Bases, pages 478-499, 1994. Google ScholarDigital Library
- 4.Brin S., Motwani It. and Silvezstein C. Beyond Market Baskets: Generalizing Association Itules to Correlations. Proceedings of the A CM SIGMOD, 1997. pages 265-276. Google ScholarDigital Library
- 5.Brin S., Motwani It. Ullman J. D. and Tsur S. Dynamic Itemset Counting and implication rules for Market Basket Data. Proceedings of the A GM SIGMOD, 1997. pages 255-264. Google ScholarDigital Library
- 6.Chen M. S., Has J., and Yu P. S. Data Mining: An Overview from Database Perspective. /EEE Transac. tions on Knowledge and Data Engineering. Volume 8, Number 6, December 1996, 866-883. Google ScholarDigital Library
- 7.Klementtinen M., Mannila H., Itonkainen P., Toivonen H., and Verkamo A. I. Finding interesting rules from large sets of discovered assodation rules. Proceedings of the CIKM 1994. Google ScholarDigital Library
- 8.Lent B., Swami A., and Widom J. Clustering Association Itules. Proceedings of the Thirteenth international Conference on Data Engineering. pages 220-231, Bizm. ingham, UK, April 1997. Google ScholarDigital Library
- 9.Park J. S., Chen M. S., and Yu P. S. Using a Hash Based Method with Transaction 'Ikbmming for Mining Association Itules. IEEE Transactions on Knowledge and Data Engineering.Volume 9, Number 5, September 1997, 813-825. Google ScholarDigital Library
- 10.Mannila H., Toivonen H., and Verkamo A. i. E~- dent algorithms for discovering association rules. AAA! Workshop on Kno~zledge Discovery in Databases, 1994, pages 181-192.Google Scholar
- 11.Srikant R., and Agrawal R. Mining Generalized Association Rules. Proceedings o.f the ~lst International Conference on Very Large Data Bases,1995, pages 407-419. Google ScholarDigital Library
- 12.Sfil~at R., and Agrawal it. Mining quantitative association rules in large relational tables. Proceedings of the A GM SIGMOD Conference on Management of Data, 1996. Google ScholarDigital Library
Index Terms
- A new framework for itemset generation
Recommendations
Non-derivable itemset mining
All frequent itemset mining algorithms rely heavily on the monotonicity principle for pruning. This principle allows for excluding candidate itemsets from the expensive counting phase. In this paper, we present sound and complete deduction rules to ...
A New Algorithm for Frequent Itemset Generation in Non-Binary Search Space
ITNG '09: Proceedings of the 2009 Sixth International Conference on Information Technology: New GenerationsAssociation rule induction is a powerful data mining method, used to analyze the regularities in data trends by finding the frequent itemset and association between items or set of items. Several research attempts have been done for the purpose based on ...
Rare Itemset Mining
ICMLA '07: Proceedings of the Sixth International Conference on Machine Learning and Applicationstogether in a transaction database. Previous studies in the field are often dedicated to the problem of frequent pattern mining where only patterns that appear frequently in the input data are mined. As a result, patterns involving events/features that ...
Comments