325 search results - page 9 / 65 » On Clusterings - Good, Bad and Spectral |
KDD
2007
ACM
14 years 7 months ago
2007
ACM
COLT
2004
Springer
14 years 22 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...
PRIS
2004
13 years 8 months ago
2004
We address the problem of the combination of multiple data partitions, that we call a clustering ensemble. We use a recent clustering approach, known as Spectral Clustering, and th...
ACL
2006
13 years 8 months ago
2006
This paper presents an unsupervised learning approach to disambiguate various relations between name entities by use of various lexical and syntactic features from the contexts. I...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
We propose a general framework for learning from labeled and unlabeled data on a directed graph in which the structure of the graph including the directionality of the edges is co...