2011•Unpublished venueRequires access

ID3 optimization algorithm based on interestingness gain

Liu Zhongtao, Wang Hong

Open publisher page 2 citations

Abstract

Aimed at the backwards of the information gain in ID3, through the improvement of information gain on interests of the users, and based on the calculating specialties of information gain in ID 3, the article reduces the backwards of decision tree's attribute dependency towards more value by decision tree optimization through twice information gain and optimized calculation. The experiment proves that: compared with the traditional method, the optimized ID3 is provided with high accuracy and counting speed. In addition the structure decision tree possesses the advantage of lower average of leaf tree.

About this research paper

What this paper is about

Aimed at the backwards of the information gain in ID3, through the improvement of information gain on interests of the users, and based on the calculating specialties of information gain in ID 3, the article reduces the backwards of decision tree's attribute dependency towards more value by decision tree optimization through twice information gain and optimized calculation. The experiment proves that: compared with the traditional method, the optimized ID3 is provided with high accuracy and counting speed. In addition the structure decision tree possesses the advantage of lower average of leaf tree.

Why it matters

OpenAlex reports 2 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

Aimed at the backwards of the information gain in ID3, through the improvement of information gain on interests of the users, and based on the calculating specialties of information gain in ID 3, the article reduces the backwards of decision tree's attribute dependency towards more value by decision tree optimization through twice information gain and optimized calculation. The experiment proves that: compared with the traditional method, the optimized ID3 is provided with high accuracy and counting speed. In addition the structure decision tree possesses the advantage of lower average of leaf tree.

Key concepts: Information gain, ID3 algorithm, Information gain ratio, Decision tree, ID3, Computer science, Dependency (UML), Tree (set theory)

Related papers

Back to paper searchBrowse research topicsOriginal source
ID3 optimization algorithm based on interestingness gain — Research Paper | ScholarLens