.png){kind=icon}
.png){kind=icon}
Return
Correntropy based graph regularized concept factorization for clustering
.png){kind=icon}
OA
AI
DOI：10.1016/j.neucom.2018.07.049.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Concept factorization (CF) technique is one of the most powerful approaches for feature learning, and has been successfully adopted in a wide range of practical applications such as data mining, computer vision, and information retrieval. Most existing concept factorization methods mainly minimize the square of the Euclidean distance, which is seriously sensitive to non-Gaussian noises or outliers in the data. To alleviate the adverse influence of this limitation, in this paper, a robust graph regularized concept factorization method, called correntropy based graph regularized concept factorization (GCCF), is proposed for clustering tasks. Specifically, based on the maximum correntropy criterion (MCC), GCCF is derived by incorporating the graph structure information into our proposed objective function. A half-quadratic optimization technique is adopted to solve the non-convex objective function of the GCCF method effectively. In addition, algorithm analysis of GCCF is studied. Extensive experiments on real world datasets demonstrate that the proposed GCCF method outperforms seven competing methods for clustering applications. (C) 2018 Elsevier B.V. All rights reserved.
Keywords:
Concept factorization
Graph regularization
Maximum correntropy criterion
Non-Gaussian noises
Clustering
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W
Organization
View more organizations