{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T07:33:06Z","timestamp":1768807986810,"version":"3.49.0"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031147135","type":"print"},{"value":"9783031147142","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-14714-2_30","type":"book-chapter","created":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T21:03:13Z","timestamp":1660424593000},"page":"427-441","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Multi-objective Evolutionary Ensemble Pruning Guided by\u00a0Margin Distribution"],"prefix":"10.1007","author":[{"given":"Yu-Chang","family":"Wu","sequence":"first","affiliation":[]},{"given":"Yi-Xiao","family":"He","sequence":"additional","affiliation":[]},{"given":"Chao","family":"Qian","sequence":"additional","affiliation":[]},{"given":"Zhi-Hua","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,14]]},"reference":[{"key":"30_CR1","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780195099713.001.0001","volume-title":"Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming","author":"T Back","year":"1996","unstructured":"Back, T.: Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming. Genetic Algorithms. Oxford University Press, Oxford, UK (1996)"},{"issue":"1","key":"30_CR2","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.inffus.2004.04.005","volume":"6","author":"RE Banfield","year":"2005","unstructured":"Banfield, R.E., Hall, L.O., Bowyer, K.W., Kegelmeyer, W.P.: Ensemble diversity measures and their application to thinning. Inf. Fusion 6(1), 49\u201362 (2005)","journal-title":"Inf. Fusion"},{"issue":"5","key":"30_CR3","doi-asserted-by":"publisher","first-page":"1651","DOI":"10.1214\/aos\/1024691352","volume":"26","author":"P Bartlett","year":"1998","unstructured":"Bartlett, P., Freund, Y., Lee, W.S., Schapire, R.E.: Boosting the margin: a new explanation for the effectiveness of voting methods. Ann. Stat. 26(5), 1651\u20131686 (1998)","journal-title":"Ann. Stat."},{"issue":"2","key":"30_CR4","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF00058655","volume":"24","author":"L Breiman","year":"1996","unstructured":"Breiman, L.: Bagging predictors. Mach. Learn. 24(2), 123\u2013140 (1996)","journal-title":"Mach. Learn."},{"issue":"7","key":"30_CR5","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1162\/089976699300016106","volume":"11","author":"L Breiman","year":"1999","unstructured":"Breiman, L.: Prediction games and arcing algorithms. Neural Comput. 11(7), 1493\u20131517 (1999)","journal-title":"Neural Comput."},{"key":"30_CR6","volume-title":"Classification and Regression Trees","author":"L Breiman","year":"1984","unstructured":"Breiman, L., Friedman, J., Olshen, R.A., Stone, C.J.: Classification and Regression Trees. Wadsworth and Brooks, Monterey (1984)"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Caruana, R., Niculescu-Mizil, A., Crew, G., Ksikes, A.: Ensemble selection from libraries of models. In: Proceedings of the 21st International Conference on Machine Learning (ICML 2004), pp. 18\u201325. Banff, Canada (2004)","DOI":"10.1145\/1015330.1015432"},{"issue":"4","key":"30_CR8","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2013","unstructured":"Deb, K., Jain, H.: An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, Part I: Solving problems with box constraints. IEEE Trans. Evol. Comput. 18(4), 577\u2013601 (2013)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"30_CR9","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"30_CR10","unstructured":"Dietterich, T., Margineantu, D.: Pruning adaptive boosting. In: Proceedings of the 14th International Conference on Machine Learning (ICML 1997), pp. 211\u2013218. Nashville, TN (1997)"},{"key":"30_CR11","unstructured":"Drucker, H., Burges, C.J.C., Kaufman, L., Smola, A.J., Vapnik, V.: Support vector regression machines. In: Advances in Neural Information Processing Systems 9 (NIPS 1996), pp. 155\u2013161. Denver, CO (1996)"},{"key":"30_CR12","unstructured":"Dua, D., Graff, C.: UCI machine learning repository (2017). http:\/\/archive.ics.uci.edu\/ml"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Eiben, A., Smith, J.: Introduction to Evolutionary Computing. Springer, Bering (2015)","DOI":"10.1007\/978-3-662-44874-8"},{"key":"30_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2013.07.002","volume":"203","author":"W Gao","year":"2013","unstructured":"Gao, W., Zhou, Z.H.: On the doubt about margin explanation of boosting. Artif. Intell. 203, 1\u201318 (2013)","journal-title":"Artif. Intell."},{"key":"30_CR15","unstructured":"Gr\u00f8nlund, A., Kamma, L., Larsen, K.G., Mathiasen, A., Nelson, J.: Margin-based generalization lower bounds for boosted classifiers. In: Advances in Neural Information Processing Systems 32 (NeurIPS 2019), Vancouver, Canada, pp. 11940\u201311949 (2019)"},{"issue":"2","key":"30_CR16","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1109\/TEVC.2004.823470","volume":"8","author":"M Laumanns","year":"2004","unstructured":"Laumanns, M., Thiele, L., Zitzler, E.: Running time analysis of multiobjective evolutionary algorithms on pseudo-Boolean functions. IEEE Trans. Evol. Comput. 8(2), 170\u2013182 (2004)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Li, N., Yu, Y., Zhou, Z.H.: Diversity regularized ensemble pruning. In: Proceedings of the 23rd European Conference on Machine Learning (ECML 2012), Bristol, UK, pp. 330\u2013345 (2012)","DOI":"10.1007\/978-3-642-33460-3_27"},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"Li, N., Zhou, Z.H.: Selective ensemble under regularization framework. In: Proceedings of the 8th International Workshop on Multiple Classifier Systems (MCS 2009), Reykjavik, Iceland, pp. 293\u2013303 (2009)","DOI":"10.1007\/978-3-642-02326-2_30"},{"key":"30_CR19","unstructured":"Lyu, S.H., Yang, L., Zhou, Z.H.: A refined margin distribution analysis for forest representation learning. In: Advances in Neural Information Processing Systems 32 (NeurIPS 2019), Vancouver, Canada, pp. 5531\u20135541 (2019)"},{"issue":"2","key":"30_CR20","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1109\/TPAMI.2008.78","volume":"31","author":"G Mart\u00ednez-Mu\u00f1oz","year":"2008","unstructured":"Mart\u00ednez-Mu\u00f1oz, G., Hern\u00e1ndez-Lobato, D., Su\u00e1rez, A.: An analysis of ensemble pruning techniques based on ordered aggregation. IEEE Trans. Pattern Anal. Mach. Intell. 31(2), 245\u2013259 (2008)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"30_CR21","doi-asserted-by":"crossref","unstructured":"Mart\u00ednez-Mu\u00f1oz, G., Su\u00e1rez, A.: Pruning in ordered bagging ensembles. In: Proceedings of the 23rd International Conference on Machine Learning (ICML 2006), Pittsburgh, PA, pp. 609\u2013616 (2006)","DOI":"10.1145\/1143844.1143921"},{"key":"30_CR22","volume-title":"Foundations of Machine Learning","author":"M Mohri","year":"2018","unstructured":"Mohri, M., Rostamizadeh, A., Talwalkar, A.: Foundations of Machine Learning. MIT Press, Cambridge (2018)"},{"key":"30_CR23","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.artint.2013.09.002","volume":"204","author":"C Qian","year":"2013","unstructured":"Qian, C., Yu, Y., Zhou, Z.H.: An analysis on recombination in multi-objective evolutionary optimization. Artif. Intell. 204, 99\u2013119 (2013)","journal-title":"Artif. Intell."},{"key":"30_CR24","doi-asserted-by":"crossref","unstructured":"Qian, C., Yu, Y., Zhou, Z.H.: Pareto ensemble pruning. In: Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI 2015), Austin, TX, pp. 2935\u20132941 (2015)","DOI":"10.1609\/aaai.v29i1.9579"},{"key":"30_CR25","doi-asserted-by":"crossref","unstructured":"Reyzin, L., Schapire, R.E.: How boosting the margin can also boost classifier complexity. In: Proceedings of the 23rd International Conference on Machine Learning (ICML 2006), Pittsburgh, PA , pp. 753\u2013760 (2006)","DOI":"10.1145\/1143844.1143939"},{"issue":"2","key":"30_CR26","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/BF00116037","volume":"5","author":"RE Schapire","year":"1990","unstructured":"Schapire, R.E.: The strength of weak learnability. Mach. Learn. 5(2), 197\u2013227 (1990)","journal-title":"Mach. Learn."},{"issue":"6","key":"30_CR27","doi-asserted-by":"publisher","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"F Wilcoxon","year":"1945","unstructured":"Wilcoxon, F.: Individual comparisons by ranking methods. Biometrics Bull. 1(6), 80\u201383 (1945)","journal-title":"Biometrics Bull."},{"issue":"6","key":"30_CR28","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang, Q., Li, H.: MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712\u2013731 (2007)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"30_CR29","doi-asserted-by":"crossref","unstructured":"Zhang, T., Zhou, Z.H.: Optimal margin distribution clustering. In: Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI 2018), New Orleans, LA, pp. 4474\u20134481 (2018)","DOI":"10.1609\/aaai.v32i1.11737"},{"issue":"6","key":"30_CR30","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1109\/TKDE.2019.2897662","volume":"32","author":"T Zhang","year":"2019","unstructured":"Zhang, T., Zhou, Z.H.: Optimal margin distribution machine. IEEE Trans. Knowl. Data Eng. 32(6), 1143\u20131156 (2019)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"30_CR31","doi-asserted-by":"publisher","DOI":"10.1201\/b12207","volume-title":"Ensemble Methods: Foundations and Algorithms","author":"ZH Zhou","year":"2012","unstructured":"Zhou, Z.H.: Ensemble Methods: Foundations and Algorithms. Chapman & Hall\/CRC Press, Boca Raton, FL (2012)"},{"key":"30_CR32","unstructured":"Zhou, Z.H.: Large margin distribution learning. In: Proceedings of the 6th International Workshop on Artificial Neural Networks in Pattern Recognition (ANNPR 2014), Montreal, Canada, pp. 1\u201311 (2014)"},{"key":"30_CR33","doi-asserted-by":"crossref","unstructured":"Zhou, Z.H., Tang, W.: Selective ensemble of decision trees. In: Proceddings of the 9th International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing (RSFDGrC 2003), Chongqing, China, pp. 476\u2013483 (2003)","DOI":"10.1007\/3-540-39205-X_81"},{"issue":"1\u20132","key":"30_CR34","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0004-3702(02)00190-X","volume":"137","author":"ZH Zhou","year":"2002","unstructured":"Zhou, Z.H., Wu, J., Tang, W.: Ensembling neural networks: many could be better than all. Artif. Intell. 137(1\u20132), 239\u2013263 (2002)","journal-title":"Artif. Intell."},{"key":"30_CR35","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-13-5956-9","volume-title":"Evolutionary Learning: Advances in Theories and Algorithms","author":"ZH Zhou","year":"2019","unstructured":"Zhou, Z.H., Yu, Y., Qian, C.: Evolutionary Learning: Advances in Theories and Algorithms. Springer, Singapore (2019)"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-14714-2_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:45:26Z","timestamp":1710261926000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14714-2_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147135","9783031147142"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14714-2_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"14 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dortmund","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2022.cs.tu-dortmund.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"185","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"85","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.75","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.11","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}