Robust Clustering based on Winner-Population Markov Chain

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

請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/37160

題名:	Robust Clustering based on Winner-Population Markov Chain
作者:	Yang, Fu-wen;Lin, Hwei-jen;Wang, Patrick, S. P.;Wu, Hung-hsuan
貢獻者:	淡江大學資訊工程學系
日期:	2006-08-20
上傳時間:	2010-01-11 12:30:56 (UTC+8)
摘要:	In this paper, we propose an unsupervised genetic clustering algorithm, which produces a new chromosome without any conventional genetic operators, and instead according to the gene reproducing probabilities determined by Markov chain modeling. Selection of cluster centers from the dataset enables construction of a look-up table that saves the distances between all pairs of data points. The experimental results show that the proposed algorithm not only solves the premature problem to provide a more stable clustering performance in terms of number of clusters and clustering results, but also improves the time efficiency
關聯:	Proceedings of the 18th International Conference on Pattern Recognition (ICPR2006), pp.589-592
DOI:	10.1109/ICPR.2006.1002
顯示於類別:	[資訊工程學系暨研究所] 會議論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
index.html		0Kb	HTML	299	檢視/開啟
Robust Clustering based on Winner-Population Markov Chain.pdf		135Kb	Adobe PDF	260	檢視/開啟

在機構典藏中所有的資料項目都受到原著作權保護.

TAIR相關文章