direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments


Classification on Pairwise Proximity Data
Zitatschlüssel Graepel1999a
Autor Graepel, T. and Herbrich, R. and Bollmann-Sdorra, P. and Obermayer, K.
Buchtitel Advances in Neural Information Processing Systems 11
Seiten 438 – 444
Jahr 1999
Adresse Cambridge, Massachusetts
Verlag MIT Press
Zusammenfassung We investigate the problem of learning a classification task on data represented in terms of their pairwise proximities. This representation does not refer to an explicit feature representation of the data items and is thus more general than the standard approach of using Euclidean feature vectors, from which pairwise proximities can always be calculated. Our first approach is based on a combined linear embedding and classification procedure resulting in an extension of the Optimal Hyperplane algorithm to pseudo-Euclidean data. As an alternative we present another approach based on a linear threshold model in the proximity values themselves, which is optimized using Structural Risk Minimization. We show that prior knowledge about the problem can be incorporated by the choice of distance measures and examine different metrics w.r.t. their generalization. Finally, the algorithms are successfully applied to protein structure data and to data from the cat\\\'s cerebral cortex. They show better performance than K-nearest-neighbor classification.
Link zur Publikation Download Bibtex Eintrag

Zusatzinformationen / Extras


Schnellnavigation zur Seite über Nummerneingabe