1
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Advancing forensic-based investigation incorporating slime mould search for gene selection of high-dimensional genetic data

      research-article

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Modern medicine has produced large genetic datasets of high dimensions through advanced gene sequencing technology, and processing these data is of great significance for clinical decision-making. Gene selection (GS) is an important data preprocessing technique that aims to select a subset of feature information to improve performance and reduce data dimensionality. This study proposes an improved wrapper GS method based on forensic-based investigation (FBI). The method introduces the search mechanism of the slime mould algorithm in the FBI to improve the original FBI; the newly proposed algorithm is named SMA_FBI; then GS is performed by converting the continuous optimizer to a binary version of the optimizer through a transfer function. In order to verify the superiority of SMA_FBI, experiments are first executed on the 30-function test set of CEC2017 and compared with 10 original algorithms and 10 state-of-the-art algorithms. The experimental results show that SMA_FBI is better than other algorithms in terms of finding the optimal solution, convergence speed, and robustness. In addition, BSMA_FBI (binary version of SMA_FBI) is compared with 8 binary algorithms on 18 high-dimensional genetic data from the UCI repository. The results indicate that BSMA_FBI is able to obtain high classification accuracy with fewer features selected in GS applications. Therefore, SMA_FBI is considered an optimization tool with great potential for dealing with global optimization problems, and its binary version, BSMA_FBI, can be used for GS tasks.

          Related collections

          Most cited references74

          • Record: found
          • Abstract: not found
          • Article: not found

          GSA: A Gravitational Search Algorithm

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Harris hawks optimization: Algorithm and applications

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              SCA: A Sine Cosine Algorithm for solving optimization problems

                Bookmark

                Author and article information

                Contributors
                chenhuiling.jlu@gmail.com
                guoxiliang2017@gmail.com
                Journal
                Sci Rep
                Sci Rep
                Scientific Reports
                Nature Publishing Group UK (London )
                2045-2322
                13 April 2024
                13 April 2024
                2024
                : 14
                : 8599
                Affiliations
                [1 ]Institute of Big Data and Information Technology, Wenzhou University, ( https://ror.org/020hxh324) Wenzhou, 325035 China
                [2 ]School of Surveying and Geospatial Engineering, College of Engineering, University of Tehran, ( https://ror.org/05vf56z40) Tehran, Iran
                [3 ]Department of Computer Science and Artificial Intelligence, Wenzhou University, ( https://ror.org/020hxh324) Wenzhou, 325035 China
                [4 ]Department of Artificial Intelligence, Wenzhou Polytechnic, ( https://ror.org/05h1ry383) Wenzhou, 325035 China
                Article
                59064
                10.1038/s41598-024-59064-w
                11016116
                38615048
                8383d8f8-f227-425a-b30b-03ae58d3d4c4
                © The Author(s) 2024

                Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.

                History
                : 2 January 2024
                : 6 April 2024
                Funding
                Funded by: National Natural Science Foundation of China
                Award ID: 62076185, 62301367
                Award Recipient :
                Funded by: Zhejiang Provincial Natural Science Foundation of China
                Award ID: LTGY24C060004
                Award Recipient :
                Categories
                Article
                Custom metadata
                © Springer Nature Limited 2024

                Uncategorized
                forensic-based investigation,high-dimensional genetic data,gene selection,slime mould algorithm,global optimization,computational science,computer science

                Comments

                Comment on this article