{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T16:23:33Z","timestamp":1758817413603,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031013324"},{"type":"electronic","value":"9783031013331"}],"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-01333-1_12","type":"book-chapter","created":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T03:33:56Z","timestamp":1649216036000},"page":"143-156","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On Usefulness of Outlier Elimination in Classification Tasks"],"prefix":"10.1007","author":[{"given":"Du\u0161an","family":"Hetlerovi\u0107","sequence":"first","affiliation":[]},{"given":"Lubo\u0161","family":"Popel\u00ednsk\u00fd","sequence":"additional","affiliation":[]},{"given":"Pavel","family":"Brazdil","sequence":"additional","affiliation":[]},{"given":"Carlos","family":"Soares","sequence":"additional","affiliation":[]},{"given":"Fernando","family":"Freitas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,7]]},"reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10994-017-5687-8","volume":"107","author":"SM Abdulrahman","year":"2017","unstructured":"Abdulrahman, S.M., Brazdil, P., van Rijn, J.N., Vanschoren, J.: Speeding up algorithm selection using average ranking and active testing by introducing runtime. Mach. Learn. 107(1), 79\u2013108 (2017). https:\/\/doi.org\/10.1007\/s10994-017-5687-8","journal-title":"Mach. Learn."},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Abdulrahman, S.M., Brazdil, P., Zainon, W.M.N.W., Adamu, A.: Simplifying the algorithm selection using reduction of rankings of classification algorithms. In: ICSCA 2019 Proceedings of the 2019 8th International Conference on Software and Computer Applications, pp. 140\u2013148. ACM, New York (2019)","DOI":"10.1145\/3316615.3316674"},{"key":"12_CR3","first-page":"37","volume":"6","author":"D Aha","year":"1991","unstructured":"Aha, D., Kibler, D.: Instance-based learning algorithms. Mach. Learn. 6, 37\u201366 (1991)","journal-title":"Mach. Learn."},{"key":"12_CR4","volume-title":"Outliers in Statistical Data","author":"V Barnett","year":"1978","unstructured":"Barnett, V., Lewis, T.: Outliers in Statistical Data. Wiley, Hoboken (1978)"},{"key":"12_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-67024-5","volume-title":"Metalearning: Applications to Automated Machine Learning and Data Mining","author":"P Brazdil","year":"2022","unstructured":"Brazdil, P., van Rijn, J.N., Soares, C., Vanschoren, J.: Metalearning: Applications to Automated Machine Learning and Data Mining, 2nd edn. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-030-67024-5","edition":"2"},{"issue":"1","key":"12_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman, L.: Random forests. Mach. Learn. 45(1), 5\u201332 (2001)","journal-title":"Mach. Learn."},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Breunig, M.M., Kriegel, H.P., Ng, R.T., Sander, J.: LOF: identifying density-based local outliers. In: ACM SIGMOD Record, vol. 29, pp. 93\u2013104. ACM (2000)","DOI":"10.1145\/335191.335388"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Cohen, W.W.: Fast effective rule induction. In: Twelfth International Conference on Machine Learning, pp. 115\u2013123. Morgan Kaufmann (1995)","DOI":"10.1016\/B978-1-55860-377-6.50023-2"},{"issue":"20","key":"12_CR9","doi-asserted-by":"publisher","first-page":"12","DOI":"10.3182\/20130902-3-CN-3020.00044","volume":"46","author":"Z Ding","year":"2013","unstructured":"Ding, Z., Fei, M.: An anomaly detection approach based on isolation forest algorithm for streaming data using sliding window. IFAC Proc. Vol. 46(20), 12\u201317 (2013)","journal-title":"IFAC Proc. Vol."},{"key":"12_CR10","series-title":"The Springer Series on Challenges in Machine Learning","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-030-05318-5_6","volume-title":"Automated Machine Learning","author":"M Feurer","year":"2019","unstructured":"Feurer, M., Klein, A., Eggensperger, K., Springenberg, J.T., Blum, M., Hutter, F.: Auto-sklearn: efficient and robust automated machine learning. In: Hutter, F., Kotthoff, L., Vanschoren, J. (eds.) Automated Machine Learning. TSSCML, pp. 113\u2013134. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-05318-5_6"},{"key":"12_CR11","unstructured":"Frank, E., Witten, I.H.: Generating accurate rule sets without global optimization. In: Shavlik, J. (ed.) Fifteenth International Conference on Machine Learning, pp. 144\u2013151. Morgan Kaufmann (1998)"},{"issue":"1","key":"12_CR12","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/1656274.1656278","volume":"11","author":"M Hall","year":"2009","unstructured":"Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., Witten, I.H.: The Weka data mining software: an update. SIGKDD Explor. Newsl. 11(1), 10\u201318 (2009)","journal-title":"SIGKDD Explor. Newsl."},{"key":"12_CR13","first-page":"5","volume":"2","author":"NM Hewahi","year":"2007","unstructured":"Hewahi, N.M., Saad, M.K.: Class outliers mining: distance-based approach. Int. J. Intell. Syst. Technol. 2, 5 (2007)","journal-title":"Int. J. Intell. Syst. Technol."},{"key":"12_CR14","first-page":"507","volume":"5","author":"F Hutter","year":"2011","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K.: Sequential model-based optimization for general algorithm configuration. LION 5, 507\u2013523 (2011)","journal-title":"LION"},{"key":"12_CR15","unstructured":"Hyndman, R.J., Athanasopoulos, G.: Forecasting: Principles and Practice, 3rd edn. OTexts (2021)"},{"key":"12_CR16","unstructured":"John, G.H.: Robust decision trees: removing outliers from databases. In: Knowledge Discovery and Data Mining, pp. 174\u2013179. AAAI Press (1995)"},{"key":"12_CR17","unstructured":"John, G.H., Langley, P.: Estimating continuous distributions in Bayesian classifiers. In: Eleventh Conference on Uncertainty in Artificial Intelligence, pp. 338\u2013345. Morgan Kaufmann, San Mateo (1995)"},{"issue":"1","key":"12_CR18","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10994-005-0466-3","volume":"59","author":"N Landwehr","year":"2005","unstructured":"Landwehr, N., Hall, M., Frank, E.: Logistic model trees. Mach. Learn. 59(1), 161\u2013205 (2005)","journal-title":"Mach. Learn."},{"issue":"1","key":"12_CR19","doi-asserted-by":"publisher","first-page":"191","DOI":"10.2307\/2347628","volume":"41","author":"S le Cessie","year":"1992","unstructured":"le Cessie, S., van Houwelingen, J.C.: Ridge estimators in logistic regression. Appl. Stat. 41(1), 191\u2013201 (1992)","journal-title":"Appl. Stat."},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-319-24465-5_17","volume-title":"Advances in Intelligent Data Analysis XIV","author":"L Nezvalov\u00e1","year":"2015","unstructured":"Nezvalov\u00e1, L., Popel\u00ednsk\u00fd, L., Torgo, L., Vacul\u00edk, K.: Class-based outlier detection: staying zombies or awaiting for resurrection? In: Fromont, E., De Bie, T., van Leeuwen, M. (eds.) IDA 2015. LNCS, vol. 9385, pp. 193\u2013204. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24465-5_17"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Platt, J.: Fast training of support vector machines using sequential minimal optimization. In: Schoelkopf, B., Burges, C., Smola, A. (eds.) Advances in Kernel Methods - Support Vector Learning. MIT Press (1998)","DOI":"10.7551\/mitpress\/1130.003.0016"},{"key":"12_CR22","volume-title":"C4.5: Programs for Machine Learning","author":"R Quinlan","year":"1993","unstructured":"Quinlan, R.: C4.5: Programs for Machine Learning. Morgan Kaufmann Publishers, San Mateo (1993)"},{"key":"12_CR23","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","volume":"15","author":"JR Rice","year":"1976","unstructured":"Rice, J.R.: The algorithm selection problem. Adv. Comput. 15, 65\u2013118 (1976)","journal-title":"Adv. Comput."},{"key":"12_CR24","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.patcog.2021.108198","volume":"121","author":"JA S\u00e1ez","year":"2022","unstructured":"S\u00e1ez, J.A., Corchado, E.: ANCES: a novel method to repair attribute noise in classification problems. Pattern Recogn. 121, 108\u2013198 (2022)","journal-title":"Pattern Recogn."},{"issue":"1","key":"12_CR25","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10462-016-9518-2","volume":"49","author":"MR Smith","year":"2016","unstructured":"Smith, M.R., Martinez, T.: The robustness of majority voting compared to filtering misclassified instances in supervised classification tasks. Artif. Intell. Rev. 49(1), 105\u2013130 (2016). https:\/\/doi.org\/10.1007\/s10462-016-9518-2","journal-title":"Artif. Intell. Rev."},{"issue":"2","key":"12_CR26","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10994-013-5422-z","volume":"95","author":"MR Smith","year":"2013","unstructured":"Smith, M.R., Martinez, T., Giraud-Carrier, C.: An instance level analysis of data complexity. Mach. Learn. 95(2), 225\u2013256 (2013). https:\/\/doi.org\/10.1007\/s10994-013-5422-z","journal-title":"Mach. Learn."},{"key":"12_CR27","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/11564126_72","volume-title":"Knowledge Discovery in Databases: PKDD 2005","author":"M Sumner","year":"2005","unstructured":"Sumner, M., Frank, E., Hall, M.: Speeding up logistic model tree induction. In: Jorge, A.M., Torgo, L., Brazdil, P., Camacho, R., Gama, J. (eds.) PKDD 2005. LNCS (LNAI), vol. 3721, pp. 675\u2013683. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11564126_72"},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"Thornton, C., Hutter, F., Hoos, H.H., Leyton-Brown, K.: Auto-WEKA: combined selection and hyperparameter optimization of classification algorithms. In: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 847\u2013855. ACM (2013)","DOI":"10.1145\/2487575.2487629"},{"key":"12_CR29","first-page":"448","volume":"6","author":"I Tomek","year":"1976","unstructured":"Tomek, I.: An experiment with the edited nearest-neighbor rule. IEEE Trans. Syst. Man Cybern. 6, 448\u2013452 (1976)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"van Rijn, J.N., Hutter, F.: Hyperparameter importance across datasets. In: KDD 2018: The 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. ACM (2018)","DOI":"10.1145\/3219819.3220058"},{"issue":"2","key":"12_CR31","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/2641190.2641198","volume":"15","author":"J Vanschoren","year":"2013","unstructured":"Vanschoren, J., van Rijn, J.N., Bischl, B., Torgo, L.: OpenML: networked science in machine learning. SIGKDD Explor. 15(2), 49\u201360 (2013)","journal-title":"SIGKDD Explor."},{"issue":"2","key":"12_CR32","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1023\/A:1019956318069","volume":"18","author":"R Vilalta","year":"2002","unstructured":"Vilalta, R., Drissi, Y.: A perspective view and survey of meta-learning. Artif. Intell. Rev. 18(2), 77\u201395 (2002)","journal-title":"Artif. Intell. Rev."},{"issue":"3","key":"12_CR33","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1023\/A:1007626913721","volume":"38","author":"DR Wilson","year":"2000","unstructured":"Wilson, D.R., Martinez, T.R.: Reduction techniques for instance-based learning algorithms. Mach. Learn. 38(3), 257\u2013286 (2000)","journal-title":"Mach. Learn."},{"key":"12_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-31612-8_18","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2012","author":"L Xu","year":"2012","unstructured":"Xu, L., Hutter, F., Hoos, H., Leyton-Brown, K.: Evaluating component solver contributions to portfolio-based algorithm selectors. In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol. 7317, pp. 228\u2013241. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31612-8_18"},{"key":"12_CR35","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10462-004-0751-8","volume":"22","author":"X Zhu","year":"2004","unstructured":"Zhu, X., Wu, X.: Class noise vs. attribute noise: a quantitative study. Artif. Intell. Rev. 22, 177\u2013210 (2004)","journal-title":"Artif. Intell. Rev."}],"container-title":["Lecture Notes in Computer Science","Advances in Intelligent Data Analysis XX"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-01333-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T18:59:29Z","timestamp":1675191569000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-01333-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031013324","9783031013331"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-01333-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"7 April 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IDA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Intelligent Data Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rennes","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"20 April 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 April 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ida2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ida-2022.org\/","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":"75","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":"31","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":"41% - 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","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":"4","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)"}}]}}