.png){kind=icon}
返回
Semi-supervised adaptive kernel concept factorization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2022.109114.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Kernelized concept factorization (KCF) has shown its advantage on handling data with nonlinear struc-tures; however, the kernels involved in the existing KCF-based methods are empirically predefined, which may compromise the performance. In this paper, we propose semi-supervised adaptive kernel concept factorization (SAKCF), which integrates the data representation and kernel learning into a unified model to make the two learning processes adapt to each other. SAKCF extends traditional KCF in a semi -supervised manner, which encourages the high-dimensional representation to be consistent with both the limited supervisory and local geometric information. Besides, an alternating iterative algorithm is proposed to solve the resulting constrained optimization problem. Experimental results on six real-world data sets verify the effectiveness and advantages of our SAKCF over state-of-the-art methods when ap-plied on the clustering task.(c) 2022 Elsevier Ltd. All rights reserved.
Keyword:
Concept factorization
Semi -supervised learning
Clustering
Nonnegative matrix factorization
Kernel method
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
PSI: Patch-based script identification using non-negative matrix factorization.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏
Gradient-based learning applied to document recognition基于梯度的学习在文档识别中的应用PROCEEDINGS OF THE IEEE
PROCEEDINGS OF THE IEEEIF25.9
PREAI
分享收藏
查看更多内容