1105 search results - page 33 / 221 » Approximate Spectral Clustering. |
NIPS
2008
13 years 10 months ago
2008
We introduce a family of unsupervised algorithms, numerical taxonomy clustering, to simultaneously cluster data, and to learn a taxonomy that encodes the relationship between the ...
MVA
2000
13 years 10 months ago
2000
X-ray mapping images of polished sections are classified using two unsupervised clustering algorithms. The methods applied are the k-means algorithm and an extended spectral fuzzy...
STOC
2002
ACM
14 years 9 months ago
2002
ACM
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...
AUSAI
2009
Springer
14 years 3 days ago
2009
Springer
Abstract. Spectral co-clustering is a generic method of computing coclusters of relational data, such as sets of documents and their terms. Latent semantic analysis is a method of ...
IJCAI
2003
13 years 10 months ago
2003
We present a simple, easily implemented spectral learning algorithm which applies equally whether we have no supervisory information, pairwise link constraints, or labeled example...