Constructing accurate similarity graph is an important process in graph-based clustering. However, traditional methods have three drawbacks, such as the inaccuracy of graph, vulnerability to noise and outliers, need for additional discretization process. In order eliminate these limitations, entropy regularized unsupervised clustering based on maximum correntropy criterion adaptive neighbors (E...