Browse > Article
http://dx.doi.org/10.6109/jkiice.2014.18.6.1283

Refining Rules of Decision Tree Using Extended Data Expression  

Jeon, Hae Sook (IT Convergence Technology Research Lab., ETRI)
Lee, Won Don (Department of Computer Science, Chungnam National University)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.18, no.6, 2014 , pp. 1283-1293 More about this Journal
Abstract
In ubiquitous environment, data are changing rapidly and new data is coming as times passes. And sometimes all of the past data will be lost if there is not sufficient space in memory. Therefore, there is a need to make rules and combine it with new data not to lose all the past data or to deal with large amounts of data. In making decision trees and extracting rules, the weight of each of rules is generally determined by the total number of the class at leaf. The computational problem of finding a minimum finite state acceptor compatible with given data is NP-hard. We assume that rules extracted are not correct and may have the loss of some information. Because of this precondition. this paper presents a new approach for refining rules. It controls their weight of rules of previous knowledge or data. In solving rule refinement, this paper tries to make a variety of rules with pruning method with majority and minority properties, control weight of each of rules and observe the change of performances. In this paper, the decision tree classifier with extended data expression having static weight is used for this proposed study. Experiments show that performances conducted with a new policy of refining rules may get better.
Keywords
rule refinement; decision tree; weight; pruning; extended data expression;
Citations & Related Records
연도 인용수 순위
  • Reference
1 J. R. Quinlan, "C4.5: Program for Machine Learning", San Mateo, Calif, Morgan Kaufmann, 1993.
2 J. R. Quinlan, "Bagging, Boosting, and C4.5", AAAI/IAAI, vol. 1, 1996.
3 Pang-Ning Tan, Michael Steinbach, Vipin Kumar, "Introduction to DATA MINING", Addison Wesley, pp. 207-312, 2005.
4 UCI Repository of Machine Learning Databases [Internet]. Available: http://www.ics.uci.edu/-ml.
5 J.R. Quinlan, "Learning Efficient Classification Procedures and Their Application to Chess End Games", Machine Learning, Palo Alto: Tioga Press, 1983.
6 D. H. Kim, D. H. Lee, and W. D. Lee, "Classifier using extended data expression," IEEE Mountain Workshop on Adaptive and Learning Systems, Logan:UT, pp. 154-159, 2006.
7 D. H. Kim, D. H. Seo, and W. D. Lee, "Classifier Capable of Rule Refinement", International Symposium on Computer Science and its Application, Hobart, Australia, pp. 216-221, 2008.
8 Mehmet Sabih Aksoy, "Pruning Decision Trees Using RULES3 Inductive Learning Algorithm", Mathematical and Computational Applications, Vol. 10, No. 1, pp. 113-120, 2005.   DOI
9 J. M. Kong, D. H. Seo and W. D. Lee, "Rule refinement with extended data expression," IEEE Computer Society, Proceedings of the Sixth International Conference on Machine Learning and Applications (ICMLA), pp. 310-315, 2007.
10 H. S. Jeon and W. D. Lee, "Pruning Method With Majority and Minority Properties," International Conference on Information Science & Application (ICISA), in press, 2014.
11 J.B. Larson, R.S. Michalski, "Selection of Most representative Training Examples and Incremental Generation of VL1 Hypothesis: The Underlying Methodology and the Description of Programs ESEL and AQ11", Technical Report 867, Department of Computer Science, University of Illinois, May 1978.
12 D. Oursten, R.J. Mooney, "Changing Rules: A Comprehensive Approach to Theory Refinement", Proceedings of the Eighth National Conference on Artificial Intelligence, Boston, MA, p.815, 1990.