An Efficient Decision Tree Algorithm Using Rough Set Theory
Main Article Content
Abstract
Decision tree are commonly used for gaining information for the purpose of decision making. Decision tree starts with a root node on
which it is for users to take actions. From this node, users split each node recursively according to decision tree learning algorithm. The final
result is a decision tree in which each branch represents a possible scenario of decision and its outcome. Decision tree is widely used in machine
learning. Rough set theory is emerging as a powerful toll for reasoning about data. Attribute reduction is one of important topics in the research
on the rough set theory. In this paper, proposed a novel algorithm is presented to optimize decision tree using rough set theory and the degree of
dependency in rough set theory is used to reduce condition attribute as well as to select splitting attribute. Our technique is optimized by level
wise that is the condition attribute which is irrelevant in one level is deleted and further, if it is important in the next level than it can be used. By
this algorithm drawback of id3 that is repetition of condition attribute is resolved and limited number of nodes are produced.
Â
Â
Â
Keywords: Classification, Rough Set, Decision tree, Split, Pruning.
Downloads
Article Details
COPYRIGHT
Submission of a manuscript implies: that the work described has not been published before, that it is not under consideration for publication elsewhere; that if and when the manuscript is accepted for publication, the authors agree to automatic transfer of the copyright to the publisher.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work
- The journal allows the author(s) to retain publishing rights without restrictions.
- The journal allows the author(s) to hold the copyright without restrictions.