Kaymak, U and Setnes, M 2002, 'Fuzzy clustering with volume prototypes and adaptive cluster merging' , IEEE Transactions on Fuzzy Systems, 10 (6) , pp. 705-712.

Preview

PDF (Publisher version) Download (431kB) | Preview

Abstract

Two extensions to the objective function-based fuzzy clustering are proposed. First, the (point) prototypes are extended to hypervolumes, whose size can be fixed or can be determined automatically from the data being clustered. It is shown that clustering with hypervolume prototypes can be formulated as the minimization of an objective function. Second, a heuristic cluster merging step is introduced where the similarity among the clusters is assessed during optimization. Starting with an overestimation of the number of clusters in the data, similar clusters are merged in order to obtain a suitable partitioning. An adaptive threshold for merging is proposed. The extensions proposed are applied to Gustafson–Kessel and fuzzy c-means algorithms, and the resulting extended algorithm is given. The properties of the new algorithm are illustrated by various examples.

Actions (login required)