333 search results - page 13 / 67 » B-Matching for Spectral Clustering |
KDD
2010
ACM
13 years 11 months ago
2010
ACM
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
ICRA
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— This paper presents a novel use of spectral clustering algorithms to support cases where the entries in the affinity matrix are costly to compute. The method is increm...
ECML
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Clustering has recently enjoyed progress via spectral methods which group data using only pairwise affinities and avoid parametric assumptions. While spectral clustering ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Spectral clustering is one of the most widely used techniques for extracting the underlying global structure of a data set. Compressed sensing and matrix completion have emerged a...
BMCBI
2005
13 years 7 months ago
2005
Background: Graph theory provides a computational framework for modeling a variety of datasets including those emerging from genomics, proteomics, and chemical genetics. Networks ...