{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:58:25Z","timestamp":1740099505920,"version":"3.37.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030298906"},{"type":"electronic","value":"9783030298913"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-29891-3_32","type":"book-chapter","created":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T19:12:33Z","timestamp":1566501153000},"page":"365-376","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Binary Classification Using Pairs of Minimum Spanning Trees or N-Ary Trees"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4355-0366","authenticated-orcid":false,"given":"Riccardo La","family":"Grassa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7076-8328","authenticated-orcid":false,"given":"Ignazio","family":"Gallo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3860-4785","authenticated-orcid":false,"given":"Alessandro","family":"Calefati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9454-680X","authenticated-orcid":false,"given":"Dimitri","family":"Ognibene","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,22]]},"reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.csda.2018.08.015","volume":"131","author":"S Abpeykar","year":"2019","unstructured":"Abpeykar, S., Ghatee, M., Zare, H.: Ensemble decision forest of RBF networks via hybrid feature clustering approach for high-dimensional data classification. Comput. Stat. Data Anal. 131, 12\u201336 (2019)","journal-title":"Comput. Stat. Data Anal."},{"unstructured":"Budak, H., Ta\u015fabat, S.: A modified t-score for feature selection. Anadolu \u00dcniversitesi Bilim Ve Teknoloji Dergisi A-Uygulamal\u0131 Bilimler ve M\u00fchendislik (2016)","key":"32_CR2"},{"unstructured":"Dua, D., Graff, C.: UCI machine learning repository (2019), \n                      http:\/\/archive.ics.uci.edu\/ml","key":"32_CR3"},{"key":"32_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-36755-1_7","volume-title":"Machine Learning: ECML 2002","author":"G Eibl","year":"2002","unstructured":"Eibl, G., Pfeiffer, K.P.: How to make AdaBoost.M1 work for weak base classifiers by changing only one line of the code. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) ECML 2002. LNCS (LNAI), vol. 2430, pp. 72\u201383. Springer, Heidelberg (2002). \n                      https:\/\/doi.org\/10.1007\/3-540-36755-1_7"},{"key":"32_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/3-540-36182-0_15","volume-title":"Discovery Science","author":"E Frank","year":"2002","unstructured":"Frank, E., Holmes, G., Kirkby, R., Hall, M.: Racing committees for large datasets. In: Lange, S., Satoh, K., Smith, C.H. (eds.) DS 2002. LNCS, vol. 2534, pp. 153\u2013164. Springer, Heidelberg (2002). \n                      https:\/\/doi.org\/10.1007\/3-540-36182-0_15"},{"issue":"7\u20139","key":"32_CR6","doi-asserted-by":"publisher","first-page":"1859","DOI":"10.1016\/j.neucom.2008.05.003","volume":"72","author":"P Juszczak","year":"2009","unstructured":"Juszczak, P., Tax, D.M., Pe, E., Duin, R.P., et al.: Minimum spanning tree based one-class classifier. Neurocomputing 72(7\u20139), 1859\u20131869 (2009)","journal-title":"Neurocomputing"},{"key":"32_CR7","doi-asserted-by":"publisher","first-page":"503","DOI":"10.4310\/SII.2018.v11.n3.a12","volume":"11","author":"V Krakovna","year":"2018","unstructured":"Krakovna, V., Du, J., Liu, J.S.: Interpretable selection and visualization of features and interactions using bayesian forests. Stat. Interface 11, 503\u2013513 (2018)","journal-title":"Stat. Interface"},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.patcog.2018.05.015","volume":"83","author":"B Krawczyk","year":"2018","unstructured":"Krawczyk, B., Galar, M., Wo\u017aniak, M., Bustince, H., Herrera, F.: Dynamic ensemble selection for multi-class classification with one-class classifiers. Pattern Recogn. 83, 34\u201351 (2018)","journal-title":"Pattern Recogn."},{"key":"32_CR9","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/B978-1-55860-307-3.50037-X","volume-title":"Machine Learning Proceedings 1993","author":"J.R. Quinlan","year":"1993","unstructured":"Quinlan, J.R.: Combining instance-based and model-based learning. In: Proceedings of the Tenth International Conference on Machine Learning, pp. 236\u2013243 (1993)"},{"key":"32_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/3-540-44816-0_12","volume-title":"Advances in Intelligent Data Analysis","author":"AK Seewald","year":"2001","unstructured":"Seewald, A.K., F\u00fcrnkranz, J.: An evaluation of grading classifiers. In: Hoffmann, F., Hand, D.J., Adams, N., Fisher, D., Guimaraes, G. (eds.) IDA 2001. LNCS, vol. 2189, pp. 115\u2013124. Springer, Heidelberg (2001). \n                      https:\/\/doi.org\/10.1007\/3-540-44816-0_12"},{"key":"32_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-12127-2_1","volume-title":"Multiple Classifier Systems","author":"S Segu\u00ed","year":"2010","unstructured":"Segu\u00ed, S., Igual, L., Vitri\u00e0, J.: Weighted bagging for graph based one-class classifiers. In: El Gayar, N., Kittler, J., Roli, F. (eds.) MCS 2010. LNCS, vol. 5997, pp. 1\u201310. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-12127-2_1"},{"key":"32_CR12","first-page":"831","volume":"15","author":"B Singh","year":"2018","unstructured":"Singh, B., Vyas, O.: Maximum spanning tree based redundancy elimination for feature selection of high dimensional data. Int. Arab J. Inf. Technol. 15, 831\u2013841 (2018)","journal-title":"Int. Arab J. Inf. Technol."},{"unstructured":"Stefanowski, J.: The rough set based rule induction technique for classification problems. In: Proceedings of 6th European Conference on Intelligent Techniques and Soft Computing EUFIT, vol. 98 (1998)","key":"32_CR13"},{"unstructured":"Tax, D.M., Duin, R.P.: Using two-class classifiers for multiclass classification. In: Object recognition supported by User Interaction for Service Robots, vol. 2, pp. 124\u2013127. IEEE (2002)","key":"32_CR14"},{"unstructured":"Ting, K.M., Witten, I.H.: Stacking bagged and dagged models (1997)","key":"32_CR15"},{"issue":"2","key":"32_CR16","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1023\/A:1007659514849","volume":"40","author":"GI Webb","year":"2000","unstructured":"Webb, G.I.: Multiboosting: a technique for combining boosting and wagging. Mach. Learn. 40(2), 159\u2013196 (2000)","journal-title":"Mach. Learn."}],"container-title":["Lecture Notes in Computer Science","Computer Analysis of Images and Patterns"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29891-3_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T19:28:39Z","timestamp":1566502119000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-29891-3_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030298906","9783030298913"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29891-3_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"22 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Analysis of Images and Patterns","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Salerno","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caip2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/caip2019.unisa.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"176","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":"106","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":"60% - 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":"2.68","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.40","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}