Mining the optimal class association rule set
Date
2002
Authors
Li, J.
Shen, H.
Topor, R.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Journal article
Citation
Knowledge-Based Systems, 2002; 15(7):399-405
Statement of Responsibility
Jiuyong Li, Hong Shen, and Rodney Topor
Conference Name
Abstract
We define an optimal class association rule set to be the minimum rule set with the same predictive power of the complete class association rule set. Using this rule set instead of the complete class association rule set we can avoid redundant computation that would otherwise be required for mining predictive association rules and hence improve the efficiency of the mining process significantly. We present an efficient algorithm for mining the optimal class association rule set using an upward closure property of pruning weak rules before they are actually generated. We have implemented the algorithm and our experimental results show that our algorithm generates the optimal class association rule set, whose size is smaller than 1/17 of the complete class association rule set on average, in significantly less rime than generating the complete class association rule set. Our proposed criterion has been shown very effective for pruning weak rules in dense databases.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright 2002 Elsevier