.png){kind=icon}
返回
Sparse Projection Matrix Approximation and Its Applications
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2024.3519459.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This letter introduces a sparse regularized projection matrix approximation (SPMA) model to recover cluster structures from affinity matrices. The model is formulated as a projection approximation problem with an entry-wise sparsity penalty to encourage sparse solutions. We propose two algorithms to solve this problem: one involves direct optimization on the Stiefel manifold using the Cayley transformation, while the other employs the Alternating Direction Method of Multipliers (ADMM). Numerical experiments on synthetic and real-world datasets demonstrate that our regularized projection matrix approximation approach significantly outperforms state-of-the-art methods in clustering accuracy and performance.
Keyword:
Sparse matrices
Manifolds
Approximation algorithms
Signal processing algorithms
Optimization
Convex functions
Matrix decomposition
Human activity recognition
Eigenvalues and eigenfunctions
Clustering algorithms
ADMM
clustering
regularisation
Stiefel manifold
sparse projection matrix approximation
期刊
IF:
9.6
论文数:
1.1W
被引数:
1.7W
机构
引用论文
分享收藏Conformational dynamics of Peb4 exhibit “mother’s arms” chain model: a molecular dynamics studyPeb4的构象动力学表现出“母亲的手臂”链模型：一项分子动力学研究
PREAI
分享收藏
Inducible regularization for low-rank matrix factorizations for collaborative filtering.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
分享收藏Classification of Mammograms Using Convolutional Neural Network Based Feature Extraction基于卷积神经网络特征提取的乳腺X光图像分类
PREAI
分享收藏Mechanical characterization of neural electrodes based on PDMS-parylene C-PDMS sandwiched system
PREAI
分享收藏
查看更多内容