.png){kind=icon}
返回
Online kernel-based clustering
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2024.111009.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A novel online joint kernel learning and clustering (OKC) framework is derived which is capable of determining time-varying clustering configurations without the need for training data. To facilitate clustering via sparse kernel factorization, a novel time-dependent metric is devised to quantify closeness of candidate kernel similarity matrices to a block diagonal structure. The task is later performed online as newly acquired data are processed making it appropriate for non-stationary settings. The necessary minimization to carry out kernel learning and clustering is performed via an effective interplay among block coordinate descent, difference of convex functions minimization and projected subgradient descent which results in an online iterative algorithm that updates online the kernel covariance matrix, as well as the associated clustering configuration. The resulting recursive kernel updates are proved to converge to a bounded limit. Detailed numerical examples utilizing both synthetic and real data show the superior clustering accuracy achieved by the novel approach over existing alternatives while requiring considerably less running time.
Keyword:
Kernel learning
Online algorithms
Clustering
Optimization
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
Fast subspace clustering by learning projective block diagonal representation *.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏Two algorithms for orthogonal nonnegative matrix factorization with application to clustering两种正交非负矩阵分解算法及其在聚类中的应用NEUROCOMPUTING
OAAI
NEUROCOMPUTINGIF6.5
OAAI分享收藏
分享收藏
查看更多内容