A New Gravitational Clustering Algorithm

The 2003 SIAM(Society for Industrial and Applied Mathematics) International Conference on Data Mining

Jonatan Gomez ; Dipankar Dasgupta ; Olfa Nasraoui

Others  :  http://www.siam.org/proceedings/datamining/2003/dm03_08GomezJ.pdf
PID  :  19040

来源: CEUR

【 摘 要 】

This paper presents a novel unsupervised robust clustering technique based on the Gravitational Law and the second Newton's motion Law. The technique automatically determines the number of clusters in the target data set. Basically, each data record in the source data set is considered as an object in the feature space. The objects are moved by using the gravitational force and the second motion law. Because the clusters define a disjoint collection of sets, an optimal disjoint set union-find structure is used to store and update the clusters that are being conformed by closest objects. The proposed technique is robust to noise, can be used to generate a partition of the data set at multiple resolution levels, and can also be used to extract to form a good summary of the data. Experiments with synthetic and real data were conducted to show the performance of the proposed clustering technique.