A Crossover-Imaged Clustering Algorithm with Bottom-Up Tree Architecture

doi:10.1109/FSKD.2008.652

淡江大學機構典藏 > 行政單位 > 軍訓室 > 會議論文 > Item 987654321/18160

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

題名:	A Crossover-Imaged Clustering Algorithm with Bottom-Up Tree Architecture
作者:	Chang, Chung-i;Lin, N.P.
貢獻者:	淡江大學軍訓室;淡江大學資訊工程學系
關鍵詞:	Bottom-up tree;Crossover image;Data Mining;Grid-based clustering;Significant Cell
日期:	2008-10-18
上傳時間:	2009-08-13 11:26:38 (UTC+8)
出版者:	Institute of Electrical and Electronics Engineers(IEEE)
摘要:	The grid-based clustering algorithms are efficient with low computation time, but the size of the predefined grids and the threshold of the significant cells are seriously influenced their effects. The ADCC [1] and ACICA+ [2] are two new grid-based clustering algorithms. The ADCC algorithm uses axis-shifted strategy and cell clustering twice to reduce the influences of the size of the cells and inherits the advantage with the low time complexity. And the ACICA+ uses the crossover image of significant cells and just only one cell clustering. But the extension of original significant cell in one crossover image is not easy to find what else clusters it belongs to. The crossover-imaged clustering algorithm with bottom-up tree architecture, called CIC-BTA, is proposed to use bottom-up tree architecture to have the same results. The main idea of CIC-BTA algorithm is to use the bottom-up tree architecture to link the significant cells to be the pre-clusters and combine pre-clusters into one by using semi-significant cells The final set of clusters is the result.
關聯:	Fuzzy Systems and Knowledge Discovery, 2008. FSKD '08. Fifth International Conference on (Volume:2 ), pp.327-331
DOI:	10.1109/FSKD.2008.652
顯示於類別:	[軍訓室] 會議論文 [資訊工程學系暨研究所] 會議論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
A Crossover-Imaged Clustering Algorithm with Bottom-up Tree Architecture.pdf		262Kb	Adobe PDF	695	檢視/開啟
index.html		0Kb	HTML	771	檢視/開啟

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

TAIR相關文章

資料載入中.....