arrow
Return

Semi-supervised adaptive kernel concept factorization

delete2023-02-01
delete6
PRE
AI
W
Wenhui Wu
J
Junhui Hou
S
Shiqi Wang
S
Sam Kwong *
周宇 cover
周宇 (Yu Zhou)
DOI:10.1016/j.patcog.2022.109114delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

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

Pattern Recognition cover
Pattern Recognition
IF:
7.6
Papers:
1.3W
Citations:
4.5W

Organization

C
City University of Hong Kong
Scholars:
2.3W
Papers: 3.0W
Citations: 6.1W
S
shenzhen university
Scholars:
4.5W
Papers: 3.4W
Citations: 72