Sciweavers

350 search results - page 3 / 70
» Semidefinite spectral clustering
Sort
View
IPCO
2008
221views Optimization» more  IPCO 2008»
13 years 8 months ago
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
Michael Armbruster, Marzena Fügenschuh, Chris...
KDD
2012
ACM
281views Data Mining» more  KDD 2012»
11 years 9 months ago
Active spectral clustering via iterative uncertainty reduction
Spectral clustering is a widely used method for organizing data that only relies on pairwise similarity measurements. This makes its application to non-vectorial data straightforw...
Fabian L. Wauthier, Nebojsa Jojic, Michael I. Jord...
JMLR
2012
11 years 9 months ago
Constrained 1-Spectral Clustering
An important form of prior information in clustering comes in form of cannot-link and must-link constraints. We present a generalization of the popular spectral clustering techniq...
Syama Sundar Rangapuram, Matthias Hein
MM
2005
ACM
140views Multimedia» more  MM 2005»
14 years 28 days ago
Web image clustering by consistent utilization of visual features and surrounding texts
Image clustering, an important technology for image processing, has been actively researched for a long period of time. Especially in recent years, with the explosive growth of th...
Bin Gao, Tie-Yan Liu, Tao Qin, Xin Zheng, QianShen...
CVPR
2012
IEEE
11 years 9 months ago
Higher order motion models and spectral clustering
Motion segmentation based on point trajectories can integrate information of a whole video shot to detect and separate moving objects. Commonly, similarities are defined between ...
Peter Ochs, Thomas Brox