Noise-aware clustering based on maximum correntropy criterion and adaptive graph regularization

DOI10.1016/J.INS.2023.01.024MaRDI QIDQ6496114

Xinyu Li, Hui Fan, Jinglei Liu

Publication date: 2 May 2024

Published in: Information Sciences (Search for Journal in Brave)

zbMATH Keywords

maximum correntropy criterionhalf-quadratic optimizationsimilarity graphadaptive graph regularizationnoise-aware clustering

Mathematics Subject Classification ID

Statistics (62-XX) Computer science (68-XX)

Cites Work

• Algorithm AS 136: A K-Means Clustering Algorithm
• Maximum correntropy Kalman filter
• Leveraging maximum entropy and correlation on latent factors for learning representations
• Robust Matrix Completion via Maximum Correntropy Criterion and Half-Quadratic Optimization
• Correntropy-Induced Robust Low-Rank Hypergraph
• Learning the parts of objects by non-negative matrix factorization

This page was built for publication: Noise-aware clustering based on maximum correntropy criterion and adaptive graph regularization