HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS		QUICK SEARCH:   [advanced] Author: Keyword(s): Year:  Vol:  Page:

This Article Full Text Full Text (PDF) Alert me when this article is cited Alert me if a correction is posted Services Similar articles in this journal Similar articles in PubMed Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via HighWire Citing Articles via Google Scholar Google Scholar Articles by Hochreiter, S. Articles by Obermayer, K. Search for Related Content PubMed PubMed Citation Articles by Hochreiter, S. Articles by Obermayer, K.

Support Vector Machines for Dyadic Data

hochreit{at}cs.tu-berlin.de

Klaus Obermayer

oby{at}cs.tu-berlin.de Department of Electrical Engineering and Computer Science, Technische Universität Berlin, 10587 Berlin, Germany

We describe a new technique for the analysis of dyadic data, where two sets of objects (row and column objects) are characterized by a matrix of numerical values that describe their mutual relationships. The new technique, called potential support vector machine (P-SVM), is a large-margin method for the construction of classifiers and regression functions for the column objects. Contrary to standard support vector machine approaches, the P-SVM minimizes a scale-invariant capacity measure and requires a new set of constraints. As a result, the P-SVM method leads to a usually sparse expansion of the classification and regression functions in terms of the row rather than the column objects and can handle data and kernel matrices that are neither positive definite nor square. We then describe two complementary regularization schemes. The first scheme improves generalization performance for classification and regression tasks; the second scheme leads to the selection of a small, informative set of row support objects and can be applied to feature selection. Benchmarks for classification, regression, and feature selection tasks are performed with toy data as well as with several real-world data sets. The results show that the new method is at least competitive with but often performs better than the benchmarked standard methods for standard vectorial as well as true dyadic data sets. In addition, a theoretical justification is provided for the new approach.

This article has been cited by other articles:

				T. Knebel, S. Hochreiter, and K. Obermayer An SMO Algorithm for the Potential Support VectorMachine Neural Comput., January 1, 2007; 20(1): 271 - 287. [Abstract] [Full Text] [PDF]