An Improved Unsupervised Clustering Algorithm based on Population Markov Chain

淡江大學機構典藏 > 工學院 > 資訊工程學系暨研究所 > 期刊論文 > Item 987654321/45264

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/45264

题名:	An Improved Unsupervised Clustering Algorithm based on Population Markov Chain
作者:	Yang, Fu-Wen;Lin, Hwei-Jen;Yen, Shwu-Huey
贡献者:	淡江大學資訊工程學系
关键词:	Unsupervised clustering;genetic algorithms;population Markov chain;cluster validity;Davies-Bouldin index
日期:	2007
上传时间:	2010-03-26 18:53:51 (UTC+8)
出版者:	Calgary: ACTA Press
摘要:	GA-based clustering approaches have the advantage of automatically determining the optimal number of clusters. In a previous work, we proposed an efficient GA-based clustering algorithm, the PMCC method, and compared it with a representative GA-based clustering algorithm, the GCUK method, to prove its efficiency and effectiveness. In this paper we modify this PMCC method to obtain an improved version: the WPMCC method. This modification prevents premature convergence problem caused in the PMCC method while maintaining the advantage of the PMCC method. The experimental results show that the proposed algorithm not only solves the problem of premature convergence, thereby providing a more stable clustering performance in terms of number of clusters and clustering results, but it also improves the efficiency in terms of time. [PUBLICATION ABSTRACT]
關聯:	International Journal of Computers and Applications 29(3), pp.253-258
显示于类别:	[資訊工程學系暨研究所] 期刊論文

文件中的档案:

档案	大小	格式	浏览次数
index.html	0Kb	HTML	392	检视/开启

在機構典藏中所有的数据项都受到原著作权保护.

TAIR相关文章