65 search results - page 1 / 13 » Learning a Bi-Stochastic Data Similarity Matrix |
ICDM
2010
IEEE
13 years 2 months ago
2010
IEEE
An idealized clustering algorithm seeks to learn a cluster-adjacency matrix such that, if two data points belong to the same cluster, the corresponding entry would be 1; otherwise ...
IAT
2009
IEEE
13 years 11 months ago
2009
IEEE
—This paper proposes a method of learning a similarity matrix from pairwise constraints for interactive clustering. The similarity matrix can be learned by solving an optimizatio...
JMLR
2006
13 years 4 months ago
2006
Spectral clustering refers to a class of techniques which rely on the eigenstructure of a similarity matrix to partition points into disjoint clusters, with points in the same clu...
WEBI
2005
Springer
13 years 10 months ago
2005
Springer
Structured link vector model (SLVM) is a recently proposed document representation that takes into account both structural and semantic information for measuring XML document simi...
AAAI
2006
13 years 6 months ago
2006
We present a novel framework for multi-label learning that explicitly addresses the challenge arising from the large number of classes and a small size of training data. The key a...