决策树的优化

[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91 Pub Date : 1991-11-10 DOI:10.1109/TAI.1991.167043

W. Jung, J. B. Jones, Jianhua Chen

{"title":"决策树的优化","authors":"W. Jung, J. B. Jones, Jianhua Chen","doi":"10.1109/TAI.1991.167043","DOIUrl":null,"url":null,"abstract":"An approach is presented to the optimization of decision trees. A decision tree is considered optimal if it correctly classifies the known data set and has the minimal number of nodes. It is shown that it is important to decide the right order of attributes to test, for this can reduce the number of checking nodes in a decision tree.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Optimization of the decision tree\",\"authors\":\"W. Jung, J. B. Jones, Jianhua Chen\",\"doi\":\"10.1109/TAI.1991.167043\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An approach is presented to the optimization of decision trees. A decision tree is considered optimal if it correctly classifies the known data set and has the minimal number of nodes. It is shown that it is important to decide the right order of attributes to test, for this can reduce the number of checking nodes in a decision tree.<<ETX>>\",\"PeriodicalId\":371778,\"journal\":{\"name\":\"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-11-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TAI.1991.167043\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAI.1991.167043","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

摘要

提出了一种优化决策树的方法。如果决策树正确地分类了已知数据集，并且节点数量最少，则认为决策树是最优的。结果表明，决定属性测试的正确顺序是很重要的，因为这可以减少决策树中检查节点的数量。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Optimization of the decision tree

An approach is presented to the optimization of decision trees. A decision tree is considered optimal if it correctly classifies the known data set and has the minimal number of nodes. It is shown that it is important to decide the right order of attributes to test, for this can reduce the number of checking nodes in a decision tree.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91

自引率

0.00%

发文量