2004 · 19 citations · 17 references
ComputingData ScienceData MiningMachine LearningStatistical ModelingFrequent Pattern MiningPredictive ModelingRegressionRule-based RepresentationAssociation Rule LearningAssociation Rule MiningIf-then RulesPatternsPruningRule ExtractionRule LearningRule Mining
This paper explores a novel framework for building regression models using association rules. The model consists of an ordered set of IF-THEN rules, where the rule consequent is the predicted value of the target attribute. The approach consist of two steps: (1) extraction of association rules, and (2) construction of the rule-based regression model. We propose a pruning scheme for redundant and insignificant rules in the rule extraction step, and also a number of heuristics for building regression models. This approach allows discovery of global patterns, offers resistance to noise, while building relatively simple models. We perform a comparative study on the performance of RBA against CART and Cubist using 21 real-world data sets. Our experimental results suggest that RBA outperforms Cubist and are equally as good as CART in many data sets, and more importantly, there are situations where RBA is significantly better than CART, especially when the number of noise dimensions in the data is large.
17
Classification and Regression Trees.
Alexander Gordon, Leo Breiman, Jerome H. Friedman et al. · Biometrics · 1984 · 23.9K citations
Fast algorithms for mining association rules
Rakesh Agrawal, Ramakrishnan Srikant · 1998 · 10.8K citations
Mining frequent patterns without candidate generation
Jiawei Han, Jian Pei, Yiwen Yin · ACM SIGMOD Record · 2000 · 6.4K citations
Integrating classification and association rule mining