Classification on proximity data with LP-machines
Classification on proximity data with LP-machines
- Author(s): T. Graepel ; R. Herbrich ; B. Scholkopf ; A. Smola ; P. Bartlett ; K.-R. Muller ; K. Obermayer ; R. Williamson
- DOI: 10.1049/cp:19991126
For access to this article, please select a purchase option:
Buy conference paper PDF
Buy Knowledge Pack
IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.
9th International Conference on Artificial Neural Networks: ICANN '99 — Recommend this title to your library
Thank you
Your recommendation has been sent to your librarian.
- Author(s): T. Graepel ; R. Herbrich ; B. Scholkopf ; A. Smola ; P. Bartlett ; K.-R. Muller ; K. Obermayer ; R. Williamson Source: 9th International Conference on Artificial Neural Networks: ICANN '99, 1999 p. 304 – 309
- Conference: 9th International Conference on Artificial Neural Networks: ICANN '99
- DOI: 10.1049/cp:19991126
- ISBN: 0 85296 721 7
- Location: Edinburgh, UK
- Conference date: 7-10 Sept. 1999
- Format: PDF
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 in input 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.
Inspec keywords: pattern classification; neural nets; learning (artificial intelligence); linear programming
Subjects: Pattern recognition; Learning in AI (theory); Optimisation techniques; Adaptive system theory; Neural nets (theory)
Related content
content/conferences/10.1049/cp_19991126
pub_keyword,iet_inspecKeyword,pub_concept
6
6