One-step unsupervised clustering based on information theoretic metric and adaptive neighbor manifold regularization

• Published in: Engineering applications of artificial intelligence Vol. 120; p. 105880
• Main Authors: Li, Xinyu, Fan, Hui, Liu, Jinglei
• Format: Journal Article
• Language: English
• Published: Elsevier Ltd 01.04.2023
• Subjects: Adaptive graph regularization; Half-quadratic optimization; Information entropy; Laplacian rank constraint; Maximum correntropy criterion; Maximum correntropy criterion; Half-quadratic optimization; Laplacian rank constraint; Information entropy; Adaptive graph regularization

Graph-based clustering is a basic subject in the field of machine learning, but most of them still have the following deficiencies. First, the extra discretization procedures leads to instability of the algorithm. In addition, the traditional method of constructing similarity graphs is based on the...