Clustering algorithm on basis of minimum spanning trees and initial clustering centers

Abstract

The invention discloses a clustering algorithm on the basis of minimum spanning trees and initial clustering centers. The clustering algorithm includes steps of S1, inputting to-be-clustered data setsD and category numbers K of the data sets D; S2, creating the minimum spanning trees T<D> of the data sets and computing geodesic distances between optional two nodes in each minimum spanning tree T<D>; S3, selecting the initial clustering centers; S4, creating the minimum spanning trees T of the initial clustering centers; S5, disconnecting K-1 edges of each minimum spanning tree T<D> of thecorresponding data set. The clustering algorithm has the advantages that minimum spanning tree clustering algorithms are combined with selection of the initial clustering centers, the to-be-deleted edges are constrained on paths between the initial clustering centers and can be accurately found by the aid of comprehensive values of the density and the distances of the upper edges for forming the paths, accordingly, the clustering accuracy can be further improved, and interference of noise in the data sets can be prevented.

Description

technical field [0001] The invention relates to the fields of machine learning and data mining, in particular to a clustering algorithm based on minimum spanning trees and initial cluster centers. Background technique [0002] The purpose of clustering is to discover object categories, so that objects in the same category are relatively similar, while objects belonging to different categories are not similar. Clustering is an active research topic in different fields such as pattern recognition, machine learning, and data mining. Various clustering algorithms have been proposed for different applications. [0003] The k-means clustering algorithm proposed by Forgy belongs to the partition-based clustering algorithm. Since the k-means algorithm depends on the selection of the initial cluster center and is sensitive to noise data, the clustering results using the k-means algorithm are easy There are problems such as local optimum and unstable clustering results. The hierarc...

AI Technical Summary

Problems solved by technology

[0007] In view of the above-mentioned defects of the prior art, the technical problem to be solved by the present invention is to determine the initial clustering center of the data set in combination with the geodesic distance between data points, so that the selection of the initial clustering center can better adapt to non-spherical data secondly, in the clustering algorithm based on the minimum spanning tree, the present invention limits the edge to be deleted to the path between the initial clustering centers, so that the clustering result is not disturbed by noise, and the accuracy of clustering is further improved

Images