.png){kind=icon}
Return
Semi-supervised adaptive kernel concept factorization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2022.109114.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Concept factorization
Semi -supervised learning
Clustering
Nonnegative matrix factorization
Kernel method
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
Cited Papers
ShareSaveShareSaveShareSaveShareSavePSI: Patch-based script identification using non-negative matrix factorization.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
ShareSave
ShareSave
View more