{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,5]],"date-time":"2026-11-05T23:48:41Z","timestamp":1793922521489,"version":"4.8.0"},"reference-count":43,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003995","name":"Anhui Provincial Natural Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003995","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Neurocomputing"],"published-print":{"date-parts":[[2026,11]]},"DOI":"10.1016\/j.neucom.2026.134643","type":"journal-article","created":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T15:16:44Z","timestamp":1785424604000},"page":"134643","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Plausible and robust counterfactual explanation via local distribution consistency"],"prefix":"10.1016","volume":"702","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-6611-1075","authenticated-orcid":false,"given":"Yu","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-3768-2610","authenticated-orcid":false,"given":"Yunyun","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiuwen","family":"Sun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3607-0022","authenticated-orcid":false,"given":"Peng","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"8","key":"10.1016\/j.neucom.2026.134643_bib0005","doi-asserted-by":"crossref","first-page":"832","DOI":"10.3390\/electronics8080832","article-title":"Machine learning interpretability: a survey on methods and metrics","volume":"8","author":"Carvalho","year":"2019","journal-title":"Electronics"},{"key":"10.1016\/j.neucom.2026.134643_bib0010","doi-asserted-by":"crossref","DOI":"10.1016\/j.neucom.2025.130809","article-title":"An investigation into creating counterfactual examples for non-linear support vector machines","author":"Bergamin","year":"2025","journal-title":"Neurocomputing"},{"issue":"1","key":"10.1016\/j.neucom.2026.134643_bib0015","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s12559-023-10179-8","article-title":"Interpreting black-box models: a review on explainable artificial intelligence","volume":"16","author":"Hassija","year":"2024","journal-title":"Cogn. Comput."},{"key":"10.1016\/j.neucom.2026.134643_bib0020","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.inffus.2019.12.012","article-title":"Explainable artificial intelligence (XAI): concepts, taxonomies, opportunities and challenges toward responsible AI","volume":"58","author":"Arrieta","year":"2020","journal-title":"Inf. Fusion"},{"issue":"8","key":"10.1016\/j.neucom.2026.134643_bib0025","doi-asserted-by":"crossref","DOI":"10.1007\/s11432-023-3974-2","article-title":"Learning-based counterfactual explanations for recommendation","volume":"67","author":"Wen","year":"2024","journal-title":"Sci. China Inf. Sci."},{"key":"10.1016\/j.neucom.2026.134643_bib0030","first-page":"841","article-title":"Counterfactual explanations without opening the black box: automated decisions and the GDPR","volume":"31","author":"Wachter","year":"2017","journal-title":"Harv. JL Tech."},{"key":"10.1016\/j.neucom.2026.134643_bib0035","article-title":"Explanations based on the missing: towards contrastive explanations with pertinent negatives","volume":"31","author":"Dhurandhar","year":"2018","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.neucom.2026.134643_bib0040","series-title":"Proceedings of the AAAI Conference on Artificial Intelligence","first-page":"5313","article-title":"FOCUS: flexible optimizable counterfactual explanations for tree ensembles","volume":"vol. 36","author":"Lucic","year":"2022"},{"key":"10.1016\/j.neucom.2026.134643_bib0045","series-title":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","first-page":"394","article-title":"Generating robust counterfactual explanations","author":"Guyomard","year":"2023"},{"key":"10.1016\/j.neucom.2026.134643_bib0050","series-title":"International Conference on Machine Learning","first-page":"5742","article-title":"Robust counterfactual explanations for tree-based ensembles","author":"Dutta","year":"2022"},{"key":"10.1016\/j.neucom.2026.134643_bib0055","series-title":"International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems","first-page":"100","article-title":"Comparison-based inverse classification for interpretability in machine learning","author":"Laugel","year":"2018"},{"key":"10.1016\/j.neucom.2026.134643_bib0060","author":"Rathi"},{"key":"10.1016\/j.neucom.2026.134643_bib0065","author":"Schleich"},{"issue":"5","key":"10.1016\/j.neucom.2026.134643_bib0070","doi-asserted-by":"crossref","first-page":"2665","DOI":"10.1007\/s10618-023-00930-y","article-title":"Nice: an algorithm for nearest instance counterfactual explanations","volume":"38","author":"Brughmans","year":"2024","journal-title":"Data Min. Knowl. Discov."},{"key":"10.1016\/j.neucom.2026.134643_bib0075","series-title":"Proceedings of the 2020 Conference on Fairness, Accountability, and Transparency","first-page":"607","article-title":"Explaining machine learning classifiers through diverse counterfactual explanations","author":"Mothilal","year":"2020"},{"key":"10.1016\/j.neucom.2026.134643_bib0080","first-page":"62","article-title":"Counterfactual explanations can be manipulated","volume":"34","author":"Slack","year":"2021","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.neucom.2026.134643_bib0085","first-page":"16926","article-title":"Towards robust and reliable algorithmic recourse","volume":"34","author":"Upadhyay","year":"2021","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.neucom.2026.134643_bib0090","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.119390","article-title":"Feature-weighted counterfactual-based explanation for bankruptcy prediction","volume":"216","author":"Cho","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.neucom.2026.134643_bib0095","series-title":"Proceedings of the AAAI Conference on Artificial Intelligence","first-page":"21322","article-title":"Promoting counterfactual robustness through diversity","volume":"vol. 38","author":"Leofante","year":"2024"},{"key":"10.1016\/j.neucom.2026.134643_bib0100","series-title":"Proceedings of the AAAI Conference on Artificial Intelligence","first-page":"14901","article-title":"Formalising the robustness of counterfactual explanations for neural networks","volume":"vol. 37","author":"Jiang","year":"2023"},{"issue":"8","key":"10.1016\/j.neucom.2026.134643_bib0105","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s10994-025-06821-1","article-title":"Perfect counterfactuals in imperfect worlds: modelling noisy implementation of actions in sequential algorithmic recourse","volume":"114","author":"Xuan","year":"2025","journal-title":"Mach. Learn."},{"key":"10.1016\/j.neucom.2026.134643_bib0110","series-title":"Proceedings of the 2025 ACM Conference on Fairness, Accountability, and Transparency","first-page":"89","article-title":"Time can invalidate algorithmic recourse","author":"De Toni","year":"2025"},{"key":"10.1016\/j.neucom.2026.134643_bib0115","series-title":"International Conference on Machine Learning","first-page":"12351","article-title":"Robust counterfactual explanations for neural networks with probabilistic guarantees","author":"Hamman","year":"2023"},{"key":"10.1016\/j.neucom.2026.134643_bib0120","series-title":"International Conference on Artificial Neural Networks","first-page":"215","article-title":"Generally-occurring model change for robust counterfactual explanations","author":"Xu","year":"2024"},{"key":"10.1016\/j.neucom.2026.134643_bib0125","doi-asserted-by":"crossref","DOI":"10.1016\/j.artint.2024.104218","article-title":"Interval abstractions for robust counterfactual explanations","volume":"336","author":"Jiang","year":"2024","journal-title":"Artif. Intell."},{"key":"10.1016\/j.neucom.2026.134643_bib0130","article-title":"Enhancing the robustness of counterfactual explanations via modular robust compatibility","author":"Xu","year":"2025","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.neucom.2026.134643_bib0135","author":"Laugel"},{"key":"10.1016\/j.neucom.2026.134643_bib0140","series-title":"2021 IEEE Symposium Series on Computational Intelligence","first-page":"01","article-title":"Evaluating robustness of counterfactual explanations","author":"Artelt","year":"2021"},{"key":"10.1016\/j.neucom.2026.134643_bib0145","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1016\/j.neucom.2021.04.129","article-title":"Efficient computation of counterfactual explanations and counterfactual metrics of prototype-based classifiers","volume":"470","author":"Artelt","year":"2022","journal-title":"Neurocomputing"},{"key":"10.1016\/j.neucom.2026.134643_bib0150","series-title":"Proceedings of the AAAI\/ACM Conference on AI, Ethics, and Society","first-page":"344","article-title":"FACE: feasible and actionable counterfactual explanations","author":"Poyiadzi","year":"2020"},{"key":"10.1016\/j.neucom.2026.134643_bib0155","series-title":"Proceedings of the AAAI Conference on Artificial Intelligence","first-page":"10829","article-title":"Faithful model explanations through energy-constrained conformal counterfactuals","volume":"vol. 38","author":"Altmeyer","year":"2024"},{"key":"10.1016\/j.neucom.2026.134643_bib0160","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2024.111668","article-title":"Faithful counterfactual visual explanations (FCVE)","volume":"294","author":"Khan","year":"2024","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.neucom.2026.134643_bib0165","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2025.111532","article-title":"Eace: explain anomaly via counterfactual explanations","volume":"164","author":"Zhou","year":"2025","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.neucom.2026.134643_bib0170","series-title":"Proceedings of the 2021 ACM Conference on Fairness, Accountability, and Transparency","first-page":"353","article-title":"Algorithmic recourse: from counterfactual explanations to interventions","author":"Karimi","year":"2021"},{"key":"10.1016\/j.neucom.2026.134643_bib0175","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2024.126063","article-title":"Model-agnostic counterfactual explanation: a feature weights-based comprehensive causal multi-objective counterfactual framework","volume":"266","author":"Liu","year":"2025","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.neucom.2026.134643_bib0180","series-title":"Proceedings of the ACM on Web Conference 2025","first-page":"4507","article-title":"Learning feasible causal algorithmic recourse: a prior structural knowledge free approach","author":"Wang","year":"2025"},{"key":"10.1016\/j.neucom.2026.134643_bib0185","first-page":"139334","article-title":"Performative validity of recourse explanations","volume":"38","author":"K\u00f6nig","year":"2026","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"9","key":"10.1016\/j.neucom.2026.134643_bib0190","doi-asserted-by":"crossref","first-page":"1610","DOI":"10.1109\/TPAMI.2009.190","article-title":"Local-learning-based feature selection for high-dimensional data analysis","volume":"32","author":"Sun","year":"2010","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"52","key":"10.1016\/j.neucom.2026.134643_bib0195","article-title":"Selecting critical features for data classification based on machine learning methods","volume":"7","author":"Chen","year":"2020","journal-title":"J. Big Data"},{"issue":"1","key":"10.1016\/j.neucom.2026.134643_bib0200","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1186\/1471-2105-9-307","article-title":"Conditional variable importance for random forests","volume":"9","author":"Strobl","year":"2008","journal-title":"BMC Bioinform."},{"issue":"10","key":"10.1016\/j.neucom.2026.134643_bib0205","doi-asserted-by":"crossref","first-page":"1340","DOI":"10.1093\/bioinformatics\/btq134","article-title":"Permutation importance: a corrected feature importance measure","volume":"26","author":"Altmann","year":"2010","journal-title":"Bioinformatics"},{"issue":"5","key":"10.1016\/j.neucom.2026.134643_bib0210","doi-asserted-by":"crossref","first-page":"2531","DOI":"10.1007\/s11831-021-09694-4","article-title":"Particle swarm optimization algorithm and its applications: a systematic review","volume":"29","author":"Gad","year":"2022","journal-title":"Arch. Comput. Methods Eng."},{"key":"10.1016\/j.neucom.2026.134643_bib0215","series-title":"Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data","first-page":"93","article-title":"LOF: identifying density-based local outliers","author":"Breunig","year":"2000"}],"container-title":["Neurocomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925231226020412?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925231226020412?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T21:13:20Z","timestamp":1790198000000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925231226020412"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":43,"alternative-id":["S0925231226020412"],"URL":"https:\/\/doi.org\/10.1016\/j.neucom.2026.134643","relation":{},"ISSN":["0925-2312"],"issn-type":[{"value":"0925-2312","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Plausible and robust counterfactual explanation via local distribution consistency","name":"articletitle","label":"Article Title"},{"value":"Neurocomputing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.neucom.2026.134643","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"134643"}}