{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T01:30:53Z","timestamp":1772069453283,"version":"3.50.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,11,28]],"date-time":"2022-11-28T00:00:00Z","timestamp":1669593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,28]],"date-time":"2022-11-28T00:00:00Z","timestamp":1669593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s10618-022-00897-2","type":"journal-article","created":{"date-parts":[[2022,11,28]],"date-time":"2022-11-28T11:04:06Z","timestamp":1669633446000},"page":"833-872","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Methods for explaining Top-N recommendations through subgroup discovery"],"prefix":"10.1007","volume":"37","author":[{"given":"Mouloud","family":"Iferroudjene","sequence":"first","affiliation":[]},{"given":"Corentin","family":"Lonjarret","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8583-9408","authenticated-orcid":false,"given":"C\u00e9line","family":"Robardet","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Plantevit","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Atzmueller","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,28]]},"reference":[{"issue":"1","key":"897_CR1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1002\/widm.1144","volume":"5","author":"M Atzmueller","year":"2015","unstructured":"Atzmueller M (2015) Subgroup discovery. WIREs Data Min Knowl Discov 5(1):35\u201349","journal-title":"WIREs Data Min Knowl Discov"},{"key":"897_CR2","doi-asserted-by":"crossref","unstructured":"Atzmueller M, Lemmerich F (2009) Fast subgroup discovery for continuous target concepts. In: Proceedings international symposium on methodologies for intelligent systems, vol 5722, LNCS. Springer, Berlin, pp 1\u201315","DOI":"10.1007\/978-3-642-04125-9_7"},{"key":"897_CR3","doi-asserted-by":"crossref","unstructured":"Atzmueller M, Puppe F (2006) SD-Map: a fast algorithm for exhaustive subgroup discovery. In: Proceedings of PKDD. Springer, pp 6\u201317","DOI":"10.1007\/11871637_6"},{"key":"897_CR4","unstructured":"Bloemheuvel S, Kloepper B, van den Hoogen J, Atzmueller M (2019) Enhancing sequential pattern mining explainability with markov chain probabilities. In: Proceedings of Dutch-Belgian database day, Jheronimus Academy of Data Science, Den Bosch, Netherlands"},{"key":"897_CR5","doi-asserted-by":"crossref","unstructured":"Duivesteijn W, Thaele J (2014) Understanding where your classifier does (not) work: the SCaPE model class for EMM. In: Proceedings of ICDM. IEEE, pp 809\u2013814","DOI":"10.1109\/ICDM.2014.10"},{"key":"897_CR6","unstructured":"Falher GL, Gionis A, Mathioudakis M (2015) Where is the Soho of Rome? measures and algorithms for finding similar neighborhoods in cities. In: Proceedings of the ninth international conference on web and social media, ICWSM 2015, University of Oxford, Oxford, UK, May 26\u201329, 2015, pp 228\u2013237"},{"issue":"1","key":"897_CR7","first-page":"54","volume":"1","author":"P Fournier-Viger","year":"2017","unstructured":"Fournier-Viger P, Lin JC-W, Kiran RU, Koh YS, Thomas R (2017) A survey of sequential pattern mining. Data Sci Pattern Recognit 1(1):54\u201377","journal-title":"Data Sci Pattern Recognit"},{"issue":"4","key":"897_CR8","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1007\/s10994-019-05856-5","volume":"109","author":"J F\u00fcrnkranz","year":"2020","unstructured":"F\u00fcrnkranz J, Kliegr T, Paulheim H (2020) On cognitive preferences and the plausibility of rule-based models. Mach Learn 109(4):853\u2013898","journal-title":"Mach Learn"},{"key":"897_CR9","doi-asserted-by":"crossref","unstructured":"Gulla JA, Zhang L, Liu P, \u00d6zg\u00f6bek O, Su X (2017) The adressa dataset for news recommendation. In: Proceedings of the international conference on web intelligence, WI \u201917, New York, NY, USA. Association for Computing Machinery, pp 1042\u20131048","DOI":"10.1145\/3106426.3109436"},{"key":"897_CR10","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: Proceedings of ACM SIGMOD international conference on management of data. ACM Press, pp 1\u201312","DOI":"10.1145\/335191.335372"},{"issue":"4","key":"897_CR11","first-page":"19:1","volume":"5","author":"FM Harper","year":"2015","unstructured":"Harper FM, Konstan JA (2015) The movielens datasets: history and context. ACM TiiS 5(4):19:1-19:19","journal-title":"ACM TiiS"},{"issue":"5\u20136","key":"897_CR12","doi-asserted-by":"publisher","first-page":"1503","DOI":"10.1007\/s10618-014-0368-8","volume":"28","author":"A Henelius","year":"2014","unstructured":"Henelius A, Puolam\u00e4ki K, Bostr\u00f6m H, Asker L, Papapetrou P (2014) A peek into the black box: exploring classifiers by randomization. Data Min Knowl Discov 28(5\u20136):1503\u20131529","journal-title":"Data Min Knowl Discov"},{"key":"897_CR13","doi-asserted-by":"crossref","unstructured":"Kang W, McAuley JJ (2018) Self-attentive sequential recommendation. In: Proceedings of ICDM. IEEE, pp 197\u2013206","DOI":"10.1109\/ICDM.2018.00035"},{"issue":"1\/2","key":"897_CR14","doi-asserted-by":"publisher","first-page":"81","DOI":"10.2307\/2332226","volume":"30","author":"MG Kendall","year":"1938","unstructured":"Kendall MG (1938) A new measure of rank correlation. Biometrika 30(1\/2):81\u201393","journal-title":"Biometrika"},{"key":"897_CR15","doi-asserted-by":"crossref","unstructured":"Kl\u00f6sgen W (1996) Explora: a multipattern and multistrategy discovery assistant. In: Advances in knowledge discovery and data mining. AAAI, pp 249\u2013271","DOI":"10.1007\/3-540-61286-6_186"},{"key":"897_CR16","doi-asserted-by":"crossref","unstructured":"Lemmerich F, Becker M, Atzmueller M (2012) Generic pattern trees for exhaustive exceptional model mining. In: Proceedings of ECML\/PKDD. Springer, Berlin\/Heidelberg, Germany","DOI":"10.1007\/978-3-642-33486-3_18"},{"issue":"3","key":"897_CR17","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/s10618-015-0436-8","volume":"30","author":"F Lemmerich","year":"2016","unstructured":"Lemmerich F, Atzmueller M, Puppe F (2016) Fast exhaustive subgroup discovery with numerical target concepts. Data Min Knowl Discov 30(3):711\u2013762","journal-title":"Data Min Knowl Discov"},{"key":"897_CR18","doi-asserted-by":"crossref","unstructured":"Lonjarret C, Robardet C, Plantevit M, Auburtin R, Atzmueller M (2020) Why should I trust this item? Explaining the recommendations of any model. In: Webb GI, Zhang Z, Tseng VS, Williams G, Vlachos M, Cao L (eds) 7th IEEE international conference on data science and advanced analytics, DSAA 2020, Sydney, Australia, Oct 6\u20139, 2020. IEEE, pp 526\u2013535","DOI":"10.1109\/DSAA49011.2020.00067"},{"issue":"3","key":"897_CR19","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1007\/s10618-021-00744-w","volume":"35","author":"C Lonjarret","year":"2021","unstructured":"Lonjarret C, Auburtin R, Robardet C, Plantevit M (2021) Sequential recommendation with metric models based on frequent sequences. Data Min Knowl Discov 35(3):1087\u20131133","journal-title":"Data Min Knowl Discov"},{"issue":"1","key":"897_CR20","doi-asserted-by":"publisher","first-page":"3:1","DOI":"10.1145\/1824795.1824798","volume":"43","author":"NR Mabroukeh","year":"2010","unstructured":"Mabroukeh NR, Ezeife CI (2010) A taxonomy of sequential pattern mining algorithms. ACM Comput Surv 43(1):3:1-3:41","journal-title":"ACM Comput Surv"},{"key":"897_CR21","doi-asserted-by":"crossref","unstructured":"Mandel DR (2007) Counterfactual and causal explanation: from early theoretical views to new frontiers. In: The psychology of counterfactual thinking. Routledge, pp 23\u201339","DOI":"10.4324\/9780203963784"},{"key":"897_CR22","doi-asserted-by":"crossref","unstructured":"Mathonat R, Nurbakova D, Boulicaut J, Kaytoue M (2019) Seqscout: using a bandit model to discover interesting subgroups in labeled sequences. In: Proceedings of DSAA, pp 81\u201390","DOI":"10.1109\/DSAA.2019.00022"},{"key":"897_CR23","doi-asserted-by":"crossref","unstructured":"McAuley J, Targett C, Shi Q, van\u00a0den Hengel A (2015) Image-based recommendations on styles and substitutes. In: Proceedings of SIGIR. ACM, pp 43\u201352","DOI":"10.1145\/2766462.2767755"},{"issue":"2","key":"897_CR24","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10462-005-4612-x","volume":"24","author":"D McSherry","year":"2005","unstructured":"McSherry D (2005) Explanation in recommender systems. Artif Intell Rev 24(2):179\u2013197","journal-title":"Artif Intell Rev"},{"key":"897_CR25","unstructured":"Mollenhauer D, Atzmueller M (2020) Sequential exceptional pattern discovery using pattern-growth: an extensible framework for interpretable machine learning on sequential data. In: International workshop on explainable and interpretable machine learning. CEUR-WS.org, vol 2796"},{"key":"897_CR26","unstructured":"Pei J, Han J, Mortazavi-Asl B, Pinto H, Chen Q, Dayal U, Hsu M (2001) Prefixspan: mining sequential patterns by prefix-projected growth. In: Young DC (ed) Proceedings of international conference on data engineering, Los Alamitos. IEEE, pp 215\u2013224"},{"issue":"11","key":"897_CR27","doi-asserted-by":"publisher","first-page":"1424","DOI":"10.1109\/TKDE.2004.77","volume":"16","author":"J Pei","year":"2004","unstructured":"Pei J, Han J, Mortazavi-Asl B, Wang J, Pinto H, Chen Q, Dayal U, Hsu M (2004) Mining sequential patterns by pattern-growth: the prefixspan approach. IEEE Trans Knowl Data Eng 16(11):1424\u20131440","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"897_CR28","doi-asserted-by":"crossref","unstructured":"Pope PE, Kolouri S, Rostami M, Martin CE, Hoffmann H (2019) Explainability methods for graph convolutional neural networks. In: Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition, pp 10772\u201310781","DOI":"10.1109\/CVPR.2019.01103"},{"key":"897_CR29","doi-asserted-by":"crossref","unstructured":"Pu P, Chen L (2006) Trust building with explanation interfaces. In: Proceedings of IUI, pp 93\u2013100","DOI":"10.1145\/1111449.1111475"},{"key":"897_CR30","doi-asserted-by":"crossref","unstructured":"Ribeiro MT, Singh S, Guestrin C (2016) \u201cWhy should I trust you?\u201d Explaining the predictions of any classifier. In: Proceedings of KDD, pp 1135\u20131144","DOI":"10.1145\/2939672.2939778"},{"key":"897_CR31","doi-asserted-by":"crossref","unstructured":"Ribeiro MT, Singh S, Guestrin C (2018) Anchors: high-precision model-agnostic explanations. In: Proceedings of AAAI","DOI":"10.1609\/aaai.v32i1.11491"},{"key":"897_CR32","doi-asserted-by":"crossref","unstructured":"Roth-Berghofer TR, Cassens J (2005) Mapping goals and kinds of explanations to the knowledge containers of case-based reasoning systems. In: Proceedings of ICCBR, number 3620 in LNAI. Springer, Berlin, pp 451\u2013464","DOI":"10.1007\/11536406_35"},{"issue":"4","key":"897_CR33","first-page":"122","volume":"28","author":"T Roth-Berghofer","year":"2007","unstructured":"Roth-Berghofer T, Schulz S, Leake D, Bahls D (2007) Explanation-aware computing. AI Mag 28(4):122","journal-title":"AI Mag"},{"key":"897_CR34","volume-title":"Explanation patterns: understanding mechanically and creatively","author":"RC Schank","year":"1986","unstructured":"Schank RC (1986) Explanation patterns: understanding mechanically and creatively. Lawrence Erlbaum Associates, Hillsdale"},{"issue":"2","key":"897_CR35","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s10462-005-4607-7","volume":"24","author":"F S\u00f8rmo","year":"2005","unstructured":"S\u00f8rmo F, Cassens J, Aamodt A (2005) Explanation in case-based reasoning: perspectives and goals. Artif Intell Rev 24(2):109\u2013143","journal-title":"Artif Intell Rev"},{"key":"897_CR36","doi-asserted-by":"crossref","unstructured":"Tang J, Wang K (2018) Personalized top-n sequential recommendation via convolutional sequence embedding. In: Proceedings of the eleventh ACM international conference on web search and data mining, WSDM \u201918, New York, NY, USA. ACM, pp 565\u2013573","DOI":"10.1145\/3159652.3159656"},{"key":"897_CR37","doi-asserted-by":"crossref","unstructured":"Tintarev N, Masthoff J (2011) Designing and evaluating explanations for recommender systems. In: Recommender systems handbook. Springer, pp 479\u2013510","DOI":"10.1007\/978-0-387-85820-3_15"},{"key":"897_CR38","doi-asserted-by":"crossref","unstructured":"Tolomei G, Silvestri F, Haines A, Lalmas M (2017) Interpretable predictions of tree-based ensembles via actionable feature tweaking. In: Proceedings of KDD. ACM, pp 465\u2013474","DOI":"10.1145\/3097983.3098039"},{"issue":"1\u20132","key":"897_CR39","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0004-3702(92)90087-E","volume":"54","author":"MR Wick","year":"1992","unstructured":"Wick MR, Thompson WB (1992) Reconstructive expert system explanation. Artif Intell 54(1\u20132):33\u201370","journal-title":"Artif Intell"},{"key":"897_CR40","doi-asserted-by":"crossref","unstructured":"Wrobel S (1997) An algorithm for multi-relational discovery of subgroups. In: Proceedings of PKDD, number 1263 in LNCS, Berlin\/Heidelberg, Germany. Springer, pp 78\u201387","DOI":"10.1007\/3-540-63223-9_108"},{"issue":"1\u20132","key":"897_CR41","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1023\/A:1007652502315","volume":"42","author":"MJ Zaki","year":"2001","unstructured":"Zaki MJ (2001) Spade: an efficient algorithm for mining frequent sequences. Mach Learn 42(1\u20132):31\u201360","journal-title":"Mach Learn"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-022-00897-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-022-00897-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-022-00897-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,24]],"date-time":"2023-02-24T11:32:05Z","timestamp":1677238325000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-022-00897-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,28]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["897"],"URL":"https:\/\/doi.org\/10.1007\/s10618-022-00897-2","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,28]]},"assertion":[{"value":"30 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 November 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}