Return
A multi-prototype clustering algorithm
DOI:10.1016/j.patcog.2008.09.015.png)
Abstract
En 中文
Clustering is an important unsupervised learning technique widely used to discover the inherent structure of a given data set. Some existing clustering algorithms uses single prototype to represent each cluster, which may not adequately model the clusters Of arbitrary shape and size and hence limit the clustering performance on complex data structure. This paper proposes a clustering algorithm to represent one cluster by multiple prototypes. The squared-error clustering is used to produce a number of prototypes to locate the regions of high density because of its low computational cost and yet good performance. A separation measure is proposed to evaluate how well two prototypes are separated. Multiple prototypes with small separations are grouped into a given number of clusters in the agglomerative method. New prototypes are iteratively added to improve the poor cluster separations. As a result, the proposed algorithm can discover the clusters of complex structure with robustness to initial settings. Experimental results on both synthetic and real data sets demonstrate the effectiveness of the proposed clustering algorithm. (C) 2008 Elsevier Ltd. All rights reserved.
Keywords:
Data clustering
Cluster prototype
Separation measure
Squared-error clustering
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
Cited Papers
Acute toxicity of pyrethroid-based insecticides in the Neotropical freshwater fish Brycon amazonicus
The effect of CSR on acquirer returns of cross-border M&As in an emerging market – a bane or a boom?
Dynamic model and input shaping control of a flexible link parallel manipulator considering the exact boundary conditions
Robotica
IF0

