{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T20:54:14Z","timestamp":1786136054359,"version":"3.56.0"},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2023,9,20]],"date-time":"2023-09-20T00:00:00Z","timestamp":1695168000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,9,20]],"date-time":"2023-09-20T00:00:00Z","timestamp":1695168000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["438445824"],"award-info":[{"award-number":["438445824"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["438445824"],"award-info":[{"award-number":["438445824"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005722","name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100005722","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2023,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Explainable artificial intelligence has mainly focused on static learning scenarios so far. We are interested in dynamic scenarios where data is sampled progressively, and learning is done in an incremental rather than a batch mode. We seek efficient incremental algorithms for computing feature importance (FI). Permutation feature importance (PFI) is a well-established model-agnostic measure to obtain global FI based on feature marginalization of absent features. We propose an efficient, model-agnostic algorithm called iPFI to estimate this measure incrementally and under dynamic modeling conditions including concept drift. We prove theoretical guarantees on the approximation quality in terms of expectation and variance. To validate our theoretical findings and the efficacy of our approaches in incremental scenarios dealing with streaming data rather than traditional batch settings, we conduct multiple experimental studies on benchmark data with and without concept drift.<\/jats:p>","DOI":"10.1007\/s10994-023-06385-y","type":"journal-article","created":{"date-parts":[[2023,9,20]],"date-time":"2023-09-20T17:01:45Z","timestamp":1695229305000},"page":"4863-4903","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":51,"title":["Incremental permutation feature importance (iPFI): towards online explanations on data streams"],"prefix":"10.1007","volume":"112","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3955-3510","authenticated-orcid":false,"given":"Fabian","family":"Fumagalli","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6921-0204","authenticated-orcid":false,"given":"Maximilian","family":"Muschalik","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9944-4108","authenticated-orcid":false,"given":"Eyke","family":"H\u00fcllermeier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0935-5591","authenticated-orcid":false,"given":"Barbara","family":"Hammer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,9,20]]},"reference":[{"key":"6385_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103502","volume":"298","author":"K Aas","year":"2021","unstructured":"Aas, K., Jullum, M., & L\u00f8land, A. (2021). Explaining individual predictions when features are dependent: More accurate approximations to Shapley values. Artificial Intelligence, 298, 103502. https:\/\/doi.org\/10.1016\/j.artint.2021.103502","journal-title":"Artificial Intelligence"},{"key":"6385_CR2","doi-asserted-by":"publisher","first-page":"52138","DOI":"10.1109\/ACCESS.2018.2870052","volume":"6","author":"A Adadi","year":"2018","unstructured":"Adadi, A., & Berrada, M. (2018). Peeking inside the black-box: A survey on explainable artificial intelligence (XAI). IEEE Access, 6, 52138\u201352160. https:\/\/doi.org\/10.1109\/ACCESS.2018.2870052","journal-title":"IEEE Access"},{"issue":"6","key":"6385_CR3","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1109\/69.250074","volume":"5","author":"R Agrawal","year":"1993","unstructured":"Agrawal, R., Imielinski, T., & Swami, A. (1993). Database mining: A performance perspective. IEEE Transactions on Knowledge and Data Engineering, 5(6), 914\u2013925. https:\/\/doi.org\/10.1109\/69.250074","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"10","key":"6385_CR4","doi-asserted-by":"publisher","first-page":"1340","DOI":"10.1093\/bioinformatics\/btq134","volume":"26","author":"A Altmann","year":"2010","unstructured":"Altmann, A., Tolo\u015fi, L., Sander, O., & Lengauer, T. (2010). Permutation importance: A corrected feature importance measure. Bioinformatics, 26(10), 1340\u20131347. https:\/\/doi.org\/10.1093\/bioinformatics\/btq134","journal-title":"Bioinformatics"},{"issue":"4","key":"6385_CR5","doi-asserted-by":"publisher","first-page":"2249","DOI":"10.1016\/j.csda.2007.08.015","volume":"52","author":"KJ Archer","year":"2008","unstructured":"Archer, K. J., & Kimes, R. V. (2008). Empirical characterization of random forest variable importance measures. Computational Statistics & Data Analysis, 52(4), 2249\u20132260. https:\/\/doi.org\/10.1016\/j.csda.2007.08.015","journal-title":"Computational Statistics & Data Analysis"},{"issue":"7","key":"6385_CR6","doi-asserted-by":"publisher","first-page":"0130140","DOI":"10.1371\/journal.pone.0130140","volume":"10","author":"S Bach","year":"2015","unstructured":"Bach, S., Binder, A., Montavon, G., Klauschen, F., M\u00fcller, K.-R., & Samek, W. (2015). On pixel-wise explanations for non-linear classifier decisions by layer-wise relevance propagation. PloS one, 10(7), 0130140. https:\/\/doi.org\/10.1371\/journal.pone.0130140","journal-title":"PloS one"},{"issue":"3","key":"6385_CR7","doi-asserted-by":"publisher","first-page":"1405","DOI":"10.1002\/widm.1405","volume":"11","author":"M Bahri","year":"2021","unstructured":"Bahri, M., Bifet, A., Gama, J., Gomes, H. M., & Maniu, S. (2021). Data stream analysis: Foundations, major tasks and tools. Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, 11(3), 1405. https:\/\/doi.org\/10.1002\/widm.1405","journal-title":"Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery"},{"key":"6385_CR8","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.is.2019.02.003","volume":"83","author":"JP Barddal","year":"2019","unstructured":"Barddal, J. P., Enembreck, F., Gomes, H. M., Bifet, A., & Pfahringer, B. (2019). Boosting decision stumps for dynamic feature selection on data streams. Information Systems, 83, 13\u201329. https:\/\/doi.org\/10.1016\/j.is.2019.02.003","journal-title":"Information Systems"},{"key":"6385_CR9","doi-asserted-by":"publisher","unstructured":"Bifet, A., Gavald\u00e0, R. (2009). Adaptive learning from evolving data streams. In Advances in intelligent data analysis VIII, 8th international symposium on intelligent data analysis (IDA 2009), pp. 249\u2013260 . https:\/\/doi.org\/10.1007\/978-3-642-03915-7_22.","DOI":"10.1007\/978-3-642-03915-7_22"},{"issue":"1","key":"6385_CR10","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman, L. (2001). Random forests. Machine Learning, 45(1), 5\u201332. https:\/\/doi.org\/10.1023\/A:1010933404324","journal-title":"Machine Learning"},{"issue":"1","key":"6385_CR11","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1093\/bib\/bbq011","volume":"12","author":"ML Calle","year":"2011","unstructured":"Calle, M. L., & Urrea, V. (2011). Letter to the editor: Stability of random forest importance measures. Briefings in Bioinformatics, 12(1), 86\u201389. https:\/\/doi.org\/10.1093\/bib\/bbq011","journal-title":"Briefings in Bioinformatics"},{"key":"6385_CR12","doi-asserted-by":"publisher","unstructured":"Casalicchio, G., Molnar, C., Bischl, B. (2018). Visualizing the feature importance for black box models. In Proceedings of machine learning and knowledge discovery in databases - European conference, (ECML PKDD 2018), pp. 655\u2013670. https:\/\/doi.org\/10.1007\/978-3-030-10925-7_40","DOI":"10.1007\/978-3-030-10925-7_40"},{"key":"6385_CR13","doi-asserted-by":"publisher","unstructured":"Cassidy, A. P., Deviney, F. A. (2014). Calculating feature importance in data streams with concept drift using online random forest. In 2014 IEEE international conference on big data (Big Data 2014), pp. 23\u201328 . https:\/\/doi.org\/10.1109\/BigData.2014.7004352.","DOI":"10.1109\/BigData.2014.7004352"},{"key":"6385_CR14","unstructured":"Chen, H., Janizek, J. D., Lundberg, S. M., Lee, S. (2020). True to the model or true to the data? CoRR arXiv:abs\/2006.16234"},{"key":"6385_CR15","unstructured":"Covert, I., Lee, S.-I. (2021). Improving kernelshap: Practical shapley value estimation using linear regression. In Proceedings of international conference on artificial intelligence and statistics (AISTATS 2021), pp. 3457\u20133465."},{"key":"6385_CR16","unstructured":"Covert, I., Lundberg, S. M., Lee, S. -I. (2020). Understanding global feature contributions with additive importance measures. In Proceedings of international conference on neural information processing systems (NeurIPS 2020), pp. 17212\u201317223."},{"issue":"209","key":"6385_CR17","first-page":"1","volume":"22","author":"I Covert","year":"2021","unstructured":"Covert, I., Lundberg, S., & Lee, S.-I. (2021). Explaining by removing: A unified framework for model explanation. Journal of Machine Learning Research, 22(209), 1\u201390.","journal-title":"Journal of Machine Learning Research"},{"key":"6385_CR18","doi-asserted-by":"publisher","unstructured":"de Souza, V. M. A., dos Reis, D. M., Maletzke, A. G., Batista, G. E. A. P. A. (2020). Challenges in benchmarking stream learning algorithms with real-world data. Data Mining and Knowledge Discovery, 34(6), 1805\u20131858 . https:\/\/doi.org\/10.1007\/s10618-020-00698-5.","DOI":"10.1007\/s10618-020-00698-5"},{"key":"6385_CR19","unstructured":"Doshi-Velez, F., Kim, B. (2017). Towards a rigorous science of interpretable machine learning . https:\/\/arxiv.org\/abs\/1702.08608"},{"issue":"2","key":"6385_CR20","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s13748-013-0040-3","volume":"2","author":"H Fanaee-T","year":"2014","unstructured":"Fanaee-T, H., & Gama, J. (2014). Event labeling combining ensemble detectors and background knowledge. Progress in Artificial Intelligence, 2(2), 113\u2013127. https:\/\/doi.org\/10.1007\/s13748-013-0040-3","journal-title":"Progress in Artificial Intelligence"},{"key":"6385_CR21","unstructured":"Feurer, M., van Rijn, J.N., Kadra, A., Gijsbers, P., Mallik, N., Ravi, S., Mueller, A., Vanschoren, J., Hutter, F. (2020). OpenML-python: An extensible python API for OpenML . https:\/\/arxiv.org\/abs\/1911.02490."},{"issue":"177","key":"6385_CR22","first-page":"1","volume":"20","author":"A Fisher","year":"2019","unstructured":"Fisher, A., Rudin, C., & Dominici, F. (2019). All models are wrong, but many are useful: Learning a Variable\u2019s importance by studying an entire class of prediction models simultaneously. Journal of Machine Learning Research, 20(177), 1\u201381.","journal-title":"Journal of Machine Learning Research"},{"issue":"5","key":"6385_CR23","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1214\/aos\/1013203451","volume":"29","author":"JH Friedman","year":"2001","unstructured":"Friedman, J. H. (2001). Greedy function approximation: A gradient boosting machine. The Annals of Statistics, 29(5), 1189\u20131232. https:\/\/doi.org\/10.1214\/aos\/1013203451","journal-title":"The Annals of Statistics"},{"key":"6385_CR24","unstructured":"Frye, C., Mijolla, D. D., Begley, T., Cowton, L., Stanley, M., Feige, I. (2021). Shapley explainability on the data manifold. In International conference on learning representations (ICLR 2021). https:\/\/openreview.net\/forum?id=OPyWRrcjVQw."},{"key":"6385_CR25","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.jpdc.2019.07.007","volume":"134","author":"E Garc\u00eda-Mart\u00edn","year":"2019","unstructured":"Garc\u00eda-Mart\u00edn, E., Rodrigues, C. F., Riley, G., & Grahn, H. (2019). Estimation of energy consumption in machine learning. Journal of Parallel and Distributed Computing, 134, 75\u201388. https:\/\/doi.org\/10.1016\/j.jpdc.2019.07.007","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"6385_CR26","doi-asserted-by":"crossref","unstructured":"Gomes, H. M., Mello, R. F. D., Pfahringer, B., Bifet, A. (2019). Feature scoring using tree-based ensembles for evolving data streams. In 2019 IEEE international conference on big data (Big Data 2019), pp. 761\u2013769.","DOI":"10.1109\/BigData47090.2019.9006366"},{"issue":"9","key":"6385_CR27","doi-asserted-by":"publisher","first-page":"1469","DOI":"10.1007\/s10994-017-5f642-8","volume":"106","author":"HM Gomes","year":"2017","unstructured":"Gomes, H. M., Bifet, A., Read, J., Barddal, J. P., Enembreck, F., Pfharinger, B., Holmes, G., & Abdessalem, T. (2017). Adaptive random forests for evolving data stream classification. Machine Learning, 106(9), 1469\u20131495. https:\/\/doi.org\/10.1007\/s10994-017-5f642-8","journal-title":"Machine Learning"},{"key":"6385_CR28","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.csda.2015.04.002","volume":"90","author":"B Gregorutti","year":"2015","unstructured":"Gregorutti, B., Michel, B., & Saint-Pierre, P. (2015). Grouped variable importance with random forests and application to multiple functional data analysis. Computational Statistics & Data Analysis, 90, 15\u201335. https:\/\/doi.org\/10.1016\/j.csda.2015.04.002","journal-title":"Computational Statistics & Data Analysis"},{"issue":"3","key":"6385_CR29","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1007\/s11222-016-9646-1","volume":"27","author":"B Gregorutti","year":"2017","unstructured":"Gregorutti, B., Michel, B., & Saint-Pierre, P. (2017). Correlation and variable importance in random forests. Statistics and Computing, 27(3), 659\u2013678. https:\/\/doi.org\/10.1007\/s11222-016-9646-1","journal-title":"Statistics and Computing"},{"issue":"1","key":"6385_CR30","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s11222-012-9349-1","volume":"24","author":"A Hapfelmeier","year":"2014","unstructured":"Hapfelmeier, A., Hothorn, T., Ulm, K., & Strobl, C. (2014). A new variable importance measure for random forests with missing data. Statistics and Computing, 24(1), 21\u201334. https:\/\/doi.org\/10.1007\/s11222-012-9349-1","journal-title":"Statistics and Computing"},{"key":"6385_CR31","unstructured":"Harries, M. (1999). Splice-2 comparative evaluation: Electricity pricing. Technical report, The University of South Wales."},{"key":"6385_CR32","doi-asserted-by":"crossref","unstructured":"Haug, J., Braun, A., Z\u00fcrn, S., Kasneci, G. (2022). Change detection for local explainability in evolving data streams. In Proceedings of the 31st ACM international conference on information and knowledge management (CIKM 2022), pp. 706\u2013716.","DOI":"10.1145\/3511808.3557257"},{"issue":"3","key":"6385_CR33","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-1-4612-0919-5_20","volume":"19","author":"W Hoeffding","year":"1948","unstructured":"Hoeffding, W. (1948). A class of statistics with asymptotically normal distribution. The Annals of Mathematical Statistics, 19(3), 293\u2013325. https:\/\/doi.org\/10.1007\/978-1-4612-0919-5_20","journal-title":"The Annals of Mathematical Statistics"},{"key":"6385_CR34","unstructured":"Hooker, G., Mentch, L., Zhou, S. (2019). Unrestricted permutation forces extrapolation: Variable importance requires at least one more model, or there is no free variable importance. https:\/\/arxiv.org\/abs\/1905.03151"},{"key":"6385_CR35","unstructured":"Janzing, D., Minorics, L., Bloebaum, P. (2020). Feature relevance quantification in explainable AI: A causal problem. In Proceedings of international conference on artificial intelligence and statistics (AISTATS 2020), pp. 2907\u20132916."},{"key":"6385_CR36","unstructured":"Jethani, N., Sudarshan, M., Covert, I. C., Lee, S.-I., Ranganath, R. (2021). Fastshap: Real-time shapley value estimation. In Proceedings of international conference on learning representations (ICLR 2021)."},{"key":"6385_CR37","unstructured":"Ke, G., Meng, Q., Finley, T., Wang, T., Chen, W., Ma, W., Ye, Q., Liu, T.-Y. (2017). Lightgbm: A highly efficient gradient boosting decision tree. In Proceedings of international conference on neural information processing system (NeurIPS 2017)."},{"key":"6385_CR38","unstructured":"Kohavi, R. (1996). Scaling up the accuracy of Naive\u2013Bayes classifiers: A decision-tree hybrid. In Proceedings of international conference on knowledge discovery and data mining (KDD 1996), pp. 202\u2013207."},{"key":"6385_CR39","doi-asserted-by":"crossref","unstructured":"K\u00f6nig, G., Molnar, C., Bischl, B., Grosse-Wentrup, M. (2021). Relative feature importance. In Proceedings of international conference on pattern recognition (ICPR 2021), pp. 9318\u20139325.","DOI":"10.1109\/ICPR48806.2021.9413090"},{"key":"6385_CR40","doi-asserted-by":"publisher","first-page":"1261","DOI":"10.1016\/j.neucom.2017.06.084","volume":"275","author":"V Losing","year":"2018","unstructured":"Losing, V., Hammer, B., & Wersing, H. (2018). Incremental on-line learning: A review and comparison of state of the art algorithms. Neurocomputing, 275, 1261\u20131274. https:\/\/doi.org\/10.1016\/j.neucom.2017.06.084","journal-title":"Neurocomputing"},{"key":"6385_CR41","unstructured":"Lundberg, S. M., Lee, S.-I. (2017). A unified approach to interpreting model predictions. In Proceedings of international conference on neural information processing systems (NeurIPS 2017), pp. 4768\u20134777."},{"issue":"1","key":"6385_CR42","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1038\/s42256-019-0138-9","volume":"2","author":"SM Lundberg","year":"2020","unstructured":"Lundberg, S. M., Erion, G., Chen, H., DeGrave, A., Prutkin, J. M., Nair, B., Katz, R., Himmelfarb, J., Bansal, N., & Lee, S.-I. (2020). From local explanations to global understanding with explainable AI for trees. Nature Machine Intelligence, 2(1), 56\u201367. https:\/\/doi.org\/10.1038\/s42256-019-0138-9","journal-title":"Nature Machine Intelligence"},{"key":"6385_CR43","unstructured":"Molnar, C., K\u00f6nig, G., Bischl, B., Casalicchio, G. (2020). Model-agnostic feature importance and effects with dependent features: A conditional subgroup approach."},{"key":"6385_CR44","unstructured":"Montiel, J., Halford, M., Mastelini, S. M., Bolmier, G., Sourty, R., Vaysse, R., Zouitine, A., Gomes, H. M., Read, J., Abdessalem, T., Bifet, A. (2020). River: Machine learning for streaming data in Python. https:\/\/arxiv.org\/abs\/2012.04740."},{"key":"6385_CR45","unstructured":"Moro, S., Laureano, R. M. S., Cortez, P. (2011). Using data mining for bank direct marketing: An application of the CRISP-DM methodology. In Proceedings of the European simulation and modelling conference (ESM 2011)."},{"key":"6385_CR46","doi-asserted-by":"publisher","DOI":"10.1007\/s13218-022-00766-6","author":"M Muschalik","year":"2022","unstructured":"Muschalik, M., Fumagalli, F., Hammer, B., & H\u00fcllermeier, E. (2022). Agnostic explanation of model change based on feature importance. KI - K\u00fcnstliche Intelligenz. https:\/\/doi.org\/10.1007\/s13218-022-00766-6","journal-title":"KI - K\u00fcnstliche Intelligenz"},{"key":"6385_CR47","volume-title":"Production and operations analysis","author":"S Nahmias","year":"2015","unstructured":"Nahmias, S., & Olsen, T. L. (2015). Production and operations analysis. Illinois: Waveland Press."},{"key":"6385_CR48","unstructured":"Paszke, A., Gross, S., Chintala, S., Chanan, G., Yang, E., DeVito, Z., Lin, Z., Desmaison, A., Antiga, L., Lerer, A. (2017). Automatic differentiation in pytorch. In NIPS 2017 workshop on autodiff."},{"key":"6385_CR49","doi-asserted-by":"publisher","first-page":"2825","DOI":"10.5555\/1953048.2078195","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Prettenhofer, P., Weiss, R., Dubourg, V., Vanderplas, J., Passos, A., Cournapeau, D., Brucher, M., Perrot, M., & Duchesnay, E. (2011). Scikit-learn: Machine learning in python. Journal of Machine Learning Research, 12, 2825\u20132830. https:\/\/doi.org\/10.5555\/1953048.2078195","journal-title":"Journal of Machine Learning Research"},{"key":"6385_CR50","unstructured":"R\u00e9nyi, A. (1961). On measures of entropy and information. In Proceedings of the fourth Berkeley symposium on mathematical statistics and probability, volume 1: Contributions to the theory of statistics, pp. 547\u2013562."},{"key":"6385_CR51","doi-asserted-by":"crossref","unstructured":"Ribeiro, M. T., Singh, S., Guestrin, C. (2016). \"Why Should I Trust You?\": Explaining the predictions of any classifier. In Proceedings of international conference on knowledge discovery and data mining (KDD 2016), pp. 1135\u20131144.","DOI":"10.18653\/v1\/N16-3020"},{"issue":"3","key":"6385_CR52","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/BF00116895","volume":"1","author":"JC Schlimmer","year":"1986","unstructured":"Schlimmer, J. C., & Granger, R. H. (1986). Incremental learning from noisy data. Machine Learning, 1(3), 317\u2013354. https:\/\/doi.org\/10.1007\/BF00116895","journal-title":"Machine Learning"},{"issue":"3","key":"6385_CR53","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1023\/A:1022810614389","volume":"1","author":"JC Schlimmer","year":"1986","unstructured":"Schlimmer, J. C., & Granger, R. H. (1986). Incremental learning from noisy data. Machine Learning, 1(3), 317\u2013354. https:\/\/doi.org\/10.1023\/A:1022810614389","journal-title":"Machine Learning"},{"key":"6385_CR54","doi-asserted-by":"crossref","unstructured":"Selvaraju, R. R., Cogswell, M., Das, A., Vedantam, R., Parikh, D., Batra, D. (2017). Grad-cam: Visual explanations from deep networks via gradient-based localization. In: Proceedings of the IEEE international conference on computer vision (ICCV 2017), pp. 618\u2013626.","DOI":"10.1109\/ICCV.2017.74"},{"key":"6385_CR55","doi-asserted-by":"crossref","unstructured":"Shapley, L. S. (1953). A value for n-person games, volume IIContributions to the Theory of Games (AM-28) (pp. 307\u2013318). New Jersey, USA: Princeton University Press.","DOI":"10.1515\/9781400881970-018"},{"issue":"1","key":"6385_CR56","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1186\/1471-2105-8-25","volume":"8","author":"C Strobl","year":"2007","unstructured":"Strobl, C., Boulesteix, A.-L., Zeileis, A., & Hothorn, T. (2007). Bias in random forest variable importance measures: Illustrations, sources and a solution. BMC Bioinformatics, 8(1), 25. https:\/\/doi.org\/10.1186\/1471-2105-8-25","journal-title":"BMC Bioinformatics"},{"issue":"1","key":"6385_CR57","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1186\/1471-2105-9-307","volume":"9","author":"C Strobl","year":"2008","unstructured":"Strobl, C., Boulesteix, A.-L., Kneib, T., Augustin, T., & Zeileis, A. (2008). Conditional variable importance for random forests. BMC Bioinformatics, 9(1), 307. https:\/\/doi.org\/10.1186\/1471-2105-9-307","journal-title":"BMC Bioinformatics"},{"key":"6385_CR58","unstructured":"Turkay, C., Pezzotti, N., Binnig, C., Strobelt, H., Hammer, B., Keim, D. A., Fekete, J.-D., Palpanas, T., Wang, Y., Rusu, F. (2018). Progressive data science: Potential and challenges . https:\/\/arxiv.org\/abs\/1812.08032"},{"issue":"1","key":"6385_CR59","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.ipl.2005.11.003","volume":"11","author":"JS Vitter","year":"1985","unstructured":"Vitter, J. S. (1985). Random sampling with a reservoir. ACM Transactions on Mathematical Software, 11(1), 37\u201357. https:\/\/doi.org\/10.1016\/j.ipl.2005.11.003","journal-title":"ACM Transactions on Mathematical Software"},{"issue":"1","key":"6385_CR60","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1186\/s12859-016-0900-5","volume":"17","author":"H Wang","year":"2016","unstructured":"Wang, H., Yang, F., & Luo, Z. (2016). An experimental study of the intrinsic stability of random forest variable importance measures. BMC Bioinformatics, 17(1), 60.","journal-title":"BMC Bioinformatics"},{"key":"6385_CR61","doi-asserted-by":"crossref","unstructured":"Wastensteiner, J., Weiss, T. M., Haag, F., Hopf, K. (2021). Explainable AI for tailored electricity consumption feedback: An experimental evaluation of visualizations. In European conference on information systems (ECIS 2021), vol. 55.","DOI":"10.20378\/irb-49912"},{"key":"6385_CR62","doi-asserted-by":"crossref","unstructured":"Yuan, L., Pfahringer, B., Barddal, J. P. (2018). Iterative subset selection for feature drifting data streams. In Proceedings of the 33rd annual ACM symposium on applied computing, pp. 510\u2013517.","DOI":"10.1145\/3167132.3167188"},{"issue":"512","key":"6385_CR63","doi-asserted-by":"publisher","first-page":"1770","DOI":"10.1080\/01621459.2015.1036994","volume":"110","author":"R Zhu","year":"2015","unstructured":"Zhu, R., Zeng, D., & Kosorok, M. R. (2015). Reinforcement learning trees. Journal of the American Statistical Association, 110(512), 1770\u20131784. https:\/\/doi.org\/10.1080\/01621459.2015.1036994","journal-title":"Journal of the American Statistical Association"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-023-06385-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-023-06385-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-023-06385-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T18:06:34Z","timestamp":1700071594000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-023-06385-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,20]]},"references-count":63,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["6385"],"URL":"https:\/\/doi.org\/10.1007\/s10994-023-06385-y","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,20]]},"assertion":[{"value":"5 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 July 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 September 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have the following conflicts regarding the editorial board of the Machine Learning Journal and the journal track chair of the ECML-PKDD 2023: Willem Waegeman","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}},{"value":"The authors approve that this submission does not raise any potential ethical concerns.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"All authors agreed with the content and all gave explicit consent to submit. Moreover, the authors obtained consent from the responsible authorities at the institute\/organization where the work has been carried out, before the work was submitted. Finally, the authors consent that at least one author will participate at the ECML-PKDD 2023 in case of acceptance.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"All authors consent to publish an individual\u2019s data or image, if this is required.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}