This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Robust Rule-Based Prediction
August 2006 (vol. 18 no. 8)
pp. 1043-1054
This paper studies a problem of robust rule-based classification, i.e., making predictions in the presence of missing values in data. This study differs from other missing value handling research in that it does not handle missing values but builds a rule-based classification model to tolerate missing values. Based on a commonly used rule-based classification model, we characterize the robustness of a hierarchy of rule sets as k{\hbox{-}}{\rm{optimal}} rule sets with the decreasing size corresponding to the decreasing robustness. We build classifiers based on k{\hbox{-}}{\rm{optimal}} rule sets and show experimentally that they are more robust than some benchmark rule-based classifiers, such as C4.5rules and CBA. We also show that the proposed approach is better than two well-known missing value handling methods for missing values in test data.

[1] R. Agrawal and R. Srikant, “Fast Algorithms For Mining Association Rules In Large Databases,” Proc. 20th Int'l Conf. Very Large Databases, pp. 487-499, 1994.
[2] E. Baralis and S. Chiusano, “Essential Classification Rule Sets,” ACM Trans. Database Systems, vol. 29, no. 4, pp. 635-674, 2004.
[3] G.E.A.P.A. Batista and M.C. Monard, “An Analysis of Four Missing Data Treatment Methods for Supervised Learning,” Applied Artificial Intelligence, vol. 17, nos. 5-6, pp. 519-533, 2003.
[4] E.K. C. Blake and C.J. Merz UCI Repository of Machine Learning Databases, http://www.ics.uci.edu/~mlearnMLRepository. html , 1998.
[5] L. Breiman, “Bagging Predictors,” Machine Learning, vol. 24, pp. 123-140, 1996.
[6] P. Clark, and R. Boswell, “Rule Induction with CN2: Some Recent Improvements,” Machine Learning-EWSL-91, pp. 151-163, 1991.
[7] P. Clark and T. Niblett, “The CN2 Induction Algorithm,” Machine Learning, vol. 3, no. 4, pp. 261-283, 1989.
[8] W.W. Cohen, “Fast Effective Rule Induction,” Proc. 12th Int'l Conf. Machine Learning (ICML), pp. 115-123, 1995.
[9] Y. Freund and R.E. Schapire, “Experiments with a New Boosting Algorithm,” Proc. Int'l Conf. Machine Learning, pp. 148-156, 1996.
[10] Y. Freund and R.E. Schapire, “A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting,” J. Computer and System Sciences, vol. 55, no. 1, pp. 119-139, 1997.
[11] J. Han, J. Pei, and Y. Yin, “Mining Frequent Patterns without Candidate Generation,” Proc. 2000 ACM-SIGMOD Int'l Conf. Management of Data (SIGMOD '00), pp. 1-12, May 2000.
[12] J. Li, “On Optimal Rule Discovery,” IEEE Trans. Knowledge and Data Eng., vol. 18, no. 4, pp. 460-471, 2006.
[13] J. Li, H. Shen, and R. Topor, “Mining the Optimal Class Association Rule Set,” Knowledge-Based System, vol. 15, no. 7, pp. 399-405, 2002.
[14] J. Li, R. Topor, and H. Shen, “Construct Robust Rule Sets for Classification,” Proc. Eighth ACMKDD Int'l Conf. Knowledge Discovery and Data Mining, pp. 564-569, 2002.
[15] W. Li, J. Han, and J. Pei, “CMAR: Accurate and Efficient Classification Based on Multiple Class-Association Rules,” Proc. 2001 IEEE Int'l Conf. Data Mining (ICDM '01), pp. 369-376, 2001.
[16] B. Liu, W. Hsu, and Y. Ma, “Integrating Classification and Association Rule Mining,” Proc. Fourth Int'l Conf. Knowledge Discovery and Data Mining (KDD '98), pp. 27-31, 1998.
[17] J. Mingers, “An Empirical Comparison of Selection Measures for Decision Tree Induction,” Machine Learning, vol. 3, pp. 319-342, 1989.
[18] D. Pyle, Data Preparation for Data Mining. San Francisco: Morgan Kaufmann, 1999.
[19] J.R. Quinlan, “Induction of Decision Trees,” Machine Learning, vol. 1, no. 1, pp. 81-106, 1986.
[20] J.R. Quinlan, C4.5: Programs for Machine Learning. San Mateo, Calif.: Morgan Kaufmann, 1993.
[21] P. Tan, V. Kumar, and J. Srivastava, “Selecting the Right Objective Measure for Association Analysis,” Information Systems, vol. 29, no. 4, pp. 293-313, 2004.
[22] G.I. Webb and S. Zhang, “K-Optimal Rule Discovery,” Data Mining and Knowledge Discovery J., vol. 10, no. 1, pp. 39-79, 2005.
[23] X. Yin and J. Han, “CPAR: Classification Based on Predictive Association Rules,” Proc. 2003 SIAM Int'l Conf. Data Mining (SDM '03), 2003.
[24] M.J. Zaki, “Mining Non-Redundant Association Rules,” Data Mining and Knowledge Discovery J., vol. 9, pp. 223-248, 2004.

Index Terms:
Data mining, rule, classification, robustness.
Citation:
Jiuyong Li, "Robust Rule-Based Prediction," IEEE Transactions on Knowledge and Data Engineering, vol. 18, no. 8, pp. 1043-1054, Aug. 2006, doi:10.1109/TKDE.2006.129
Usage of this product signifies your acceptance of the Terms of Use.