MIC Framework: An Information-Theoretic Approach to Quantitative Association Rule Mining

Authors:
Yiping Ke;James Cheng;Wilfred Ng
Affiliations:
Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology
Venue:
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Year:
2006

Citing 0
Cited 6

Twain: Two-end association miner with precise frequent exhibition periods

ACM Transactions on Knowledge Discovery from Data (TKDD)
MODENAR: Multi-objective differential evolution algorithm for mining numeric association rules

Applied Soft Computing
Correlated pattern mining in quantitative databases

ACM Transactions on Database Systems (TODS)
An information-theoretic approach to quantitative association rule mining

Knowledge and Information Systems
MPSQAR: Mining Quantitative Association Rules Preserving Semantics

ADMA '08 Proceedings of the 4th international conference on Advanced Data Mining and Applications
Optimal leverage association rules with numerical interval conditions

Intelligent Data Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a framework, called MIC, which adopts an information-theoretic approach to address the problem of quantitative association rule mining. In our MIC framework, we first discretize the quantitative attributes. Then, we compute the normalized mutual information between the attributes to construct a graph that indicates the strong informative-relationship between the attributes. We utilize the cliques in the graph to prune the unpromising attribute sets and hence the joined intervals between these attributes. Our experimental results show that the MIC framework significantly improves the mining speed. Importantly, we are able to obtain most of the high-confidence rules and the missing rules are shown to be less interesting.