22 search results - page 2 / 5 » Spectral Relaxation for K-means Clustering |
JMLR
2006
13 years 4 months ago
2006
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
SDM
2007
SIAM
13 years 6 months ago
2007
SIAM
In this paper we formulate spectral clustering in directed graphs as an optimization problem, the objective being a weighted cut in the directed graph. This objective extends seve...
ICML
2009
IEEE
14 years 5 months ago
2009
IEEE
We present a generalized version of spectral clustering using the graph p-Laplacian, a nonlinear generalization of the standard graph Laplacian. We show that the second eigenvecto...
KDD
2001
ACM
14 years 5 months ago
2001
ACM
Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words separately but not simultaneously. In this paper we pr...
PAKDD
2004
ACM
13 years 10 months ago
2004
ACM
The use of unlabeled data to aid classification is important as labeled data is often available in limited quantity. Instead of utilizing training samples directly into semi-super...