{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T04:18:30Z","timestamp":1789964310623,"version":"4.0.1"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030017675","type":"print"},{"value":"9783030017682","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-01768-2_2","type":"book-chapter","created":{"date-parts":[[2018,10,4]],"date-time":"2018-10-04T12:48:08Z","timestamp":1538657288000},"page":"15-27","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The Need for Interpretability Biases"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1207-0159","authenticated-orcid":false,"given":"Johannes","family":"F\u00fcrnkranz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tom\u00e1\u0161","family":"Kliegr","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,10,5]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Allahyari, H., Lavesson, N.: User-oriented assessment of classification model understandability. In: Kofod-Petersen, A., Heintz, F., Langseth, H. (eds.) Proceedings of the 11th Scandinavian Conference on Artificial Intelligence (SCAI-11), pp. 11\u201319 (2011)","DOI":"10.3233\/978-1-60750-754-3-11"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BFb0026680","volume-title":"Machine Learning: ECML-98","author":"H Bensusan","year":"1998","unstructured":"Bensusan, H.: God doesn\u2019t always shave with Occam\u2019s Razor \u2014 learning when and how to prune. In: N\u00e9dellec, C., Rouveirol, C. (eds.) ECML 1998. LNCS, vol. 1398, pp. 119\u2013124. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0026680"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/0020-0190(87)90114-1","volume":"24","author":"A Blumer","year":"1987","unstructured":"Blumer, A., Ehrenfeucht, A., Haussler, D., Warmuth, M.K.: Occam\u2019s razor. Inf. Process. Lett. 24, 377\u2013380 (1987)","journal-title":"Inf. Process. Lett."},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/B978-1-55860-377-6.50023-2","volume-title":"Machine Learning Proceedings 1995","author":"William W. Cohen","year":"1995","unstructured":"Cohen, W.W.: Fast effective rule induction. In: Prieditis, A., Russell, S. (eds.) Proceedings of the 12th International Conference on Machine Learning (ML-95), pp. 115\u2013123. Morgan Kaufmann, Lake Tahoe (1995)"},{"issue":"4","key":"2_CR5","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1023\/A:1009868929893","volume":"3","author":"P Domingos","year":"1999","unstructured":"Domingos, P.: The role of Occam\u2019s Razor in knowledge discovery. Data Min. Knowl. Discov. 3(4), 409\u2013425 (1999)","journal-title":"Data Min. Knowl. Discov."},{"issue":"1","key":"2_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2594473.2594475","volume":"15","author":"AA Freitas","year":"2013","unstructured":"Freitas, A.A.: Comprehensible classification models: a position paper. SIGKDD Explor. 15(1), 1\u201310 (2013)","journal-title":"SIGKDD Explor."},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10994-005-5011-x","volume":"58","author":"J F\u00fcrnkranz","year":"2005","unstructured":"F\u00fcrnkranz, J., Flach, P.A.: ROC \u2018n\u2019 rule learning - towards a better understanding of covering algorithms. Mach. Learn. 58(1), 39\u201377 (2005)","journal-title":"Mach. Learn."},{"key":"2_CR8","unstructured":"F\u00fcrnkranz, J., Kliegr, T., Paulheim, H.: On cognitive preferences and the interpretability of rule-based models. arXiv preprint arXiv:1803.01316 (2018)"},{"key":"2_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis","author":"B Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-642-59830-2"},{"key":"2_CR10","unstructured":"Goldstein, D.G., Gigerenzer, G.: The recognition heuristic: how ignorance makes us smart. Simple Heuristics That Make Us Smart, pp. 37\u201358. Oxford (1999)"},{"issue":"1\u20132","key":"2_CR11","first-page":"5","volume":"20","author":"DF Gordon","year":"1995","unstructured":"Gordon, D.F., DesJardins, M.: Evaluation and selection of biases in machine learning. Mach. Learn. 20(1\u20132), 5\u201322 (1995)","journal-title":"Mach. Learn."},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Gr\u00fcnwald, P.D.: The Minimum Description Length Principle. MIT Press, Cambridge (2007)","DOI":"10.7551\/mitpress\/4643.001.0001"},{"key":"2_CR13","volume-title":"\u00dcberfl\u00fcssige Wesenheiten: Occams Rasiermesser","author":"H Hahn","year":"1930","unstructured":"Hahn, H.: \u00dcberfl\u00fcssige Wesenheiten: Occams Rasiermesser. Ver\u00f6ffentlichungen des Vereines Ernst Mach, Wien (1930)"},{"issue":"3","key":"2_CR14","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1016\/j.cognition.2008.06.008","volume":"108","author":"R Hertwig","year":"2008","unstructured":"Hertwig, R., Benz, B., Krauss, S.: The conjunction fallacy and the many meanings of and. Cognition 108(3), 740\u2013753 (2008)","journal-title":"Cognition"},{"issue":"1","key":"2_CR15","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.dss.2010.12.003","volume":"51","author":"J Huysmans","year":"2011","unstructured":"Huysmans, J., Dejaeger, K., Mues, C., Vanthienen, J., Baesens, B.: An empirical evaluation of the comprehensibility of decision table, tree and rule based predictive models. Decis. Support Syst. 51(1), 141\u2013154 (2011)","journal-title":"Decis. Support Syst."},{"issue":"3","key":"2_CR16","doi-asserted-by":"publisher","first-page":"391","DOI":"10.2307\/2182878","volume":"62","author":"JG Kemeny","year":"1953","unstructured":"Kemeny, J.G.: The use of simplicity in induction. Philos. Rev. 62(3), 391\u2013408 (1953)","journal-title":"Philos. Rev."},{"key":"2_CR17","unstructured":"Kliegr, T., Bahn\u00edk, \u0160., F\u00fcrnkranz, J.: A review of possible effects of cognitive biases on interpretation of rule-based machine learning models. arXiv preprint arXiv:1804.02969 (2018)"},{"key":"2_CR18","unstructured":"Kodratoff, Y.: The comprehensibility manifesto. KDD Nuggets, 94(9) (1994)"},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1080\/08839519308949993","volume":"7","author":"I Kononenko","year":"1993","unstructured":"Kononenko, I.: Inductive and Bayesian learning in medical diagnosis. Appl. Artif. Intell. 7, 317\u2013337 (1993)","journal-title":"Appl. Artif. Intell."},{"key":"2_CR20","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-49820-1","volume-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"M Li","year":"2008","unstructured":"Li, M., Vit\u00e1nyi, P.: An Introduction to Kolmogorov Complexity and Its Applications. TCS. Springer, New York (2008). https:\/\/doi.org\/10.1007\/978-0-387-49820-1"},{"key":"2_CR21","unstructured":"Mehta, M., Rissanen, J., Agrawal, R.: MDL-based decision tree pruning. In: Fayyad, U., Uthurusamy, R. (eds.) Proceedings of the 1st International Conference on Knowledge Discovery and Data Mining, pp. 216\u2013221. AAAI Press (1995)"},{"issue":"2","key":"2_CR22","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0004-3702(83)90016-4","volume":"20","author":"RS Michalski","year":"1983","unstructured":"Michalski, R.S.: A theory and methodology of inductive learning. Artif. Intell. 20(2), 111\u2013162 (1983)","journal-title":"Artif. Intell."},{"key":"2_CR23","unstructured":"Michie, D.: Machine learning in the next five years. In: Proceedings of the 3rd European Working Session on Learning (EWSL-88), pp. 107\u2013122. Pitman (1988)"},{"key":"2_CR24","unstructured":"Mitchell, T.M., The need for biases in learning generalizations. Technical report, Computer Science Department, Rutgers University, New Brunswick (1980)"},{"key":"2_CR25","unstructured":"Mitchell, T.M.: Version spaces: a candidate elimination approach to rule learning. In: Reddy, R. (ed.) Proceedings of the 5th International Joint Conference on Artificial Intelligence (IJCAI-77), pp. 305\u2013310. William Kaufmann (1977)"},{"key":"2_CR26","unstructured":"Mitchell, T.M.: Machine Learning. McGraw Hill, New York (1997)"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Muggleton, S.H., Schmid, U., Zeller, C., Tamaddoni-Nezhad, A., Besold, T.: Ultra-strong machine learning: comprehensibility of programs learned with ILP. Mach. Learn. 1\u201322 (2018)","DOI":"10.1007\/s10994-018-5707-3"},{"key":"2_CR28","unstructured":"Munroe, R. Kolmogorov directions. www.xkcd.com , A webcomic of romance, sarcasm, math, and language (2013)"},{"key":"2_CR29","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1613\/jair.41","volume":"1","author":"PM Murphy","year":"1994","unstructured":"Murphy, P.M., Pazzani, M.J.: Exploring the decision forest: an empirical investigation of Occam\u2019s Razor in decision tree induction. J. Artif. Intell. Res. 1, 257\u2013275 (1994)","journal-title":"J. Artif. Intell. Res."},{"key":"2_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/978-3-642-30284-8_44","volume-title":"The Semantic Web: Research and Applications","author":"H Paulheim","year":"2012","unstructured":"Paulheim, H.: Generating possible interpretations for statistics from linked open data. In: Simperl, E., Cimiano, P., Polleres, A., Corcho, O., Presutti, V. (eds.) ESWC 2012. LNCS, vol. 7295, pp. 560\u2013574. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30284-8_44"},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"Paulheim, H., F\u00fcrnkranz, J.: Unsupervised generation of data mining features from linked open data. In: Proceedings of the International Conference on Web Intelligence and Semantics (WIMS\u201912) (2012)","DOI":"10.1145\/2254129.2254168"},{"key":"2_CR32","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/j.eswa.2016.06.009","volume":"62","author":"R Piltaver","year":"2016","unstructured":"Piltaver, R., Lu\u0161trek, M., Gams, M., Martin\u010di\u0107-Ip\u0161i\u0107, S.: What makes classification trees comprehensible? Expert Syst. Appl. 62, 333\u2013346 (2016)","journal-title":"Expert Syst. Appl."},{"key":"2_CR33","volume-title":"Cognitive Illusions: A Handbook on Fallacies and Biases in Thinking, Judgement and Memory","author":"R Pohl","year":"2017","unstructured":"Pohl, R.: Cognitive Illusions: A Handbook on Fallacies and Biases in Thinking, Judgement and Memory, 2nd edn. Psychology Press, London (2017)","edition":"2"},{"issue":"41","key":"2_CR34","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1093\/bjps\/XI.41.32","volume":"11","author":"H Post","year":"1960","unstructured":"Post, H.: Simplicity in scientific theories. Br. J. Philos. Sci. 11(41), 32\u201341 (1960)","journal-title":"Br. J. Philos. Sci."},{"key":"2_CR35","first-page":"239","volume":"5","author":"JR Quinlan","year":"1990","unstructured":"Quinlan, J.R.: Learning logical definitions from relations. Mach. Learn. 5, 239\u2013266 (1990)","journal-title":"Mach. Learn."},{"key":"2_CR36","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J Rissanen","year":"1978","unstructured":"Rissanen, J.: Modeling by shortest data description. Automatica 14, 465\u2013471 (1978)","journal-title":"Automatica"},{"key":"2_CR37","first-page":"153","volume":"10","author":"C Schaffer","year":"1993","unstructured":"Schaffer, C.: Overfitting avoidance as bias. Mach. Learn. 10, 153\u2013178 (1993)","journal-title":"Mach. Learn."},{"key":"2_CR38","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-662-44845-8_8","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"J Stecher","year":"2014","unstructured":"Stecher, J., Janssen, F., F\u00fcrnkranz, J.: Separating rule refinement and rule selection heuristics in inductive rule learning. In: Calders, T., Esposito, F., H\u00fcllermeier, E., Meo, R. (eds.) ECML PKDD 2014. LNCS (LNAI), vol. 8726, pp. 114\u2013129. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44845-8_8"},{"key":"2_CR39","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-319-46307-0_18","volume-title":"Discovery Science","author":"J Stecher","year":"2016","unstructured":"Stecher, J., Janssen, F., F\u00fcrnkranz, J.: Shorter rules are better, aren\u2019t they? In: Calders, T., Ceci, M., Malerba, D. (eds.) DS 2016. LNCS (LNAI), vol. 9956, pp. 279\u2013294. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46307-0_18"},{"issue":"2","key":"2_CR40","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0169-023X(02)00057-5","volume":"42","author":"G Stumme","year":"2002","unstructured":"Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Computing iceberg concept lattices with Titanic. Data Knowl. Eng. 42(2), 189\u2013222 (2002)","journal-title":"Data Knowl. Eng."},{"issue":"2","key":"2_CR41","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1037\/h0031322","volume":"76","author":"A Tversky","year":"1971","unstructured":"Tversky, A., Kahneman, D.: Belief in the law of small numbers. Psychol. Bull. 76(2), 105\u2013110 (1971)","journal-title":"Psychol. Bull."},{"issue":"4157","key":"2_CR42","doi-asserted-by":"publisher","first-page":"1124","DOI":"10.1126\/science.185.4157.1124","volume":"185","author":"A Tversky","year":"1974","unstructured":"Tversky, A., Kahneman, D.: Judgment under uncertainty: heuristics and biases. Science 185(4157), 1124\u20131131 (1974)","journal-title":"Science"},{"issue":"4","key":"2_CR43","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1037\/0033-295X.90.4.293","volume":"90","author":"A Tversky","year":"1983","unstructured":"Tversky, A., Kahneman, D.: Extensional versus intuitive reasoning: the conjunction fallacy in probability judgment. Psychol. Rev. 90(4), 293\u2013315 (1983)","journal-title":"Psychol. Rev."},{"key":"2_CR44","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.eswa.2017.03.041","volume":"81","author":"A Valmarska","year":"2017","unstructured":"Valmarska, A., Lavra\u010d, N., F\u00fcrnkranz, J., Robnik-Sikonja, M.: Refinement and selection heuristics in subgroup discovery and classification rule learning. Expert Syst. Appl. 81, 147\u2013162 (2017)","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"2_CR45","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10618-010-0202-x","volume":"23","author":"J Vreeken","year":"2011","unstructured":"Vreeken, J., van Leeuwen, M., Siebes, A.: Krimp: mining itemsets that compress. Data Min. Knowl. Discov. 23(1), 169\u2013214 (2011)","journal-title":"Data Min. Knowl. Discov."},{"key":"2_CR46","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1093\/comjnl\/11.2.185","volume":"11","author":"CS Wallace","year":"1968","unstructured":"Wallace, C.S., Boulton, D.M.: An information measure for classification. Comput. J. 11, 185\u2013194 (1968)","journal-title":"Comput. J."},{"key":"2_CR47","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1613\/jair.228","volume":"4","author":"GI Webb","year":"1996","unstructured":"Webb, G.I.: Further experimental evidence against the utility of Occam\u2019s razor. J. Artif. Intell. Res. 4, 397\u2013417 (1996)","journal-title":"J. Artif. Intell. Res."},{"key":"2_CR48","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-94-009-7798-3_15","volume-title":"Ordered Sets","author":"R Wille","year":"1982","unstructured":"Wille, R.: Restructuring lattice theory: an approach based on hierarchies of concepts. In: Rival, I. (ed.) Ordered Sets, pp. 445\u2013470. Reidel, Dordrecht-Boston (1982)"},{"key":"2_CR49","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1137\/1.9781611972726.27","volume-title":"Proceedings of the 2002 SIAM International Conference on Data Mining","author":"Mohammed J. Zaki","year":"2002","unstructured":"Zaki, M.J., Hsiao, C.-J.: CHARM: An efficient algorithm for closed itemset mining. In: Grossman, R.L., Han, J., Kumar, V., Mannila, H., Motwani, R. (eds.) Proceedings of the 2nd SIAM International Conference on Data Mining (SDM-02), Arlington (2002)"}],"container-title":["Lecture Notes in Computer Science","Advances in Intelligent Data Analysis XVII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-01768-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T15:33:15Z","timestamp":1768318395000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-01768-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030017675","9783030017682"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-01768-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"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":"\u2018s-Hertogenbosch","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 October 2018","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":"ida2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ida2018.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}