Name
Abstract | ||
|---|---|---|
Spectral clustering is a hot topic and many spectral clustering algorithms have been proposed. These algorithms usually solve the discrete cluster indicator matrix by relaxing the original problems, obtaining the continuous solution and finally obtaining a discrete solution that is close to the continuous solution. However, such methods often result in a non-optimal solution to the original problem since the different steps solve different problems. In this paper, we propose a novel spectral clustering method, named as Enhanced Balanced Min Cut (EBMC). In the new method, a new normalized cut model is proposed, in which a set of balance parameters are learned to capture the differences among different clusters. An iterative method with proved convergence is used to effectively solve the new model without eigendecomposition. Theoretical analysis reveals the connection between EBMC and the classical normalized cut. Extensive experimental results show the effectiveness and efficiency of our approach in comparison with the state-of-the-art methods. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/s11263-020-01320-3 | International Journal of Computer Vision |
Keywords | DocType | Volume |
Clustering, Spectral clustering, Normalized cut | Journal | 128 |
Issue | ISSN | Citations |
7 | 0920-5691 | 3 |
PageRank | References | Authors |
0.38 | 23 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiaojun Chen | 1 | 1298 | 107.51 |
| Weijun Hong | 2 | 15 | 0.88 |
| Feiping Nie | 3 | 7061 | 309.42 |
| Joshua Zhexue Huang | 4 | 1365 | 82.64 |
| Li Shen | 5 | 12 | 5.57 |