{"title":"基于树的集成模型和分类算法","authors":"J. Tsiligaridis","doi":"10.1109/ICAIIC57133.2023.10067006","DOIUrl":null,"url":null,"abstract":"An ensemble method is viewed as a compound model. The purpose of such a model is to achieve better predictive performance. The attempt is to tune predictions to observations by decreasing model variance, and bias. First the work focuses at the presentation of the Projective Decision Tree Algorithm (PA), a sort of Decision Tree (DT) based on purity and using the criterion of next node (CNN). Secondly, two sets of algorithms that provide improvement of the predictive performance are developed the first set of the Tree-Based Ensemble models of bagging and boosting types and the second set of known individual algorithms. The accuracy performance of the two sets with comparison is examined. Promising results based on accuracy of the proposed models are obtained.","PeriodicalId":105769,"journal":{"name":"2023 International Conference on Artificial Intelligence in Information and Communication (ICAIIC)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Tree-Based Ensemble Models and Algorithms for Classification\",\"authors\":\"J. Tsiligaridis\",\"doi\":\"10.1109/ICAIIC57133.2023.10067006\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An ensemble method is viewed as a compound model. The purpose of such a model is to achieve better predictive performance. The attempt is to tune predictions to observations by decreasing model variance, and bias. First the work focuses at the presentation of the Projective Decision Tree Algorithm (PA), a sort of Decision Tree (DT) based on purity and using the criterion of next node (CNN). Secondly, two sets of algorithms that provide improvement of the predictive performance are developed the first set of the Tree-Based Ensemble models of bagging and boosting types and the second set of known individual algorithms. The accuracy performance of the two sets with comparison is examined. Promising results based on accuracy of the proposed models are obtained.\",\"PeriodicalId\":105769,\"journal\":{\"name\":\"2023 International Conference on Artificial Intelligence in Information and Communication (ICAIIC)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-02-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 International Conference on Artificial Intelligence in Information and Communication (ICAIIC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICAIIC57133.2023.10067006\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 International Conference on Artificial Intelligence in Information and Communication (ICAIIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAIIC57133.2023.10067006","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Tree-Based Ensemble Models and Algorithms for Classification
An ensemble method is viewed as a compound model. The purpose of such a model is to achieve better predictive performance. The attempt is to tune predictions to observations by decreasing model variance, and bias. First the work focuses at the presentation of the Projective Decision Tree Algorithm (PA), a sort of Decision Tree (DT) based on purity and using the criterion of next node (CNN). Secondly, two sets of algorithms that provide improvement of the predictive performance are developed the first set of the Tree-Based Ensemble models of bagging and boosting types and the second set of known individual algorithms. The accuracy performance of the two sets with comparison is examined. Promising results based on accuracy of the proposed models are obtained.