220
Voted
COLT
16 years 11 days ago
2004 Springer 
Given a set of n randomly drawn sample points, spectral clustering in its simplest form uses the second eigenvector of the graph Laplacian matrix, constructed on the similarity gra...
213
click to vote
COLT
15 years 10 months ago
2004 Springer
We consider the binary classification problem. Given an i.i.d. sample drawn from the distribution of an X
196
click to vote
COLT
16 years 11 days ago
2004 Springer 
The main goal of this paper is to prove inequalities on the reconstruction error for Kernel Principal Component Analysis. With respect to previous work on this topic, our contribu...
194
click to vote
COLT
16 years 11 days ago
2004 Springer
Abstract. The Gram matrix plays a central role in many kernel methods. Knowledge about the distribution of eigenvalues of the Gram matrix is useful for developing appropriate model...
192
click to vote
COLT
16 years 11 days ago
2004 Springer 
One of the nice properties of kernel classifiers such as SVMs is that they often produce sparse solutions. However, the decision functions of these classifiers cannot always be u...
|
Machine Learning