Classification by Set Cover: The Prototype Vector Machine

Details Classification by Set Cover: The Prototype Vector Machine Classification by Set Cover: The Prototype Vector Machine

2009-08-17

arxiv.org/abs/0908.2284v1

Statistics

Machine Learning

24 pages, 11 figures

Scientific paper

We introduce a new nearest-prototype classifier, the prototype vector machine (PVM). It arises from a combinatorial optimization problem which we cast as a variant of the set cover problem. We propose two algorithms for approximating its solution. The PVM selects a relatively small number of representative points which can then be used for classification. It contains 1-NN as a special case. The method is compatible with any dissimilarity measure, making it amenable to situations in which the data are not embedded in an underlying feature space or in which using a non-Euclidean metric is desirable. Indeed, we demonstrate on the much studied ZIP code data how the PVM can reap the benefits of a problem-specific metric. In this example, the PVM outperforms the highly successful 1-NN with tangent distance, and does so retaining fewer than half of the data points. This example highlights the strengths of the PVM in yielding a low-error, highly interpretable model. Additionally, we apply the PVM to a protein classification problem in which a kernel-based distance is used.

Affiliated with

Also associated with

No associations

Rating

Classification by Set Cover: The Prototype Vector Machine does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Classification by Set Cover: The Prototype Vector Machine, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Classification by Set Cover: The Prototype Vector Machine will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-19145