325 search results - page 25 / 65 » On Clusterings - Good, Bad and Spectral |
AUSAI
2009
Springer
15 years 2 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 ...
93
Voted
IJCAI
2003
15 years 14 days 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...
119
click to vote
TKDE
2012
13 years 1 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...
85
Voted
ICIP
2007
IEEE
16 years 23 days ago
2007
IEEE
The clustering-based approach for detecting abnormalities in surveillance video requires the appropriate definition of similarity between events. The HMM-based similarity defined ...
65
Voted
NIPS
2003
15 years 13 days ago
2003
Significant progress in clustering has been achieved by algorithms that are based on pairwise affinities between the datapoints. In particular, spectral clustering methods have ...