A Deflected Grid-based Algorithm for Clustering Analysis

doi:無

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

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/17392

Title:	A Deflected Grid-based Algorithm for Clustering Analysis
Authors:	Lin, Nancy P.;Chang, Chung-i;Chueh, Hao-En;Chen, Hung-jen;Hao, Wei-hua
Contributors:	淡江大學軍訓室
Keywords:	Data Mining;Clustering Algorithm;Grid-based Clustering;Significant Cell;Grid Structure
Date:	2008-04
Issue Date:	2013-05-31 11:42:21 (UTC+8)
Publisher:	Athens: The World Scientific and Engineering Academy and Society
Abstract:	The grid-based clustering algorithm, which partitions the data space into a finite number of cells to form a grid structure and then performs all clustering operations on this obtained grid structure, is an efficient clustering algorithm, but its effect is seriously influenced by the size of the cells. To cluster efficiently and simultaneously, to reduce the influences of the size of the cells, a new grid-based clustering algorithm, called DGD, is proposed in this paper. The main idea of DGD algorithm is to deflect the original grid structure in each dimension of the data space after the clusters generated from this original structure have been obtained. The deflected grid structure can be considered a dynamic adjustment of the size of the original cells, and thus, the clusters generated from this deflected grid structure can be used to revise the originally obtained clusters. The experimental results verify that, indeed, the effect of DGD algorithm is less influenced by the size of the cells than other grid-based ones.
Relation:	WSEAS Transactions on Computers 7(4), pp125-132
DOI:	無
Appears in Collections:	[軍訓室] 期刊論文 [資訊工程學系暨研究所] 期刊論文

Files in This Item:

File	Size	Format
index.html	0Kb	HTML	287	View/Open

Loading...