1105 search results - page 15 / 221 » Approximate Spectral Clustering. |
KDD
2007
ACM
14 years 8 months ago
2007
ACM
COLT
2004
Springer
14 years 28 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 9 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...
CVPR
2008
IEEE
14 years 2 months ago
2008
IEEE
In this paper, we propose a novel graph based clustering approach with satisfactory clustering performance and low computational cost. It consists of two main steps: tree fitting...
ACL
2006
13 years 9 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...