333 search results - page 30 / 67 » B-Matching for Spectral Clustering |
AUSAI
2009
Springer
13 years 11 months 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 9 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...
SSPR
2010
Springer
13 years 6 months ago
2010
Springer
Mixture models have been widely used for data clustering. However, commonly used mixture models are generally of a parametric form (e.g., mixture of Gaussian distributions or GMM),...
ISBI
2011
IEEE
12 years 11 months ago
2011
IEEE
High angular resolution diffusion imaging (HARDI) allows population studies of fiber integrity and connectivity. Tractography can extract individual fibers. For group studies, fib...
TKDE
2012
11 years 10 months ago
2012
—The pairwise constraints specifying whether a pair of samples should be grouped together or not have been successfully incorporated into the conventional clustering methods such...