{"id":"W4398220220","doi":"10.1007/978-3-031-60924-4_24","title":"Optimal Counterfactual Explanations for k-Nearest Neighbors Using Mathematical Optimization and Constraint Programming","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; University of Waterloo; Concordia University","funders":"","keywords":"Counterfactual thinking; Computer science; Constraint programming; Constraint (computer-aided design); Mathematical optimization; k-nearest neighbors algorithm; Algorithm; Artificial intelligence; Stochastic programming; Mathematics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008326465,0.001088127,0.003163882,0.002148364,0.001839528,0.004983064,0.005793319,0.004231381,0.01530204],"category_scores_gemma":[0.0676915,0.001906696,0.002296089,0.0036373,0.003254514,0.01184779,0.002982171,0.005850893,0.0008968611],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003844923,"about_ca_system_score_gemma":0.002945827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008832356,"about_ca_topic_score_gemma":0.01034353,"domain_scores_codex":[0.9929517,0.004712013,0.0003619795,0.0009507997,0.0007037862,0.0003196251],"domain_scores_gemma":[0.9227298,0.07024191,0.001981459,0.003160557,0.001368086,0.0005181151],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001690412,0.00009612625,0.0005522691,0.0001855713,0.0001016805,0.0001175474,0.0002464533,0.1481873,0.00009637556,0.8202865,0.00439579,0.02556545],"study_design_scores_gemma":[0.00003466915,0.000006144568,0.00007335659,0.00002847409,0.00001544542,0.00002278986,0.00004339157,0.3590233,0.00007039869,0.6401091,0.0005572743,0.00001567309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02222767,0.0008011364,0.9643289,0.003447782,0.0001718958,0.0001183008,0.000606314,0.0002328599,0.008065122],"genre_scores_gemma":[0.5130488,0.001185773,0.4755665,0.000499097,0.000496604,0.0005888264,0.001346047,0.0002997907,0.006968598],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01530204,"threshold_uncertainty_score":0.05119038,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03851216212261793,"score_gpt":0.2848608348532083,"score_spread":0.2463486727305904,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}