基于流行距离的聚类算法和其在极光分类中的应用.pdf

Computer Science and Application 计算机科学与应用, 2016, 6(5), 303-316 Published Online May 2016 in Hans. /journal/csa /10.12677/csa.2016.65037 Clustering Algorithm and Its Application in the Classification of Aurora Based on the Manifold Distance Yangzi Sun, Xuan Wang School of Physics and Information Technology, Shaanxi Normal University, Xi’an Shaanxi th th st Received: May 10 , 2016; accepted: May 28 , 2016; published: May 31 , 2016 Copyright © 2016 by authors and Hans Publishers Inc. This work is licensed under the Creative Commons Attribution International License (CC BY). /licenses/by/4.0/ Abstract This paper presents a new Spectral clustering analysis algorithm based on the unsupervised learning. Spectral clustering algorithm has its own unique advantage. For example, it can be clustered in any irregular shape of the sample space, but also be obtained the optimal solution in the global. The article prefers to use the clustering algorithm of the similarity measure as the breakthrough point to improve the traditional similarity measure. I use the manifold distance as the similarity measure instead of the Euclidean distance on the basis of the traditional spectral clustering algorithm (NJW-SC). On the basis the object set and the sample clustering can be clus- tered. After I set the experimental comparison with the new algorithm and K-means algorithm, traditional spectral clustering algorithm (NJW-SC), the fuzzy clustering algorithm (FCM) on artifi- cial data set, it can be concluded that the new algorithm has been achieved good results in the convex shape of the data sets and on the glob