Applying On-line Bitmap Indexing to Reduce Counting Costs in Mining Association Rules
暂无分享,去创建一个
[1] Philip S. Yu,et al. An effective hash-based algorithm for mining association rules , 1995, SIGMOD '95.
[2] Ramakrishnan Srikant,et al. Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.
[3] Ramakrishnan Srikant,et al. Mining sequential patterns , 1995, Proceedings of the Eleventh International Conference on Data Engineering.
[4] Arun N. Swami,et al. Set-oriented mining for association rules in relational databases , 1995, Proceedings of the Eleventh International Conference on Data Engineering.
[5] Rajeev Motwani,et al. Dynamic itemset counting and implication rules for market basket data , 1997, SIGMOD '97.
[6] Hannu Toivonen,et al. Sampling Large Databases for Association Rules , 1996, VLDB.
[7] Philip S. Yu,et al. Data mining for path traversal patterns in a web environment , 1996, Proceedings of 16th International Conference on Distributed Computing Systems.
[8] Shamkant B. Navathe,et al. An Efficient Algorithm for Mining Association Rules in Large Databases , 1995, VLDB.
[9] Jiawei Han,et al. Discovery of Spatial Association Rules in Geographic Information Databases , 1995, SSD.
[10] Tomasz Imielinski,et al. Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.