Abstract
Decision tree, a commonly used classification model, is constructed recursively following a top down approach (from the general concepts to particular examples) by repeatedly splitting the training data set. ID3 is a greedy algorithm that considers one attribute at a time for splitting at a node. In C4.5, all attributes, barring the nominal attributes used at the parent nodes, are retained for further computation. This leads to extra overheads of memory and computational efforts. Rough Set theory (RS) simplifies the search for dominant attributes in the information systems. In this paper, Rough set based Decision Tree (RDT) model combining the RS tools with classical DT capabilities, is proposed to address the issue of computational overheads. The experiments compare the performance of RDT with RS approach and ID3 algorithm. The performance of RDT over RS approach is observed better in accuracy and rule complexity while RDT and ID3 are comparable.
This is a preview of subscription content, log in via an institution to check access.
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
Bjorvand, A.T., Komorowski, J.: Practical Applications of Genetic Algorithms for Efficient Reduct Computation. vol. 4, pp. 601–606, Wissenschaft & Technik Verlag (1997)
Grzymala-Busse, J.W., Stefanowski, J.: Three Discretization Methods for Rule Induction. IJIS 16(1), 29–38 (2001)
Hall, M.A., Holmes, G.: Benchmarking Attribute Selection Techniques for Discrete Class Data Mining. IEEE TKDE 20, 1–16 (2002)
Han, J., Kamber, M.: Data Mining: Concepts and Techniques, pp. 279–325. Morgan Kaufmann, San Francisco (2001)
Murthy, S.K.: Automatic Construction of decision trees from Data: A Multidisciplinary Survey. Data Mining and Knowledge Discovery 2, 345–389 (1998)
Pawlak, Z.: Drawing Conclusions from Data-The Rough Set Way. IJIS 16, 3–11 (2001)
Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kauffman, San Francisco (1993)
Rosetta, Rough set toolkit for analysis of data, available at http://www.idi.ntnu.no/~aleks/rosetta/
Winston, P.H.: Artificial Intelligence, 3rd edn. Addison-Wesley, Reading (1992)
Wroblewski, J.: Finding Minimal Reduct Using Genetic Algorithms. Warsaw University of Technology- Institute of Computer Science- Reports – 16/95 (1995)
Ziarko, W.: Discovery through Rough Set Theory. Comm. of ACM 42(11), 55–57 (1999)
Ziarko, W.: Variable Precision Rough Set Model. Jr. of Computer and System Sciences 46(1), 39–59b (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Minz, S., Jain, R. (2003). Rough Set Based Decision Tree Model for Classification. In: Kambayashi, Y., Mohania, M., Wöß, W. (eds) Data Warehousing and Knowledge Discovery. DaWaK 2003. Lecture Notes in Computer Science, vol 2737. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45228-7_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-45228-7_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40807-9
Online ISBN: 978-3-540-45228-7
eBook Packages: Springer Book Archive