Sciweavers

10 search results - page 1 / 2
» Fast Multilevel Transduction on Graphs
Sort
View
SDM
2007
SIAM
104views Data Mining» more  SDM 2007»
13 years 6 months ago
Fast Multilevel Transduction on Graphs
The recent years have witnessed a surge of interest in graphbased semi-supervised learning methods. The common denominator of these methods is that the data are represented by the...
Fei Wang, Changshui Zhang
JMLR
2006
124views more  JMLR 2006»
13 years 4 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
ICCV
2005
IEEE
14 years 6 months ago
A Multilevel Banded Graph Cuts Method for Fast Image Segmentation
Herve Lombaert, Yiyong Sun, Leo Grady, Chenyang Xu
CVPR
2008
IEEE
14 years 6 months ago
Active microscopic cellular image annotation by superposable graph transduction with imbalanced labels
Systematic content screening of cell phenotypes in microscopic images has been shown promising in gene function understanding and drug design. However, manual annotation of cells ...
Jun Wang, Shih-Fu Chang, Xiaobo Zhou, Stephen T. C...
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
14 years 5 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis