English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 62637/95499 (66%)
造訪人次 : 3026349      線上人數 : 366
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/17392

    題名: A Deflected Grid-based Algorithm for Clustering Analysis
    作者: Lin, Nancy P.;Chang, Chung-i;Chueh, Hao-En;Chen, Hung-jen;Hao, Wei-hua
    貢獻者: 淡江大學軍訓室
    關鍵詞: Data Mining;Clustering Algorithm;Grid-based Clustering;Significant Cell;Grid Structure
    日期: 2008-04
    上傳時間: 2013-05-31 11:42:21 (UTC+8)
    出版者: Athens: The World Scientific and Engineering Academy and Society
    摘要: 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.
    關聯: WSEAS Transactions on Computers 7(4), pp125-132
    顯示於類別:[軍訓室] 期刊論文
    [資訊工程學系暨研究所] 期刊論文


    檔案 大小格式瀏覽次數



    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋