English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 49350/84015 (59%)
造访人次 : 7266838      在线人数 : 53
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/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
    DOI: 
    显示于类别:[軍訓室] 期刊論文
    [資訊工程學系暨研究所] 期刊論文

    文件中的档案:

    档案 大小格式浏览次数
    index.html0KbHTML206检视/开启

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

    TAIR相关文章

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