IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0173516.html
   My bibliography  Save this article

An improved chaotic fruit fly optimization based on a mutation strategy for simultaneous feature selection and parameter optimization for SVM and its applications

Author

Listed:
  • Fei Ye
  • Xin Yuan Lou
  • Lin Fu Sun

Abstract

This paper proposes a new support vector machine (SVM) optimization scheme based on an improved chaotic fly optimization algorithm (FOA) with a mutation strategy to simultaneously perform parameter setting turning for the SVM and feature selection. In the improved FOA, the chaotic particle initializes the fruit fly swarm location and replaces the expression of distance for the fruit fly to find the food source. However, the proposed mutation strategy uses two distinct generative mechanisms for new food sources at the osphresis phase, allowing the algorithm procedure to search for the optimal solution in both the whole solution space and within the local solution space containing the fruit fly swarm location. In an evaluation based on a group of ten benchmark problems, the proposed algorithm’s performance is compared with that of other well-known algorithms, and the results support the superiority of the proposed algorithm. Moreover, this algorithm is successfully applied in a SVM to perform both parameter setting turning for the SVM and feature selection to solve real-world classification problems. This method is called chaotic fruit fly optimization algorithm (CIFOA)-SVM and has been shown to be a more robust and effective optimization method than other well-known methods, particularly in terms of solving the medical diagnosis problem and the credit card problem.

Suggested Citation

  • Fei Ye & Xin Yuan Lou & Lin Fu Sun, 2017. "An improved chaotic fruit fly optimization based on a mutation strategy for simultaneous feature selection and parameter optimization for SVM and its applications," PLOS ONE, Public Library of Science, vol. 12(4), pages 1-36, April.
  • Handle: RePEc:plo:pone00:0173516
    DOI: 10.1371/journal.pone.0173516
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0173516
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0173516&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0173516?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Rajendran, Chandrasekharan & Ziegler, Hans, 2004. "Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs," European Journal of Operational Research, Elsevier, vol. 155(2), pages 426-438, June.
    2. Liu, Bo & Wang, Ling & Jin, Yi-Hui & Tang, Fang & Huang, De-Xian, 2005. "Improved particle swarm optimization combined with chaos," Chaos, Solitons & Fractals, Elsevier, vol. 25(5), pages 1261-1271.
    3. A. Bagirov & A. Rubinov & N. Soukhoroukova & J. Yearwood, 2003. "Unsupervised and supervised data classification via nonsmooth and global optimization," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 11(1), pages 1-75, June.
    4. Yuan, Xiaofang & Liu, Yuanming & Xiang, Yongzhong & Yan, Xinggang, 2015. "Parameter identification of BIPT system using chaotic-enhanced fruit fly optimization algorithm," Applied Mathematics and Computation, Elsevier, vol. 268(C), pages 1267-1281.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jin-peng Liu & Chang-ling Li, 2017. "The Short-Term Power Load Forecasting Based on Sperm Whale Algorithm and Wavelet Least Square Support Vector Machine with DWT-IR for Feature Selection," Sustainability, MDPI, vol. 9(7), pages 1-20, July.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Rubinov, A.M. & Soukhorokova, N.V. & Ugon, J., 2006. "Classes and clusters in data analysis," European Journal of Operational Research, Elsevier, vol. 173(3), pages 849-865, September.
    2. Sündüz Dağ, 2013. "An Application On Flowshop Scheduling," Alphanumeric Journal, Bahadir Fatih Yildirim, vol. 1(1), pages 47-56, December.
    3. Barry B. & Quim Castellà & Angel A. & Helena Ramalhinho Lourenco & Manuel Mateo, 2012. "ILS-ESP: An Efficient, Simple, and Parameter-Free Algorithm for Solving the Permutation Flow-Shop Problem," Working Papers 636, Barcelona School of Economics.
    4. Dongxiao Niu & Yi Liang & Wei-Chiang Hong, 2017. "Wind Speed Forecasting Based on EMD and GRNN Optimized by FOA," Energies, MDPI, vol. 10(12), pages 1-18, December.
    5. Wen, Charlie & Eksioglu, Sandra Duni & Greenwood, Allen & Zhang, Shu, 2010. "Crane scheduling in a shipbuilding environment," International Journal of Production Economics, Elsevier, vol. 124(1), pages 40-50, March.
    6. Pan, Quan-Ke & Ruiz, Rubén, 2012. "Local search methods for the flowshop scheduling problem with flowtime minimization," European Journal of Operational Research, Elsevier, vol. 222(1), pages 31-43.
    7. Tseng, Lin-Yu & Lin, Ya-Tai, 2009. "A hybrid genetic local search algorithm for the permutation flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 198(1), pages 84-92, October.
    8. Karmitsa, Napsu & Bagirov, Adil M. & Taheri, Sona, 2017. "New diagonal bundle method for clustering problems in large data sets," European Journal of Operational Research, Elsevier, vol. 263(2), pages 367-379.
    9. Ivona Brajević & Jelena Ignjatović, 2019. "An upgraded firefly algorithm with feasibility-based rules for constrained engineering optimization problems," Journal of Intelligent Manufacturing, Springer, vol. 30(6), pages 2545-2574, August.
    10. Yu, Haiquan & Zhou, Jianxin & Si, Fengqi & Nord, Lars O., 2022. "Combined heat and power dynamic economic dispatch considering field operational characteristics of natural gas combined cycle plants," Energy, Elsevier, vol. 244(PA).
    11. Kalczynski, Pawel Jan & Kamburowski, Jerzy, 2007. "On the NEH heuristic for minimizing the makespan in permutation flow shops," Omega, Elsevier, vol. 35(1), pages 53-60, February.
    12. Wang, Jianzhou & Qin, Shanshan & Jin, Shiqiang & Wu, Jie, 2015. "Estimation methods review and analysis of offshore extreme wind speeds and wind energy resources," Renewable and Sustainable Energy Reviews, Elsevier, vol. 42(C), pages 26-42.
    13. Li, Xiaoping & Wang, Qian & Wu, Cheng, 2009. "Efficient composite heuristics for total flowtime minimization in permutation flow shops," Omega, Elsevier, vol. 37(1), pages 155-164, February.
    14. Laura Palagi, 2017. "Global Optimization issues in Supervised Learning. An overview," DIAG Technical Reports 2017-11, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    15. Pagnozzi, Federico & Stützle, Thomas, 2019. "Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems," European Journal of Operational Research, Elsevier, vol. 276(2), pages 409-421.
    16. Xuanhu He & Wei Wang & Jiuchun Jiang & Lijie Xu, 2015. "An Improved Artificial Bee Colony Algorithm and Its Application to Multi-Objective Optimal Power Flow," Energies, MDPI, vol. 8(4), pages 1-26, March.
    17. Tseng, Lin-Yu & Lin, Ya-Tai, 2010. "A genetic local search algorithm for minimizing total flowtime in the permutation flowshop scheduling problem," International Journal of Production Economics, Elsevier, vol. 127(1), pages 121-128, September.
    18. Ruiz, Ruben & Stutzle, Thomas, 2008. "An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1143-1159, June.
    19. El-Shorbagy, M.A. & Mousa, A.A. & Nasr, S.M., 2016. "A chaos-based evolutionary algorithm for general nonlinear programming problems," Chaos, Solitons & Fractals, Elsevier, vol. 85(C), pages 8-21.
    20. Ruiz, Rubén & Maroto, Concepciøn & Alcaraz, Javier, 2006. "Two new robust genetic algorithms for the flowshop scheduling problem," Omega, Elsevier, vol. 34(5), pages 461-476, October.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0173516. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.