{"title":"凸壳集成机","authors":"Yongdai Kim","doi":"10.1109/ICDM.2002.1183909","DOIUrl":null,"url":null,"abstract":"We propose a new ensemble algorithm called Convex Hull Ensemble Machine (CHEM). CHEM in Hilbert space is developed first and it is modified to regression and classification problems. Empirical studies show that in classification problems CHEM has similar prediction accuracy as AdaBoost, but CHEM is much more robust to output noise. In regression problems, CHEM works competitively with other ensemble methods such as Gradient Boost and Bagging.","PeriodicalId":405340,"journal":{"name":"2002 IEEE International Conference on Data Mining, 2002. Proceedings.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Convex Hull Ensemble Machine\",\"authors\":\"Yongdai Kim\",\"doi\":\"10.1109/ICDM.2002.1183909\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a new ensemble algorithm called Convex Hull Ensemble Machine (CHEM). CHEM in Hilbert space is developed first and it is modified to regression and classification problems. Empirical studies show that in classification problems CHEM has similar prediction accuracy as AdaBoost, but CHEM is much more robust to output noise. In regression problems, CHEM works competitively with other ensemble methods such as Gradient Boost and Bagging.\",\"PeriodicalId\":405340,\"journal\":{\"name\":\"2002 IEEE International Conference on Data Mining, 2002. Proceedings.\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-12-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2002 IEEE International Conference on Data Mining, 2002. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDM.2002.1183909\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2002 IEEE International Conference on Data Mining, 2002. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDM.2002.1183909","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We propose a new ensemble algorithm called Convex Hull Ensemble Machine (CHEM). CHEM in Hilbert space is developed first and it is modified to regression and classification problems. Empirical studies show that in classification problems CHEM has similar prediction accuracy as AdaBoost, but CHEM is much more robust to output noise. In regression problems, CHEM works competitively with other ensemble methods such as Gradient Boost and Bagging.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
