Study of data mining algorithm based on decision tree

Decision tree algorithm is a kind of data mining model to make induction learning algorithm based on examples. It is easy to extract display rule, has smaller computation amount, and could display important decision property and own higher classification precision. For the study of data mining algor...

Full description

Saved in:

Bibliographic Details
Published in:	2010 International Conference On Computer Design and Applications Vol. 1; pp. V1-155 - V1-158
Main Authors:	Linna Li, Xuemin Zhang
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.06.2010
Subjects:	Algorithm design and analysis Classification tree analysis Computer displays Data analysis Data mining Decision Tree Decision trees Entropy Forward contracts ID3 Weighted Simplification Entropy Windows
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	Decision tree algorithm is a kind of data mining model to make induction learning algorithm based on examples. It is easy to extract display rule, has smaller computation amount, and could display important decision property and own higher classification precision. For the study of data mining algorithm based on decision tree, this article put forward specific solution for the problems of property value vacancy, multiple-valued property selection, property selection criteria, propose to introduce weighted and simplified entropy into decision tree algorithm so as to achieve the improvement of ID3 algorithm. The experimental results show that the improved algorithm is better than widely used ID3 algorithm at present on overall performance.
DOI:	10.1109/ICCDA.2010.5541172