A NOVEL CLUSTERING ALGORITHM BASED ON P SYSTEMS

被引:0
作者
Jiang, Yang [1 ]
Peng, Hong [1 ]
Huang, Xiaoli [1 ]
Zhang, Jiarong [1 ]
Shi, Peng [2 ,3 ]
机构
[1] Xihua Univ, Ctr Radio Adm & Technol Dev, Chengdu 610039, Sichuan, Peoples R China
[2] Harbin Engn Univ, Coll Automat, Harbin 150001, Heilongjiang, Peoples R China
[3] Victoria Univ, Sch Engn & Sci, Melbourne, Vic 8001, Australia
来源
INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL | 2014年 / 10卷 / 02期
基金
中国国家自然科学基金;
关键词
Membrane computing; Tissue-like P systems; Clustering algorithm; Simulated annealing; K-means;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Membrane computing (known as P systems) is a novel class of distributed parallel computing models. In this paper, a partition-based clustering algorithm under the framework of membrane computing is proposed. The clustering algorithm is based on a tissue-like P system, which is used to exploit the optimal cluster centers for a data set. Each object in the tissue-like P system represents a group of candidate cluster centers and is evolved through simulated annealing mechanism and mutation mechanism. Meanwhile, communication rules are used to exchange and share the objects between different elementary membranes and between elementary membranes and the environment. The proposed clustering algorithm is evaluated over two artificial data sets and two real-life data sets and is further compared with k-means algorithm and GA-based k-means algorithm respectively. The comparison results reveal the superiority of the proposed clustering algorithm in terms of clustering quality and stability.
引用
收藏
页码:753 / 765
页数:13
相关论文
共 21 条
[1]   Simulated annealing using a Reversible Jump Markov Chain Monte Carlo algorithm for fuzzy clustering [J].
Bandyopadhyay, S .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2005, 17 (04) :479-490
[2]   GAPS: A clustering method using a new point symmetry-based distance measure [J].
Bandyopadhyay, Sanghamitra ;
Saha, Sriparna .
PATTERN RECOGNITION, 2007, 40 (12) :3430-3451
[3]   The use of multiple measurements in taxonomic problems [J].
Fisher, RA .
ANNALS OF EUGENICS, 1936, 7 :179-188
[4]   Tissue P systems with channel states [J].
Freund, R ;
Paun, G ;
Pérez-Jiménez, MJ .
THEORETICAL COMPUTER SCIENCE, 2005, 330 (01) :101-116
[5]  
Han J., 2011, DATA MINING CONCEPTS, V3, DOI DOI 10.1016/B978-0-12-381479-1.00005-8
[6]  
Ionescu M, 2006, FUND INFORM, V71, P279
[7]   An efficient k-means clustering algorithm:: Analysis and implementation [J].
Kanungo, T ;
Mount, DM ;
Netanyahu, NS ;
Piatko, CD ;
Silverman, R ;
Wu, AY .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2002, 24 (07) :881-892
[8]   OPTIMIZATION BY SIMULATED ANNEALING [J].
KIRKPATRICK, S ;
GELATT, CD ;
VECCHI, MP .
SCIENCE, 1983, 220 (4598) :671-680
[9]   A genetic algorithm that exchanges neighboring centers for k-means clustering [J].
Laszlo, Michael ;
Mukherjee, Sumitra .
PATTERN RECOGNITION LETTERS, 2007, 28 (16) :2359-2366
[10]   Genetic algorithm-based clustering technique [J].
Maulik, U ;
Bandyopadhyay, S .
PATTERN RECOGNITION, 2000, 33 (09) :1455-1465