4.7 Article

ITGO: Invasive tumor growth optimization algorithm

期刊

APPLIED SOFT COMPUTING
卷 36, 期 -, 页码 670-698

出版社

ELSEVIER
DOI: 10.1016/j.asoc.2015.07.045

关键词

Invasive tumor growth; Meta-heuristic algorithm; Levy flight; Swarm intelligence; Evolutionary computation

资金

  1. National Natural Science Foundation [61070092/F020504]
  2. building of strong Guangdong Province for Chinese Medicine Scientific Research [20141165]
  3. Humanities and social science fund project for Guangdong Pharmaceutical University [RWSK201409]
  4. NSFC, Research on reasoning of behavior trust for resisting collusive reputation attack [71401045]
  5. GuangDong Provincial Natural fund, Ukraine Senate Xingnao neuroprotective effect mechanism of dynamic network based on network pharmacology [2014A030313585]
  6. Guangdong Province Youth Innovation Talent Project, based on the cognitive rules of the semi supervised key algorithm and its cancer pattern recognition [2014KQNCX139]
  7. Major Science And Technology project of Guangdong province [2014B010112006]
  8. Guangdong Natural Science Foundation, major basic research and training talents project

向作者/读者索取更多资源

This paper proposes a new optimization algorithm named ITGO (Invasive Tumor Growth Optimization) algorithm based on the principle of invasive tumor growth. The study of tumor growth mechanism shows that each cell of tumor strives for the nutrient in their microenvironment to grow and proliferate. In ITGO algorithm, tumor cells were divided into three categories: proliferative cells, quiescent cells and dying cells. The cell movement relies on the chemotaxis, random walk of motion and interaction with other cells in different categories. Invasive behaviors of proliferative cells and quiescent cells are simulated by levy flight and dying cells are simulated through interaction with proliferative cells and quiescent cells. In order to test the effectiveness of ITGO algorithm, 50 functions from CEC2005, CEC2008, CEC2010 and a support vector machine (SVM) parameter optimization problem were used to compare ITGO with other well-known heuristic optimization methods. Statistical analysis using Friedman test and Wilcoxon signed-rank statistical test with Bonferroni-Holm correction demonstrates that the ITGO algorithm is better in solving global optimization problems in comparison to the other meta-heuristic algorithms. (C) 2015 Elsevier B.V. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据