Issue No.04 - April (2006 vol.18)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2006.65
In machine learning and data mining, heuristic and association rules are two dominant schemes for rule discovery. Heuristic rule discovery usually produces a small set of accurate rules, but fails to find many globally optimal rules. Association rule discovery generates all rules satisfying some constraints, but yields too many rules and is infeasible when the minimum support is small. Here, we present a unified framework for the discovery of a family of optimal rule sets and characterize the relationships with other rule-discovery schemes such as nonredundant association rule discovery. We theoretically and empirically show that optimal rule discovery is significantly more efficient than association rule discovery independent of data structure and implementation. Optimal rule discovery is an efficient alternative to association rule discovery, especially when the minimum support is low.
Data mining, rule discovery, optimal rule set.
Jiuyong Li, "On Optimal Rule Discovery", IEEE Transactions on Knowledge & Data Engineering, vol.18, no. 4, pp. 460-471, April 2006, doi:10.1109/TKDE.2006.65