Please use this identifier to cite or link to this item:
Title: Correntropy based graph regularized concept factorization for clustering
Authors: Peng, Siyuan
Ser, Wee
Chen, Badong
Sun, Lei
Lin, Zhiping
Keywords: Engineering::Electrical and electronic engineering
Engineering::Computer science and engineering
Issue Date: 2018
Source: Peng, S., Ser, W., Chen, B., Sun, L., & Lin, Z. (2018). Correntropy based graph regularized concept factorization for clustering. Neurocomputing, 316, 34-48. doi:10.1016/j.neucom.2018.07.049
Journal: Neurocomputing 
Abstract: 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.
ISSN: 0925-2312
DOI: 10.1016/j.neucom.2018.07.049
Rights: © 2018 Elsevier B.V. All rights reserved. This paper was published in Neurocomputing and is made available with permission of Elsevier B.V.
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:EEE Journal Articles

Files in This Item:
File Description SizeFormat 
Correntropy based graph regularized concept factorization for clustering.pdf2.37 MBAdobe PDFView/Open

Citations 20

Updated on Jan 30, 2023

Web of ScienceTM
Citations 20

Updated on Jan 23, 2023

Page view(s)

Updated on Feb 1, 2023

Download(s) 50

Updated on Feb 1, 2023

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.