计算机与数字工程2017，Vol.45Issue(5)：839-843,5.DOI:10.3969/j.issn.1672-9722.2017.05.011
一种基于MMTD的决策树算法的研究
A Decision Tree Algorithm Based on MMTD
朱俚治1
作者信息
- 1. 南京航空航天大学信息中心 南京 210016
- 折叠
摘要
Abstract
decision tree is a kind of commonly used classification algorithm,since the ID3 algorithm has been related to the personnel to improve the algorithm,which appeares a variety of decision tree algorithm. When the decision tree is generated,the re?cursive algorithm is used to split the nodes of the decision tree. If the information gain of nodes is bigger,the probability of node splitting is greater. The ID3 algorithm and C4.5 algorithm in the information gain becomes an important basis for the node is split,so according to characteristics of the decision tree node split when the information gain function,this paper presents another algorithm to measure the size of the information gain,the algorithm with measure formula and the core algorithm——MMTD algorithm. The in?novation of this paper lies in MMTD algorithm in decision tree were used for the first time,and in the MMTD as the basis and the core of the algorithm is to achieve the measure of the size of the information gain.关键词
MMTD/决策树/信息熵/信息增益/ID3算法Key words
MMTD/decision tree/information entropy/information gain/ID3 algorithm分类
信息技术与安全科学引用本文复制引用
朱俚治..一种基于MMTD的决策树算法的研究[J].计算机与数字工程,2017,45(5):839-843,5.
