Crossover-Imaged Clustering Algorithm with Bottom-up Tree Architecture

被引:1
|
作者
Chang, Chung-, I [1 ]
Lin, Nancy P. [2 ]
机构
[1] St Marys Med Nursing & Management Coll, Dept Informat Management, 100 Lane265,Sec 2,Sansing Rd, Sansing Township 266, Yilan County, Taiwan
[2] Tamkang Univ, Dept Comp Sci & Informat Engn, New Taipei 25137, Taiwan
来源
FIFTH INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, VOL 2, PROCEEDINGS | 2008年
关键词
D O I
10.1109/FSKD.2008.652
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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 preclusters and combine pre-clusters into one by using semi-significant cells The final set of clusters is the result.
引用
收藏
页码:327 / +
页数:3
相关论文
共 50 条
  • [1] An Adaptive Crossover-imaged Clustering Algorithm
    Lin, Nancy P.
    Chang, Chung-, I
    Chueh, Hao-En
    Chen, Hung-Jen
    Hao, Wei-Hua
    NEW ADVANCES IN SIMULATION, MODELLING AND OPTIMIZATION (SMO '07), 2007, : 213 - +
  • [2] An axis-shifted crossover-imaged clustering algorithm
    Lin, Nancy P.
    Chang, Chung-I.
    Jan, Nien-Yi
    Chueh, Hao-En
    Chen, Hung-Jen
    Hao, Wei-Hua
    WSEAS Transactions on Systems, 2008, 7 (03): : 175 - 184
  • [3] A BOTTOM-UP HIERARCHICAL CLUSTERING ALGORITHM WITH INTERSECTION POINTS
    Nazari, Zahra
    Nazari, Masooma
    Kang, Dongshik
    INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2019, 15 (01): : 291 - 304
  • [4] BOTTOM-UP TREE ACCEPTORS
    HEMERIK, C
    KATOEN, JP
    SCIENCE OF COMPUTER PROGRAMMING, 1989, 13 (01) : 51 - 72
  • [5] Bottom-up tree acceptors
    Hemerik, C., 1600, (13):
  • [6] IBUSCA: A grid-based bottom-up subspace clustering algorithm
    Glomba, Michal
    Markowska-Kaczmar, Urszula
    ISDA 2006: SIXTH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS DESIGN AND APPLICATIONS, VOL 1, 2006, : 671 - 676
  • [7] Bottom-up Evolutionary Subspace Clustering
    Vahdat, Ali
    Heywood, Malcolm
    Zincir-Heywood, Nur
    2010 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2010,
  • [8] Bottom-Up derivatives of tree expressions
    Attou, Samira
    Mignot, Ludovic
    Ziadi, Djelloul
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2021, 55
  • [9] ALTERNATING BOTTOM-UP TREE RECOGNIZERS
    SALOMAA, K
    LECTURE NOTES IN COMPUTER SCIENCE, 1986, 214 : 158 - 171
  • [10] Bottom-Up Tree Automata with Term Constraints
    Reuss, Andreas
    Seidl, Helmut
    LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, 2010, 6397 : 581 - 593