.png){kind=icon}
返回
Self-representative kernel concept factorization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2022.110051.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Kernel concept factorization (KCF) has successfully utilized kernel trick to conduct matrix factorization in the kernel space. However, conventional KCF methods usually define kernel in advance, which limits their ability to exploit the power of kernel. This paper proposes a semi-supervised self-representative kernel concept factorization (S3RKCF) method to integrate adaptive kernel learning and low-dimensional data representation learning into a unified model. Technically, an adaptive local geometric structure is acquired in the KCF-induced self-representation space, and then it facilitates data representation learning simultaneously. Furthermore, to enhance the discriminability of data representation, limited supervisory information is imposed in the formulated optimization problem as constraints. In this way, our model can learn kernel and discriminative low-dimensional representation adaptively and iteratively. To solve the optimization problem, an alternating iterative algorithm is designed with convergence guarantee. The performance of our proposed S3RKCF is evaluated through clustering and classification tasks, and the experimental results on eight real-world data sets demonstrate its effectiveness compared to state-of-the-art methods. (c) 2022 Elsevier B.V. All rights reserved.
Keyword:
Concept factorization
Self-representation learning
Semi-supervised learning
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
分享收藏分享收藏?isoform-selective changes in PKC immunoreactivity after trace eyeblink conditioning in the rabbit hippocampus.png)
Hippocampus
OAAI
HippocampusIF0
OAAI分享收藏
查看更多内容