An Extended Affinity Propagation Clustering Method Based on Different Data Density Types

Affinity propagation (AP) algorithm, as a novel clustering method, does not require the users to specify the initial cluster centers in advance, which regards all data points as potential exemplars (cluster centers) equally and groups the clusters totally by the similar degree among the data points....

Full description

Bibliographic Details
Main Authors: XiuLi Zhao, WeiXiang Xu
Format: Article
Language:English
Published: Hindawi Limited 2015-01-01
Series:Computational Intelligence and Neuroscience
Online Access:http://dx.doi.org/10.1155/2015/828057
id doaj-9baadc8ebfd9403d815656c1536b5819
record_format Article
spelling doaj-9baadc8ebfd9403d815656c1536b58192020-11-24T21:05:13ZengHindawi LimitedComputational Intelligence and Neuroscience1687-52651687-52732015-01-01201510.1155/2015/828057828057An Extended Affinity Propagation Clustering Method Based on Different Data Density TypesXiuLi Zhao0WeiXiang Xu1State Key Laboratory of Rail Traffic Control and Safety, Beijing 100044, ChinaSchool of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, ChinaAffinity propagation (AP) algorithm, as a novel clustering method, does not require the users to specify the initial cluster centers in advance, which regards all data points as potential exemplars (cluster centers) equally and groups the clusters totally by the similar degree among the data points. But in many cases there exist some different intensive areas within the same data set, which means that the data set does not distribute homogeneously. In such situation the AP algorithm cannot group the data points into ideal clusters. In this paper, we proposed an extended AP clustering algorithm to deal with such a problem. There are two steps in our method: firstly the data set is partitioned into several data density types according to the nearest distances of each data point; and then the AP clustering method is, respectively, used to group the data points into clusters in each data density type. Two experiments are carried out to evaluate the performance of our algorithm: one utilizes an artificial data set and the other uses a real seismic data set. The experiment results show that groups are obtained more accurately by our algorithm than OPTICS and AP clustering algorithm itself.http://dx.doi.org/10.1155/2015/828057
collection DOAJ
language English
format Article
sources DOAJ
author XiuLi Zhao
WeiXiang Xu
spellingShingle XiuLi Zhao
WeiXiang Xu
An Extended Affinity Propagation Clustering Method Based on Different Data Density Types
Computational Intelligence and Neuroscience
author_facet XiuLi Zhao
WeiXiang Xu
author_sort XiuLi Zhao
title An Extended Affinity Propagation Clustering Method Based on Different Data Density Types
title_short An Extended Affinity Propagation Clustering Method Based on Different Data Density Types
title_full An Extended Affinity Propagation Clustering Method Based on Different Data Density Types
title_fullStr An Extended Affinity Propagation Clustering Method Based on Different Data Density Types
title_full_unstemmed An Extended Affinity Propagation Clustering Method Based on Different Data Density Types
title_sort extended affinity propagation clustering method based on different data density types
publisher Hindawi Limited
series Computational Intelligence and Neuroscience
issn 1687-5265
1687-5273
publishDate 2015-01-01
description Affinity propagation (AP) algorithm, as a novel clustering method, does not require the users to specify the initial cluster centers in advance, which regards all data points as potential exemplars (cluster centers) equally and groups the clusters totally by the similar degree among the data points. But in many cases there exist some different intensive areas within the same data set, which means that the data set does not distribute homogeneously. In such situation the AP algorithm cannot group the data points into ideal clusters. In this paper, we proposed an extended AP clustering algorithm to deal with such a problem. There are two steps in our method: firstly the data set is partitioned into several data density types according to the nearest distances of each data point; and then the AP clustering method is, respectively, used to group the data points into clusters in each data density type. Two experiments are carried out to evaluate the performance of our algorithm: one utilizes an artificial data set and the other uses a real seismic data set. The experiment results show that groups are obtained more accurately by our algorithm than OPTICS and AP clustering algorithm itself.
url http://dx.doi.org/10.1155/2015/828057
work_keys_str_mv AT xiulizhao anextendedaffinitypropagationclusteringmethodbasedondifferentdatadensitytypes
AT weixiangxu anextendedaffinitypropagationclusteringmethodbasedondifferentdatadensitytypes
AT xiulizhao extendedaffinitypropagationclusteringmethodbasedondifferentdatadensitytypes
AT weixiangxu extendedaffinitypropagationclusteringmethodbasedondifferentdatadensitytypes
_version_ 1716769624550277120