English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 57310/90913 (63%)
造访人次 : 13001123      在线人数 : 319
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/37319

    题名: An Adaptable Deflect and Conquer Clustering Algorithm
    作者: Lin, Nancy P.;Chang, Chung-I;Pan, Chao-lung
    贡献者: 淡江大學資訊工程學系;淡江大學軍訓室
    关键词: Data Mining;Clustering Algorithm;Grid-based;Significant Cell;Deflected Grid
    日期: 2007-04
    上传时间: 2010-01-11 13:02:38 (UTC+8)
    出版者: World Scientific and Engineering Academy and Society (WSEAS)
    摘要: The grid-based clustering algorithm is an efficient clustering algorithm, but the effect of the algorithm is seriously influenced by the size of the predefined grids and the threshold of the significant cells. Thus, in this paper, to reduce the influences of the size of the predefined grids and the threshold of the significant cells, we adopt deflect and conquer techniques to propose a new grid-based clustering algorithm, which is called Adaptable Deflect and Conquer Clustering (ADCC) algorithm. The idea of ADCC is to utilize the predefined grids and predefined threshold to identify the significant cells, by which nearby cells that are also significant can be merged to develop a cluster in the first place. Next, the modified grids which are deflected to half size of the grid are used to identify the significant cells again. Finally, the new generated significant cells and the initial significant cells are merged so as to offset the round-off error and improve the precision of clustering task. And we verify by experiment that the performance of our new grid-based clustering algorithm, ADCC, is good.
    關聯: Proceedings of the 6th WSEAS International Conference on Applied Computer Science (ACOS'07), pp.155-159
    显示于类别:[資訊工程學系暨研究所] 會議論文
    [軍訓室] 會議論文


    档案 大小格式浏览次数



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