Prototype selection for interpretable classification
From MaRDI portal
(Redirected from Publication:765979)
Abstract: Prototype methods seek a minimal subset of samples that can serve as a distillation or condensed view of a data set. As the size of modern data sets grows, being able to present a domain specialist with a short list of "representative" samples chosen from the data set is of increasing interpretative value. While much recent statistical research has been focused on producing sparse-in-the-variables methods, this paper aims at achieving sparsity in the samples. We discuss a method for selecting prototypes in the classification setting (in which the samples fall into known discrete categories). Our method of focus is derived from three basic properties that we believe a good prototype set should satisfy. This intuition is translated into a set cover optimization problem, which we solve approximately using standard approaches. While prototype selection is usually viewed as purely a means toward building an efficient classifier, in this paper we emphasize the inherent value of having a set of prototypical elements. That said, by using the nearest-neighbor rule on the set of prototypes, we can of course discuss our method as a classifier as well.
Recommendations
- Prototype selection for dissimilarity-based classifiers
- Nearest prototype classifier designs: An experimental study
- scientific article; zbMATH DE number 1759505
- The PM-M prototype selection system
- Experimental study on prototype optimisation algorithms for prototype-based classification in vector spaces
Cites work
- scientific article; zbMATH DE number 5957245 (Why is no real title available?)
- scientific article; zbMATH DE number 3862476 (Why is no real title available?)
- scientific article; zbMATH DE number 1839431 (Why is no real title available?)
- scientific article; zbMATH DE number 835699 (Why is no real title available?)
- 10.1162/jmlr.2003.3.4-5.723
- A SLLN for a one-dimensional class cover problem
- A Unified Approach to Approximating Partial Covering Problems
- A new family of random graphs for testing spatial segregation
- A threshold of ln n for approximating set cover
- Approximation algorithms for the class cover problem
- Classification using class cover catch digraphs
- Data complexity in pattern recognition.
- Experimental study on prototype optimisation algorithms for prototype-based classification in vector spaces
- Metrics and models for handwritten character recognition
- Nearest neighbor pattern classification
- Reduction techniques for instance-based learning algorithms
- Self-organizing maps.
Cited in
(15)- Discriminative prototype selection methods for graph embedding
- Genomic feature selection by coverage design optimization
- Generating contrastive explanations for inductive logic programming based on a near miss approach
- Prototype selection for dissimilarity-based classifiers
- scientific article; zbMATH DE number 1696551 (Why is no real title available?)
- Classification using proximity catch digraphs
- A survey on the explainability of supervised machine learning
- The PM-M prototype selection system
- Interpretable machine learning: fundamental principles and 10 grand challenges
- Learning good prototypes for classification using filtering and abstraction of instances
- Explainable deep learning: a field guide for the uninitiated
- Cluster prototypes selection by genetic chromodynamics
- Considerations when learning additive explanations for black-box models
- Prototype Classification: Insights from Machine Learning
- scientific article; zbMATH DE number 1754067 (Why is no real title available?)
This page was built for publication: Prototype selection for interpretable classification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765979)
