Toward the modification of flower pollination algorithm in clustering-based image segmentation

被引:23
作者
Dhal, Krishna Gopal [1 ]
Galvez, Jorge [2 ]
Das, Sanjoy [3 ]
机构
[1] Midnapore Coll Autonomous, Dept Comp Sci & Applicat, Paschim Medinipur, India
[2] Univ Guadalajara, Dept Elect, CUCEI Av Revoluc 1500, Guadalajara, Jalisco, Mexico
[3] Univ Kalyani, Dept Engn & Technol Studies, Kalyani, Nadia, India
关键词
Optimization; Meta-heuristics; Classification; Histopathological image segmentation; PARTICLE SWARM OPTIMIZATION; DIFFERENTIAL EVOLUTION; CLASSIFICATION;
D O I
10.1007/s00521-019-04585-z
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Flower pollination algorithm (FPA) is a new bio-inspired optimization algorithm, which has shown an effective performance on solving many optimization problems. However, the effectiveness of FPA significantly depends on the balance achieved by the exploration and exploitation evolutionary stages. Since purely exploration procedure promotes non-accurate solutions, meanwhile, purely exploitation operation promotes sub-optimal solutions in the presence of multiple optima. In this study, three global search and two local search strategies have been designed to improve balance among evolutionary stages, increasing the efficiency and robustness of the original FPA methodology. Additionally, some parameter adaptation techniques are also incorporated in the proposed methodology. The modified FPA has been successfully applied for histopathological image segmentation problem. The experimental and computational effort results indicate its effectiveness over existing swarm intelligence algorithms and machine learning methods.
引用
收藏
页码:3059 / 3077
页数:19
相关论文
共 85 条
  • [1] Abdel-Raouf Osama, 2014, International Journal of Modern Education and Computer Science, V6, P38, DOI 10.5815/ijmecs.2014.03.05
  • [2] Abdel-Raoufi O., 2014, Adv Eng Technol Appl, V4, P1
  • [3] ANDERBERG MR, 1973, CLUSTER ANAL APPL, DOI DOI 10.1016/J.ENCONMAN.2015.02.042
  • [4] [Anonymous], 2013, Int J Optim Civil Eng
  • [5] Bansal J.C., 2011, Em 2011 Third World Congress on Nature and Biologically Inspired Computing, paginas, P633, DOI DOI 10.1109/NABIC.2011.6089659
  • [6] BLAKE CL, 1988, U CALIFORNIA IRVINE, DOI DOI 10.1016/J.IJEPES.2013.09.033
  • [7] Random forests
    Breiman, L
    [J]. MACHINE LEARNING, 2001, 45 (01) : 5 - 32
  • [8] Chaotic sequences to improve the performance of evolutionary algorithms
    Caponetto, R
    Fortuna, L
    Fazzino, S
    Xibilia, MG
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2003, 7 (03) : 289 - 304
  • [9] Chaotic local search algorithm
    Changkyu Choi
    Ju-Jang Lee
    [J]. Artificial Life and Robotics, 1998, 2 (1) : 41 - 47
  • [10] Cleary S, 1995, EDUCATIONAL INNOVATION IN ECONOMICS AND BUSINESS ADMINISTRATION, P108