Sciweavers

90 search results - page 5 / 18
» Spectral Clustering by Recursive Partitioning
Sort
View
ICCV
2003
IEEE
14 years 9 months ago
Spectral Partitioning for Structure from Motion
We propose a spectral partitioning approach for large-scale optimization problems, specifically structure from motion. In structure from motion, partitioning methods reduce the pr...
Drew Steedly, Irfan A. Essa, Frank Dellaert
ICPR
2008
IEEE
14 years 1 months ago
Spectral aggregation for clustering ensemble
Since a large number of clustering algorithms exist, aggregating different clustered partitions into a single consolidated one to obtain better results has become an important pro...
Xi Wang, Chunyu Yang, Jie Zhou
PR
2008
169views more  PR 2008»
13 years 7 months ago
A survey of kernel and spectral methods for clustering
Clustering algorithms are a useful tool to explore data structures and have been employed in many disciplines. The focus of this paper is the partitioning clustering problem with ...
Maurizio Filippone, Francesco Camastra, Francesco ...
SPAA
1997
ACM
13 years 11 months ago
HARP: A Fast Spectral Partitioner
- Partitioning unstructured graphs is central to the parallel solution of computational science and engineering problems. Spectral partitioners, such recursive spectral bisection (...
Horst D. Simon, Andrew Sohn, Rupak Biswas
CVPR
2005
IEEE
14 years 9 months ago
Beyond Pairwise Clustering
We consider the problem of clustering in domains where the affinity relations are not dyadic (pairwise), but rather triadic, tetradic or higher. The problem is an instance of the ...
Sameer Agarwal, Jongwoo Lim, Lihi Zelnik-Manor, Pi...