A New Algorithm Makes It Faster to Find the Shortest Paths

A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the ...
IEEE

Clustering Algorithm by Boundary Detection Base on Entropy of KNN

Abstract: Clustering analysis has been widely applied in various fields, and boundary detection based clustering algorithms have shown effective performance. In this work, we propose a clustering ...
IEEE

A New Clustering Algorithm by Using Boundary Information

Abstract: In view of the shortcomings that many clustering algorithms such as K-means clustering algorithm are not suitable for the non-convex dataset and the Affinity Propagation (AP) algorithm may ...