direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

All Publications

Classification on Proximity Data with LP-Machines
Citation key Graepel1999c
Author Graepel, T. and Herbrich, R. and Schoelkopf, B. and Smola, A. and Bartlett, P. and Mueller, K.R. and Obermayer, K. and Williamson, R.
Title of Book 9th International Conference on Artificial Neural Networks - ICANN99
Pages 304 – 309
Year 1999
ISBN 0537-9989
ISSN 0-85296-721-7
DOI 10.1049/cp:19991126
Journal 1
Publisher IEEE
Abstract We provide a new linear program to deal with classification of data in the case of data given in terms of pairwise proximities. This allows to avoid the problems inherent in using feature spaces with indefinite metric in Support Vector Machines, since the notion of a margin is purely needed ininput space where the classification actually occurs. Moreover in our approach we can enforce sparsity in the proximity representation by sacrificing training error. This turns out to be favorable for proximity data. Similar to ν–SV methods, the only parameter needed in the algorithm is the (asymptotical) number of data points being classified with a margin. Finally, the algorithm is successfully compared with ν–SV learning in proximity space and $K$–nearest-neighbors on real world data from Neuroscience and molecular biology.
Bibtex Type of Publication Selected:structured
Link to publication Link to original publication Download Bibtex entry

Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

Auxiliary Functions