MIC framework: An information-theoretic approach to quantitative association rule mining

Proceedings - International Conference on Data Engineering

Volumn 2006, Issue , 2006, Pages 112-

  Ke, Yiping ^a   Cheng, James ^a   Ng, Wilfred ^a  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ASSOCIATION RULE MINING; MIC FRAMEWORK; MINING SPEED;

COMPUTATION THEORY; DATA REDUCTION; GRAPH THEORY; INFORMATION THEORY; SET THEORY;

DATA MINING;

EID: 33749645082     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2006.94     Document Type: Conference Paper

References (10)

1. IBM Quest Synthetic Data Generation Code. http://www.almaden.ibm.com/ software/quest/.
2. R. Agrawal, T. Imielinski, and A. N. Swami. Mining association rules between sets of items in large databases. In Proc. of SIGMOD, 1993.
3. R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In Proc. of VLDB, pages 487-499, 1994.
4. S. Brin, R. Motwani, and C. Silverstein. Beyond market baskets: Generalizing association rules to correlations. In Proc. of SIGMOD, pages 265-276, 1997.
5. T. M. Cover and J. A. Thomas. Elements of Information Theory. John Wiley & Sons, Inc., 1991.
6. S. Hettich, C. Blake, and C. Merz. UCI repository of machine learning databases, 1998.
7. R. Srikant and R. Agrawal. Mining quantitative association rules in large relational tables. In Proc. of SIGMOD, 1996.
8. K. Wang, S. H. W. Tay, and B. Liu. Interestingness-based interval merger for numeric association rules. In KDD, pages 121-128, 1998.
9. M. J. Zaki and K. Gouda. Fast vertical mining using diffsets. In KDD, pages 326-335, 2003.
10. Z. Zhang, Y. Lu, and B. Zhang. An effective partitioning-combining algorithm for discovering quantitative association rules. In Proc. of PAKDD, pages 241-251, 1997.