Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2405.16598 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912108769181696 |
|---|---|
| author | Zhai, Zheng Xu, Jialu Wu, Mingxin Li, Xiaohui |
| author_facet | Zhai, Zheng Xu, Jialu Wu, Mingxin Li, Xiaohui |
| contents | This paper introduces a regularized projection matrix approximation framework designed to recover cluster information from the affinity matrix. The model is formulated as a projection approximation problem, incorporating an entry-wise penalty function. We investigate three distinct penalty functions, each specifically tailored to address bounded, positive, and sparse scenarios. To solve this problem, we propose direct optimization on the Stiefel manifold, utilizing the Cayley transformation along with the Alternating Direction Method of Multipliers (ADMM) algorithm. Additionally, we provide a theoretical analysis that establishes the convergence properties of ADMM, demonstrating that the convergence point satisfies the KKT conditions of the original problem. Numerical experiments conducted on both synthetic and real-world datasets reveal that our regularized projection matrix approximation approach significantly outperforms state-of-the-art methods in clustering performance. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_16598 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Regularized Projection Matrix Approximation with Applications to Community Detection Zhai, Zheng Xu, Jialu Wu, Mingxin Li, Xiaohui Machine Learning This paper introduces a regularized projection matrix approximation framework designed to recover cluster information from the affinity matrix. The model is formulated as a projection approximation problem, incorporating an entry-wise penalty function. We investigate three distinct penalty functions, each specifically tailored to address bounded, positive, and sparse scenarios. To solve this problem, we propose direct optimization on the Stiefel manifold, utilizing the Cayley transformation along with the Alternating Direction Method of Multipliers (ADMM) algorithm. Additionally, we provide a theoretical analysis that establishes the convergence properties of ADMM, demonstrating that the convergence point satisfies the KKT conditions of the original problem. Numerical experiments conducted on both synthetic and real-world datasets reveal that our regularized projection matrix approximation approach significantly outperforms state-of-the-art methods in clustering performance. |
| title | Regularized Projection Matrix Approximation with Applications to Community Detection |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2405.16598 |