Clustering by connection center evolution. (February 2020)

• Record Type: Journal Article
• Authors: Geng, Xiurui; Tang, Hairong
• Is Part Of: Pattern recognition. Volume 98(2020:Feb.)
• Publication Date: 2020-02
• Subjects: Clustering center -- Clustering -- Connected graph -- Connectivity; Pattern perception -- Periodicals; Perception des structures -- Périodiques; Patroonherkenning; 006.4
• DOI: 10.1016/j.patcog.2019.107063
• Languages: English
• ISSNs: 0031-3203

Abstract

Highlights: Present a novel and original concept of clustering center. Present a novel and original clustering rule. The implementation of the presented algorithm involves only the calculation of matrix power, and does not require any manual interference. The presented algorithm is very simple, practical and easy to operate. Abstract: The determination of clustering centers generally depends on the observation scale that we use to analyze the data to be clustered. An inappropriate scale usually leads to unreasonable clustering centers and thus unreasonable results. In this study, we first consider the similarity of elements in the data as the connectivity of vertices in an undirected graph, then present the concept of connection center and regard it as the clustering center of the data. Based on this definition, the determination of clustering centers and the assignment of class become very simple, natural and effective. One more crucial finding is that the clustering centers of different scales can be obtained easily by different powers of a similarity matrix, and the change of power from small to large leads to the dynamic evolution of clustering centers from local (microscopic) to global (macroscopic). Further, in this process of evolution, the number of clusters changes discontinuously, which means that the presented method can automatically skip the unreasonable number of clusters, suggest appropriate observation scales and provide corresponding clustering results.