Qing Li, Zhigang Deng, et al.
IEEE T-MI
Constraint-based rule miners find all rules in a given data-set meeting user-specified constraints such as minimum support and confidence. We describe a new algorithm that directly exploits all user-specified constraints including minimum support, minimum confidence, and a new constraint that ensures every mined rule offers a predictive advantage over any of its simplifications. Our algorithm maintains efficiency even at low supports on data that is dense (e.g. relational tables). Previous approaches such as Apriori and its variants exploit only the minimum support constraint, and as a result are ineffective on dense data due to a combinatorial explosion of "frequent itemsets". © 2000 Kluwer Academic Publishers.
Qing Li, Zhigang Deng, et al.
IEEE T-MI
Ruixiong Tian, Zhe Xiang, et al.
Qinghua Daxue Xuebao/Journal of Tsinghua University
Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009