Suppr超能文献

基于核相关熵的半监督概念分解与自适应邻居聚类

Correntropy based semi-supervised concept factorization with adaptive neighbors for clustering.

作者信息

Peng Siyuan, Yang Zhijing, Nie Feiping, Chen Badong, Lin Zhiping

机构信息

School of Information Engineering, Guangdong University of Technology, 510006, China.

School of Information Engineering, Guangdong University of Technology, 510006, China.

出版信息

Neural Netw. 2022 Oct;154:203-217. doi: 10.1016/j.neunet.2022.07.021. Epub 2022 Jul 21.

Abstract

Concept factorization (CF) has shown the effectiveness in the field of data clustering. In this paper, a novel and robust semi-supervised CF method, called correntropy based semi-supervised concept factorization with adaptive neighbors (CSCF), is proposed with improved performance in clustering applications. Specifically, on the one hand, the CSCF method adopts correntropy as the cost function to increase the robustness for non-Gaussian noise and outliers, and combines two different types of supervised information simultaneously for obtaining a compact low-dimensional representation of the original data. On the other hand, CSCF assigns the adaptive neighbors for each data point to construct a good data similarity matrix for reducing the sensitiveness of data. Moreover, a generalized version of CSCF is derived for enlarging the clustering application ranges. Analysis is also presented for the relationship of CSCF with several typical CF methods. Experimental results have shown that CSCF has better clustering performance than several state-of-the-art CF methods.

摘要

概念分解(CF)已在数据聚类领域展现出有效性。本文提出了一种新颖且稳健的半监督CF方法,称为基于核相关熵的带自适应邻域的半监督概念分解(CSCF),其在聚类应用中具有改进的性能。具体而言,一方面,CSCF方法采用核相关熵作为代价函数以增强对非高斯噪声和离群值的鲁棒性,并同时结合两种不同类型的监督信息来获得原始数据的紧凑低维表示。另一方面,CSCF为每个数据点分配自适应邻域以构建良好的数据相似性矩阵,从而降低数据的敏感性。此外,还推导了CSCF的广义版本以扩大聚类应用范围。同时也分析了CSCF与几种典型CF方法之间的关系。实验结果表明,CSCF比几种当前最先进的CF方法具有更好的聚类性能。

相似文献

3
Pairwise constrained concept factorization for data representation.用于数据表示的成对约束概念分解
Neural Netw. 2014 Apr;52:1-17. doi: 10.1016/j.neunet.2013.12.007. Epub 2013 Dec 27.
6
ECCA: Efficient Correntropy-Based Clustering Algorithm With Orthogonal Concept Factorization.ECCA:基于正交概念分解的高效核熵聚类算法
IEEE Trans Neural Netw Learn Syst. 2023 Oct;34(10):7377-7390. doi: 10.1109/TNNLS.2022.3142806. Epub 2023 Oct 5.
9
Robust large-scale clustering based on correntropy.基于相关熵的鲁棒大规模聚类。
PLoS One. 2022 Nov 4;17(11):e0277012. doi: 10.1371/journal.pone.0277012. eCollection 2022.
10
Concept Factorization With Adaptive Neighbors for Document Clustering.概念因子化与自适应邻居在文档聚类中的应用。
IEEE Trans Neural Netw Learn Syst. 2018 Feb;29(2):343-352. doi: 10.1109/TNNLS.2016.2626311. Epub 2016 Nov 18.

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验