Extracting support data for a given task

Schölkopf, B; Burges, C; Vapnik, V

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Extracting support data for a given task

MPS-Authors

There are no MPG-Authors in the publication available

External Resource

https://www.aaai.org/Papers/KDD/1995/KDD95-030.pdf
(Publisher version)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Schölkopf, B., Burges, C., & Vapnik, V. (1995). Extracting support data for a given task. In U. Fayyad, & R. Uthurusamy (Eds.), First International Conference on Knowledge Discovery & Data Mining (KDD-95) (pp. 252-257). Menlo Park, CA, USA: AAAI Press.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0013-EC66-3

Abstract

We report a novel possibility for extracting a small subset of a data base which contains all the information necessary to solve a given classification task: using the Support Vector Algorithm to train three different types of handwritten digit classifiers, we observed that these types
of classifiers construct their decision surface from
strongly overlapping small (k: 4) subsets of the data base. This finding opens up the possibiiity of compressing data bases significantly by disposing of the data which is not important for the solution of a given task. In addition, we show that the theory allows us to predict the classifier that will have the best generalization ability, based solely on performance on the training set and characteristics of the learning machines. This finding is important for cases where the amount of available data is limited.