Prototype selection for interpretable classification

DOI10.1214/11-AOAS495zbMath1234.62096arXiv1202.5933WikidataQ102362768 ScholiaQ102362768MaRDI QIDQ765979

Robert Tibshirani, Jacob Bien

Publication date: 22 March 2012

Published in: The Annals of Applied Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.5933

zbMATH Keywords

integer programnearest neighborsset cover

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of statistics to biology and medical sciences; meta analysis (62P10) Applications of mathematical programming (90C90) Integer programming (90C10)

Related Items

Genomic feature selection by coverage design optimization, Generating contrastive explanations for inductive logic programming based on a near miss approach, Considerations when learning additive explanations for black-box models, A Survey on the Explainability of Supervised Machine Learning, Interpretable machine learning: fundamental principles and 10 grand challenges, Classification using proximity catch digraphs, Explainable Deep Learning: A Field Guide for the Uninitiated

Uses Software

• UCI-ml
• glmnet
• ElemStatLearn

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Data complexity in pattern recognition.
• Approximation algorithms for the class cover problem
• Reduction techniques for instance-based learning algorithms
• Classification using class cover catch digraphs
• A SLLN for a one-dimensional class cover problem
• Experimental study on prototype optimisation algorithms for prototype-based classification in vector spaces
• A threshold of ln n for approximating set cover
• 10.1162/jmlr.2003.3.4-5.723
• A new family of random graphs for testing spatial segregation
• A Unified Approach to Approximating Partial Covering Problems
• Nearest neighbor pattern classification
• Self-organizing maps.
• Metrics and models for handwritten character recognition