Sciweavers

31 search results - page 5 / 7
» Kernel k-means: spectral clustering and normalized cuts
Sort
View
ICML
2007
IEEE
15 years 10 months ago
Spectral clustering and transductive learning with multiple views
We consider spectral clustering and transductive inference for data with multiple views. A typical example is the web, which can be described by either the hyperlinks between web ...
Dengyong Zhou, Christopher J. C. Burges
JMLR
2006
124views more  JMLR 2006»
14 years 9 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini
129
Voted
CVPR
2010
IEEE
15 years 6 months ago
Learning Full Pairwise Affinities for Spectral Segmentation
This paper studies the problem of learning a full range of pairwise affinities gained by integrating local grouping cues for spectral segmentation. The overall quality of the spect...
Tae Hoon Kim (Seoul National University), Kyoung M...
SDM
2009
SIAM
225views Data Mining» more  SDM 2009»
15 years 6 months ago
Integrated KL (K-means - Laplacian) Clustering: A New Clustering Approach by Combining Attribute Data and Pairwise Relations.
Most datasets in real applications come in from multiple sources. As a result, we often have attributes information about data objects and various pairwise relations (similarity) ...
Fei Wang, Chris H. Q. Ding, Tao Li
TMM
2008
112views more  TMM 2008»
14 years 9 months ago
Multimodal News Story Clustering With Pairwise Visual Near-Duplicate Constraint
Story clustering is a critical step for news retrieval, topic mining, and summarization. Nonetheless, the task remains highly challenging owing to the fact that news topics exhibit...
Xiao Wu, Chong-Wah Ngo, Alexander G. Hauptmann