2007•Journal of Xiamen UniversityRequires access

Research and Improvement of Decision Trees Algorithm

Shaorong Feng

Open publisher page 9 citations

Abstract

Decision tree is a key classification method in data mining.Firstly,based on the research and comparison of several classic decision trees algorithms,an improved decision tree algorithm based on metric is proposed in this paper.In practice,this kind of decision trees combines linear classifier and decision trees.The experimental result indicates that the decision trees based on this method can effectively reduce the decision trees level,which enhance classified efficiency of the decision trees.MBDT classified experiment results demonstrate the correctness and availability of the above conclusions.

About this research paper

What this paper is about

Decision tree is a key classification method in data mining.Firstly,based on the research and comparison of several classic decision trees algorithms,an improved decision tree algorithm based on metric is proposed in this paper.In practice,this kind of decision trees combines linear classifier and decision trees.The experimental result indicates that the decision trees based on this method can effectively reduce the decision trees level,which enhance classified efficiency of the decision trees.MBDT classified experiment results demonstrate the correctness and availability of the above conclusions.

Why it matters

OpenAlex reports 9 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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

Decision tree is a key classification method in data mining.Firstly,based on the research and comparison of several classic decision trees algorithms,an improved decision tree algorithm based on metric is proposed in this paper.In practice,this kind of decision trees combines linear classifier and decision trees.The experimental result indicates that the decision trees based on this method can effectively reduce the decision trees level,which enhance classified efficiency of the decision trees.MBDT classified experiment results demonstrate the correctness and availability of the above conclusions.

Key concepts: Decision tree, Incremental decision tree, Decision tree learning, ID3 algorithm, Alternating decision tree, Decision stump, Correctness, Computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
Research and Improvement of Decision Trees Algorithm — Research Paper | ScholarLens