Clustering via C-spheres Agglomeration
Kun-Chih Tsai, Ren-Da Rau, Jung-Hua Wang · 2002
The authors present a novel clustering approach called C-spheres Agglomeration (CA) that need not pre-specify the number of clusters; the input partition is autonomously determined by the input nature. The input data set first undergoes a preprocess and is partitioned into arbitrarily specified M/sub f/ subsets, each subset contains a portion of input items represented by a unique prototype c/sub j/, j=1,2,.. M/sub f/. Following the pre-process, the set {c/sub j/, j=1,2,.. M/sub f/} undergoes an iterative agglomeration process to extract clusters. Our idea to clustering is to treat each prototype c/sub j/ as a neutral particle in the feature space with mass m/sub j/ = number of input vectors represented by c/sub j/. Also associated with each c/sub j/ is a C-sphere, the radius of which is defined in accordance with a local density measure around c/sub j/. Prototypes are considered as neighbors if their C-spheres intersect. During one agglomeration iteration, every C-sphere is required to move directly to the corresponding centroid of neighborhoods.