ScholarLens Back to search
2009•Journal of Kunming University of Science and TechnologyRequires access

Optimized Decision Tree Algorithm Based on Rough Set Theory

LI Yue-qiu

Open publisher page 0 citations

Abstract

An optimized decision tree algorithm based on rough set theory is proposed in this paper.Firstly the classification accuracy and the certainty factor of the decision making rules are adopted in the structure of the decision tree.The inhibitory factors are put forward in the forming process of the algorithm to cut branches for decision tree,avoiding redundant steps of cutting branches later.Secondly the conditions of property value and decision making property values are matched in each division to avoid unnecessary calculation and to improve the speed of the algorithm.

About this research paper

What this paper is about

An optimized decision tree algorithm based on rough set theory is proposed in this paper.Firstly the classification accuracy and the certainty factor of the decision making rules are adopted in the structure of the decision tree.The inhibitory factors are put forward in the forming process of the algorithm to cut branches for decision tree,avoiding redundant steps of cutting branches later.Secondly the conditions of property value and decision making property values are matched in each division to avoid unnecessary calculation and to improve the speed of the algorithm.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

An optimized decision tree algorithm based on rough set theory is proposed in this paper.Firstly the classification accuracy and the certainty factor of the decision making rules are adopted in the structure of the decision tree.The inhibitory factors are put forward in the forming process of the algorithm to cut branches for decision tree,avoiding redundant steps of cutting branches later.Secondly the conditions of property value and decision making property values are matched in each division to avoid unnecessary calculation and to improve the speed of the algorithm.

Key concepts: Decision tree, Rough set, Incremental decision tree, Property (philosophy), Division (mathematics), Algorithm, ID3 algorithm, Decision tree learning

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Optimized Decision Tree Algorithm Based on Rough Set Theory — Research Paper | ScholarLens