Name
Abstract | ||
|---|---|---|
This paper introduces the Spectral Clustering Equivalence (SCE) algorithm which is intended to be an alternative to spectral clustering (SC) with the objective to improve both speed and quality of segmentation. Instead of solving for the spectral decomposition of a similarity matrix as in SC, SCE converts the similarity matrix to a column-centered dissimilarity matrix and searches for a pair of the most anticorrelated columns. The orthogonal complement to these columns is then used to create an output feature vector (analogous to eigenvectors obtained via SC), which is used to partition the data into discrete clusters. We demonstrate the performance of SCE on a number of artificial and real datasets by comparing its classification and image segmentation results with those returned by kernel-PCA and Normalized Cuts algorithm. The column-wise processing allows the applicability of SCE to Very Large Scale problems and asymmetric datasets. |
Year | Venue | Keywords |
|---|---|---|
2011 | ACIVS | large scale problem,image segmentation result,column-centered dissimilarity matrix,spectral decomposition,normalized cuts algorithm,asymmetric datasets,similarity matrix,anticorrelated column,real datasets,spectral clustering equivalence,new anticorrelation-based spectral,image segmentation,latent variables,spectral clustering,electronic engineering,dimensionality reduction,latent variable |
Field | DocType | Volume |
Spectral clustering,Feature vector,Dimensionality reduction,Pattern recognition,Matrix (mathematics),Computer science,Matrix decomposition,Segmentation-based object categorization,Image segmentation,Artificial intelligence,Eigenvalues and eigenvectors | Conference | 6915 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
18 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Julia Dietlmeier | 1 | 4 | 1.71 |
| Ovidiu Ghita | 2 | 234 | 18.12 |
| Paul F. Whelan | 3 | 561 | 39.95 |