Prototype selection for interpretable classification

By Jacob Bien, Robert Tibshirani. 2011

287 citations recorded by the source corpus.

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. We demonstrate the interpretative value of producing prototypes on the well-known USPS ZIP code digits data set and show that as a classifier it performs reasonably well. We apply the method to a proteomics data set in which the samples are strings and therefore not naturally embedded in a vector space. Our method is compatible with any dissimilarity measure, making it amenable to situations in which using a non-Euclidean metric is desirable or even necessary.

Subfields: Artificial Intelligence, Statistics and Probability

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Cynthia Rudin
  2. Nicolas Papernot
  3. Tomas Pfister
  4. Marco F. Huber
  5. Sercan Ö. Arik
  6. Dino Pedreschi
  7. Longo Luca
  8. Giulia Vilone

In Statistics and Probability

  1. Cynthia Rudin
  2. Nadia Burkart
  3. Marco F. Huber
  4. Berk Ustun
  5. Been Kim
  6. Lesia Semenova
  7. Ş. Ertekin
  8. Chudi Zhong

Citations in the corpus