Abstract
This paper presents a new approach for inducing decision trees by combining information entropy criteria with VPRS based methods. From the angle of rough set theory, when inducing decision trees, entropy based methods emphasize the effect of class distribution. Whereas the rough set based approaches emphasize the effect of certainty. The presented approach takes the advantages of both criteria for inducing decision trees. Comparisons between the presented approach and the fundamental information entropy based method on some data sets from the UCI Machine Learning Repository are also reported.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hunt, E.B., Marin, J., Stone, P.J.: Experiments in Induction. Academic Press, New York (1966)
Fayyad, U.M., Weir, N., Djiorgovski, S.: SKICAT: A machine learning system for automated cataloging of large scale sky surveys. In: Proc. the Tenth International Conference on Machine Learning, pp. 112–119. Morgan Kaufmann, Amherst, MA (1993)
Michalski, R.S., Carbonell, J.G., Mitchell, T.M.: Machine Learning-An Artificial Intelligence Approach. Springer, Germany (1983)
Chen, S.C., Shyu, M.L., Chen, M., Zhang, C.C.: A Decision Tree-based Multimodal Data Mining Framework for Soccer Goal Detection. In: IEEE International Conference on Multimedia and Expo, June 27-June 30, 2004, Taipei, Taiwan, ROC (2004)
Quinlan, J.R.: Introduction of Decision Trees. Machine Learning 3, 81–106 (1986)
Cheng, J., Bell, D.: Learning bayesian networks from data: an efficient approach based on information theory. In: Proc. of the sixth ACM International Conference on Information and Knowledge Management, pp. 325–331 (1997)
Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J.: Classification and regression trees. Technical report, Wadsworth International, Monterey, CA (1984)
Pawlak, Z.: Rough sets. International Journal of Computer and Information Science 11, 341–356 (1982)
Jerzy, W., GrZymala-Busse, J.W., Ziarko, W.: Data mining and rough set theory. Communications of the ACM 43(4), 108–109 (2000)
Pawlak, Z.: Rough set approach to multi-attribute decision analysis. European Journal of Operational Research 72(3), 443–459 (1994)
Pawlak, Z., Wang, S.K.M., Ziarko, W.: Rough sets: probabilistic versus deterministic approach. Int. J. Man-Machine Studies 29(1), 81–95 (1988)
Wei, J.M.: Rough Set Based Approach to Selection of Node. International Journal of Computational Cognition 1(2), 25–40 (2003)
Mingers, J.: An empirical comparison of pruning methods for decision-tree induction. Machine Learning 4(2), 319–342 (1989)
Quinlan, J.R., Rivest, R.: Inferring decision trees using the minimum description length principle. Information and Computation 80(3), 227–248 (1989)
Zbigniew, W.R., Zemankova, M.: Imprecise Concept Learning within a Growing Language. In: Proc. the sixth inter. workshop on Machine learning, Ithaca, New York, United States, pp. 314–319 (1989)
Berzal, F., Cubero, J.C., Cuenca, F., MartÃn-Bautista, M.J.: On the quest for easy-to-understand splitting rules. Data & Knowledge Engineering 44(1), 31–48 (2003)
Ziarko, W.: Variable precision rough set model. Journal of Computer and System Sciences 46(1), 39–59 (1993)
Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann, San Francisco (1993)
Gehrke, J., Ramakrishnan, R., Ganti, V.: RainForest - A Framework for Fast Decision Tree Construction of Large Datasets. Data Mining and Knowledge Discovery 4(2/3), 127–162 (2000)
Rastogi, R., Shim, K.: PUBLIC: A Decision Tree Classifier that integrates building and pruning. Data Mining and Knowledge Discovery 4(4), 315–344 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, S., Wei, J., You, J., Liu, D. (2006). ComEnVprs: A Novel Approach for Inducing Decision Tree Classifiers. In: Li, X., Zaïane, O.R., Li, Z. (eds) Advanced Data Mining and Applications. ADMA 2006. Lecture Notes in Computer Science(), vol 4093. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11811305_13
Download citation
DOI: https://doi.org/10.1007/11811305_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37025-3
Online ISBN: 978-3-540-37026-0
eBook Packages: Computer ScienceComputer Science (R0)