| Summary: | Spectral clustering transforms the data clustering problem into a graph-partitioning problem and classifies data points by finding the optimal sub-graphs. Traditional spectral clustering algorithms use Gaussian kernel function to construct the similarity matrix, so they are sensitive to the selection of scale parameter. In addition, they need to randomly determine the initial cluster centers at the clustering stage and the clustering performance is not stable. Therefore, this paper presents an algorithm on the basis of message passing, which makes use of a density adaptive similarity measure, describing the relations between data points and obtaining high-quality cluster centers through message passing mechanism in AP clustering. The performance of clustering is optimized by this method. The experiments show that the proposed algorithm can effectively deal with the clustering problem of multi-scale datasets. Moreover, its clustering performance is very stable, and the clustering quality is better than traditional spectral clustering algorithm and k-means algorithm.
|
|---|
