English  |  正體中文  |  简体中文  |  Items with full text/Total items : 50124/85142 (59%)
Visitors : 7911285      Online Users : 60
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    淡江大學機構典藏 > 行政單位 > 軍訓室 > 會議論文 >  Item 987654321/18160
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/18160


    Title: A Crossover-Imaged Clustering Algorithm with Bottom-Up Tree Architecture
    Authors: Chang, Chung-i;Lin, N.P.
    Contributors: 淡江大學軍訓室;淡江大學資訊工程學系
    Keywords: Bottom-up tree;Crossover image;Data Mining;Grid-based clustering;Significant Cell
    Date: 2008-10-18
    Issue Date: 2009-08-13 11:26:38 (UTC+8)
    Publisher: Institute of Electrical and Electronics Engineers(IEEE)
    Abstract: 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.
    Relation: Fuzzy Systems and Knowledge Discovery, 2008. FSKD '08. Fifth International Conference on (Volume:2 ), pp.327-331
    DOI: 10.1109/FSKD.2008.652
    Appears in Collections:[軍訓室] 會議論文
    [資訊工程學系暨研究所] 會議論文

    Files in This Item:

    File Description SizeFormat
    A Crossover-Imaged Clustering Algorithm with Bottom-up Tree Architecture.pdf262KbAdobe PDF406View/Open
    index.html0KbHTML388View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


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