An improved IWO-FCM Data Mining Algorithm

被引:0
|
作者
Zhao Xiaoqiang [1 ]
Zhou Jinhu [1 ]
机构
[1] Gansu Mfg Informationizat Engn Technol Res Ctr, Lanzhou 730050, Peoples R China
关键词
Data mining; IWO-FCM; Chaos; Differential evolution algorithm; OPTIMIZATION;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The FCM algorithm based on invasive weed optimization algorithm (IWO-FCW) has stronger global optimization ability and higher clustering precision than the basic FCM algorithm, but the IWO-FCW algorithm exists some questions that the convergence become slow and the clustering precision is not high for high and complex testing data sets. So an improved IWO-FCM algorithm is proposed in this paper. This algorithm uses the chaos sequence to initialize the initial population in order to improve initial solution (seed) quality, then the crossover, mutation and part selection operation of the differential evolution algorithm are applied in the spatial distribution and selection process of IWO-FCM algorithm to keep the population diversity and enhance global optimization ability. By testing multiple high-dimensional data sets, the simulation results show that the proposed algorithm has faster convergence speed and higher optimization precision than FCM algorithm and IWO-FCM algorithm.
引用
收藏
页码:4997 / 5001
页数:5
相关论文
共 7 条
  • [1] [Anonymous], 2007, TSINGHUA SCI TECHNOL, DOI DOI 10.1016/S1007-0214(07)70102-5
  • [2] [Anonymous], Pattern Recognition with Fuzzy Objective Function Algorithms
  • [3] Basak A, 2010, LECT NOTES COMPUT SC, V6466, P630, DOI 10.1007/978-3-642-17563-3_74
  • [4] A novel numerical optimization algorithm inspired from weed colonization
    Mehrabian, A. R.
    Lucas, C.
    [J]. ECOLOGICAL INFORMATICS, 2006, 1 (04) : 355 - 366
  • [5] Multimodal optimization by artificial weed colonies enhanced with localized group search optimizers
    Roy, Subhrajit
    Islam, Sk Minhazul
    Das, Swagatam
    Ghosh, Saurav
    [J]. APPLIED SOFT COMPUTING, 2013, 13 (01) : 27 - 46
  • [6] Analytical and numerical evaluation of the suppressed fuzzy c-means algorithm: a study on the competition in c-means clustering models
    Szilagyi, Laszlo
    Szilagyi, Sandor M.
    Benyo, Zoltan
    [J]. SOFT COMPUTING, 2010, 14 (05) : 495 - 505
  • [7] An enhanced possibilistic C-Means clustering algorithm EPCM
    Xie, Zhenping
    Wang, Shitong
    Chung, F. L.
    [J]. SOFT COMPUTING, 2008, 12 (06) : 593 - 611