.png){kind=icon}
返回
On unsupervised simultaneous kernel learning and data clustering
.png){kind=icon}
OA
AI
DOI：10.1016/j.patcog.2020.107518.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A novel optimization framework for joint unsupervised clustering and kernel learning is derived. Sparse nonnegative matrix factorization of kernel covariance matrices is utilized to categorize data according to their information content. It is demonstrated that a pertinent kernel covariance matrix for clustering can be constructed such that it is block diagonal within arbitrary row and column permutations, while each diagonal block has rank one. To achieve this, a linear combination of a dictionary of kernels is sought such that it has rank equal to the number of clusters while a certain kernel eigenvalue is maximized by a novel difference of convex functions formulation. We establish that the proposed algorithm converges to a stationary solution. Numerical tests with different datasets demonstrate the effectiveness of the proposed scheme whose performance is very close to supervised methods, and performs better than unsupervised alternatives without the need of painstaking parameter tuning. (C) 2020 Elsevier Ltd. All rights reserved.
Keyword:
Clustering
Matrix factorization
Correlation analysis
Kernel learning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
Two algorithms for orthogonal nonnegative matrix factorization with application to clustering两种正交非负矩阵分解算法及其在聚类中的应用.png)
NEUROCOMPUTINGOAAI
NEUROCOMPUTINGIF6.5
OAAI分享收藏Prevalence of cardiovascular malformations and association with karyotypes in Turner's syndrome.OAAI
OAAI分享收藏分享收藏Melatonin Improves Mitochondrial Respiration in Syncytiotrophoblasts From Placentas of Obese WomenOAAI
OAAI分享收藏
查看更多内容