Clustering by connection center evolution

10/19/2016
by   Xiurui Geng, et al.
0

The determination of cluster centers generally depends on the scale that we use to analyze the data to be clustered. Inappropriate scale usually leads to unreasonable cluster centers and thus unreasonable results. In this study, we first consider the similarity of elements in the data as the connectivity of nodes in an undirected graph, then present the concept of a connection center and regard it as the cluster center of the data. Based on this definition, the determination of cluster centers and the assignment of class are very simple, natural and effective. One more crucial finding is that the cluster centers of different scales can be obtained easily by the different powers of a similarity matrix and the change of power from small to large leads to the dynamic evolution of cluster centers from local (microscopic) to global (microscopic). Further, in this process of evolution, the number of categories changes discontinuously, which means that the presented method can automatically skip the unreasonable number of clusters, suggest appropriate observation scales and provide corresponding cluster results.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 7

page 9

10/23/2020

Quantizing Multiple Sources to a Common Cluster Center: An Asymptotic Analysis

We consider quantizing an Ld-dimensional sample, which is obtained by co...
12/11/2013

Fast Approximate K-Means via Cluster Closures

K-means, a simple and effective clustering algorithm, is one of the most...
03/16/2021

K-expectiles clustering

K-means clustering is one of the most widely-used partitioning algorithm...
07/04/2020

Cluster Prediction for Opinion Dynamics from Partial Observations

We present a Bayesian approach to predict the clustering of opinions for...
06/23/2014

Further heuristics for k-means: The merge-and-split heuristic and the (k,l)-means

Finding the optimal k-means clustering is NP-hard in general and many he...
06/12/2015

Leading Tree in DPCLUS and Its Impact on Building Hierarchies

This paper reveals the tree structure as an intermediate result of clust...
04/11/2018

Seed-Point Detection of Clumped Convex Objects by Short-Range Attractive Long-Range Repulsive Particle Clustering

Locating the center of convex objects is important in both image process...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.