Dengchao He, Wenning Hao, Wenyan Gan, Gang Chen, Dawei Jin
{"title":"一种基于属性信息离散度量的决策树算法","authors":"Dengchao He, Wenning Hao, Wenyan Gan, Gang Chen, Dawei Jin","doi":"10.1109/WISA.2013.25","DOIUrl":null,"url":null,"abstract":"In this paper, an improved decision tree algorithm based on dispersion measure of attribute information was proposed, which combined information gain and dispersion of attribute information as an evaluation criterion of attribute selection in order to overcome the deficiency that ID3 decision tree algorithm leaned to the multi-value attribute. From results of the experiment, it can be demonstrated that the proposed algorithm could over the deficiency of leaning to the multi-value attribute, and has good performance on classification.","PeriodicalId":178339,"journal":{"name":"IEEE WISA","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Decision Tree Algorithm Based on Dispersion Measure of Attribute Information\",\"authors\":\"Dengchao He, Wenning Hao, Wenyan Gan, Gang Chen, Dawei Jin\",\"doi\":\"10.1109/WISA.2013.25\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, an improved decision tree algorithm based on dispersion measure of attribute information was proposed, which combined information gain and dispersion of attribute information as an evaluation criterion of attribute selection in order to overcome the deficiency that ID3 decision tree algorithm leaned to the multi-value attribute. From results of the experiment, it can be demonstrated that the proposed algorithm could over the deficiency of leaning to the multi-value attribute, and has good performance on classification.\",\"PeriodicalId\":178339,\"journal\":{\"name\":\"IEEE WISA\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE WISA\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WISA.2013.25\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE WISA","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WISA.2013.25","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Decision Tree Algorithm Based on Dispersion Measure of Attribute Information
In this paper, an improved decision tree algorithm based on dispersion measure of attribute information was proposed, which combined information gain and dispersion of attribute information as an evaluation criterion of attribute selection in order to overcome the deficiency that ID3 decision tree algorithm leaned to the multi-value attribute. From results of the experiment, it can be demonstrated that the proposed algorithm could over the deficiency of leaning to the multi-value attribute, and has good performance on classification.