The dynamic clusters method in nonhierarchical clustering |
| |
Authors: | E Diday |
| |
Affiliation: | (1) Institut de Recherche d'Informatique et d'Automatique, Domaine de Voluceau, Rocquencourt, France |
| |
Abstract: | Given a finite setE R
n, the problem is to find clusters (or subsets of similar points inE) and at the same time to find the most typical elements of this set. An original mathematical formulation is given to the problem. The proposed algorithm operates on groups of points, called samplings (samplings may be called multiple centers or cores); these samplings adapt and evolve into interesting clusters. Compared with other clustering algorithms, this algorithm requires less machine time and storage. We provide some propositions about nonprobabilistic convergence and a sufficient condition which ensures the decrease of the criterion. Some computational experiments are presented. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|