Dispersed differential hunger games search for high dimensional gene data feature selection

The realms of modern medicine and biology have provided substantial data sets of genetic roots that exhibit a high dimensionality. Clinical practice and associated processes are primarily dependent on data-driven decision-making. However, the high dimensionality of the data in these domains increase...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computers in biology and medicine 2023-09, Vol.163, p.107197-107197, Article 107197
Hauptverfasser: Chen, Zhiqing, Xinxian, Li, Guo, Ran, Zhang, Lejun, Dhahbi, Sami, Bourouis, Sami, Liu, Lei, Wang, Xianchuan
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 107197
container_issue
container_start_page 107197
container_title Computers in biology and medicine
container_volume 163
creator Chen, Zhiqing
Xinxian, Li
Guo, Ran
Zhang, Lejun
Dhahbi, Sami
Bourouis, Sami
Liu, Lei
Wang, Xianchuan
description The realms of modern medicine and biology have provided substantial data sets of genetic roots that exhibit a high dimensionality. Clinical practice and associated processes are primarily dependent on data-driven decision-making. However, the high dimensionality of the data in these domains increases the complexity and size of processing. It can be challenging to determine representative genes while reducing the data's dimensionality. A successful gene selection will serve to mitigate the computing costs and refine the accuracy of the classification by eliminating superfluous or duplicative features. To address this concern, this research suggests a wrapper gene selection approach based on the HGS, combined with a dispersed foraging strategy and a differential evolution strategy, to form a new algorithm named DDHGS. Introducing the DDHGS algorithm to the global optimization field and its binary derivative bDDHGS to the feature selection problem is anticipated to refine the existing search balance between explorative and exploitative cores. We assess and confirm the efficacy of our proposed method, DDHGS, by comparing it with DE and HGS combined with a single strategy, seven classic algorithms, and ten advanced algorithms on the IEEE CEC 2017 test suite. Furthermore, to further evaluate DDHGS' performance, we compare it with several CEC winners and DE-based techniques of great efficiency on 23 popular optimization functions and the IEEE CEC 2014 benchmark test suite. The experimentation asserted that the bDDHGS approach was able to surpass bHGS and a variety of existing methods when applied to fourteen feature selection datasets from the UCI repository. The metrics measured--classification accuracy, the number of selected features, fitness scores, and execution time--all showed marked improvements with the use of bDDHGS. Considering all results, it can be concluded that bDDHGS is an optimal optimizer and an effective feature selection tool in the wrapper mode. •We propose a novel method based on HGS with disperse foraging and differential crossover mechanisms named DDHGS.•The history trajectory, balance and diversity analysis test demonstrate the effect of DDHGS.•The new method outperforms many well-known algorithms on CEC2017 functions.•This proposed method performs well for feature selection on high dimensional dataset.
doi_str_mv 10.1016/j.compbiomed.2023.107197
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_2832578579</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0010482523006625</els_id><sourcerecordid>2832578579</sourcerecordid><originalsourceid>FETCH-LOGICAL-c402t-740b264b3cb33a412b43496cd643796cdc514c8a8040e02937182b6185aab45e3</originalsourceid><addsrcrecordid>eNqFkU2LFDEQhoMo7rj6FyTgxUuPla9OctT1YxcWvOjJQ0inq2cydHfGpFvw35tmdhG8eCqoeurrfQmhDPYMWPvutA9pOncxTdjvOXBR05pZ_YTsmNG2ASXkU7IDYNBIw9UVeVHKCQAkCHhOroQWFnTLduTHx1jOmAv2tI_DgBnnJfqRHtf5gJke_ISFFvQ5HOmQMj3Gw7GSE84lprmCB5yR9n7xdEC_rBkrPWJYavUleTb4seCrh3hNvn_-9O3mtrn_-uXu5v19EyTwpdESOt7KToROCC8Z76SQtg19K4XeYlBMBuNNvR6BW6GZ4V3LjPK-kwrFNXl7mXvO6eeKZXFTLAHH0c-Y1uK4EVxpo7St6Jt_0FNac_1jo6S1SlmuK2UuVMiplIyDO-c4-fzbMXCbAe7k_hrgNgPcxYDa-vphwdpttcfGR8Ur8OECYFXkV8TsSog4B-xjrrK5PsX_b_kDNcabEg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2849955927</pqid></control><display><type>article</type><title>Dispersed differential hunger games search for high dimensional gene data feature selection</title><source>Elsevier ScienceDirect Journals</source><creator>Chen, Zhiqing ; Xinxian, Li ; Guo, Ran ; Zhang, Lejun ; Dhahbi, Sami ; Bourouis, Sami ; Liu, Lei ; Wang, Xianchuan</creator><creatorcontrib>Chen, Zhiqing ; Xinxian, Li ; Guo, Ran ; Zhang, Lejun ; Dhahbi, Sami ; Bourouis, Sami ; Liu, Lei ; Wang, Xianchuan</creatorcontrib><description>The realms of modern medicine and biology have provided substantial data sets of genetic roots that exhibit a high dimensionality. Clinical practice and associated processes are primarily dependent on data-driven decision-making. However, the high dimensionality of the data in these domains increases the complexity and size of processing. It can be challenging to determine representative genes while reducing the data's dimensionality. A successful gene selection will serve to mitigate the computing costs and refine the accuracy of the classification by eliminating superfluous or duplicative features. To address this concern, this research suggests a wrapper gene selection approach based on the HGS, combined with a dispersed foraging strategy and a differential evolution strategy, to form a new algorithm named DDHGS. Introducing the DDHGS algorithm to the global optimization field and its binary derivative bDDHGS to the feature selection problem is anticipated to refine the existing search balance between explorative and exploitative cores. We assess and confirm the efficacy of our proposed method, DDHGS, by comparing it with DE and HGS combined with a single strategy, seven classic algorithms, and ten advanced algorithms on the IEEE CEC 2017 test suite. Furthermore, to further evaluate DDHGS' performance, we compare it with several CEC winners and DE-based techniques of great efficiency on 23 popular optimization functions and the IEEE CEC 2014 benchmark test suite. The experimentation asserted that the bDDHGS approach was able to surpass bHGS and a variety of existing methods when applied to fourteen feature selection datasets from the UCI repository. The metrics measured--classification accuracy, the number of selected features, fitness scores, and execution time--all showed marked improvements with the use of bDDHGS. Considering all results, it can be concluded that bDDHGS is an optimal optimizer and an effective feature selection tool in the wrapper mode. •We propose a novel method based on HGS with disperse foraging and differential crossover mechanisms named DDHGS.•The history trajectory, balance and diversity analysis test demonstrate the effect of DDHGS.•The new method outperforms many well-known algorithms on CEC2017 functions.•This proposed method performs well for feature selection on high dimensional dataset.</description><identifier>ISSN: 0010-4825</identifier><identifier>EISSN: 1879-0534</identifier><identifier>DOI: 10.1016/j.compbiomed.2023.107197</identifier><identifier>PMID: 37390761</identifier><language>eng</language><publisher>United States: Elsevier Ltd</publisher><subject>Algorithms ; Biomedical research ; Classification ; Datasets ; Decision making ; Differential evolution strategy ; Dispersed foraging strategy ; Dispersion ; Evolutionary computation ; Feature selection ; Foraging behavior ; Gene data feature selection ; Gene expression ; Genetic algorithms ; Global optimization ; Hunger ; Hunger games search ; Machine learning ; Optimization algorithms ; Performance evaluation ; Strategy</subject><ispartof>Computers in biology and medicine, 2023-09, Vol.163, p.107197-107197, Article 107197</ispartof><rights>2023 Elsevier Ltd</rights><rights>Copyright © 2023 Elsevier Ltd. All rights reserved.</rights><rights>2023. Elsevier Ltd</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c402t-740b264b3cb33a412b43496cd643796cdc514c8a8040e02937182b6185aab45e3</citedby><cites>FETCH-LOGICAL-c402t-740b264b3cb33a412b43496cd643796cdc514c8a8040e02937182b6185aab45e3</cites><orcidid>0000-0002-4698-2965</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0010482523006625$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,27901,27902,65306</link.rule.ids><backlink>$$Uhttps://www.ncbi.nlm.nih.gov/pubmed/37390761$$D View this record in MEDLINE/PubMed$$Hfree_for_read</backlink></links><search><creatorcontrib>Chen, Zhiqing</creatorcontrib><creatorcontrib>Xinxian, Li</creatorcontrib><creatorcontrib>Guo, Ran</creatorcontrib><creatorcontrib>Zhang, Lejun</creatorcontrib><creatorcontrib>Dhahbi, Sami</creatorcontrib><creatorcontrib>Bourouis, Sami</creatorcontrib><creatorcontrib>Liu, Lei</creatorcontrib><creatorcontrib>Wang, Xianchuan</creatorcontrib><title>Dispersed differential hunger games search for high dimensional gene data feature selection</title><title>Computers in biology and medicine</title><addtitle>Comput Biol Med</addtitle><description>The realms of modern medicine and biology have provided substantial data sets of genetic roots that exhibit a high dimensionality. Clinical practice and associated processes are primarily dependent on data-driven decision-making. However, the high dimensionality of the data in these domains increases the complexity and size of processing. It can be challenging to determine representative genes while reducing the data's dimensionality. A successful gene selection will serve to mitigate the computing costs and refine the accuracy of the classification by eliminating superfluous or duplicative features. To address this concern, this research suggests a wrapper gene selection approach based on the HGS, combined with a dispersed foraging strategy and a differential evolution strategy, to form a new algorithm named DDHGS. Introducing the DDHGS algorithm to the global optimization field and its binary derivative bDDHGS to the feature selection problem is anticipated to refine the existing search balance between explorative and exploitative cores. We assess and confirm the efficacy of our proposed method, DDHGS, by comparing it with DE and HGS combined with a single strategy, seven classic algorithms, and ten advanced algorithms on the IEEE CEC 2017 test suite. Furthermore, to further evaluate DDHGS' performance, we compare it with several CEC winners and DE-based techniques of great efficiency on 23 popular optimization functions and the IEEE CEC 2014 benchmark test suite. The experimentation asserted that the bDDHGS approach was able to surpass bHGS and a variety of existing methods when applied to fourteen feature selection datasets from the UCI repository. The metrics measured--classification accuracy, the number of selected features, fitness scores, and execution time--all showed marked improvements with the use of bDDHGS. Considering all results, it can be concluded that bDDHGS is an optimal optimizer and an effective feature selection tool in the wrapper mode. •We propose a novel method based on HGS with disperse foraging and differential crossover mechanisms named DDHGS.•The history trajectory, balance and diversity analysis test demonstrate the effect of DDHGS.•The new method outperforms many well-known algorithms on CEC2017 functions.•This proposed method performs well for feature selection on high dimensional dataset.</description><subject>Algorithms</subject><subject>Biomedical research</subject><subject>Classification</subject><subject>Datasets</subject><subject>Decision making</subject><subject>Differential evolution strategy</subject><subject>Dispersed foraging strategy</subject><subject>Dispersion</subject><subject>Evolutionary computation</subject><subject>Feature selection</subject><subject>Foraging behavior</subject><subject>Gene data feature selection</subject><subject>Gene expression</subject><subject>Genetic algorithms</subject><subject>Global optimization</subject><subject>Hunger</subject><subject>Hunger games search</subject><subject>Machine learning</subject><subject>Optimization algorithms</subject><subject>Performance evaluation</subject><subject>Strategy</subject><issn>0010-4825</issn><issn>1879-0534</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>8G5</sourceid><sourceid>BENPR</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNqFkU2LFDEQhoMo7rj6FyTgxUuPla9OctT1YxcWvOjJQ0inq2cydHfGpFvw35tmdhG8eCqoeurrfQmhDPYMWPvutA9pOncxTdjvOXBR05pZ_YTsmNG2ASXkU7IDYNBIw9UVeVHKCQAkCHhOroQWFnTLduTHx1jOmAv2tI_DgBnnJfqRHtf5gJke_ISFFvQ5HOmQMj3Gw7GSE84lprmCB5yR9n7xdEC_rBkrPWJYavUleTb4seCrh3hNvn_-9O3mtrn_-uXu5v19EyTwpdESOt7KToROCC8Z76SQtg19K4XeYlBMBuNNvR6BW6GZ4V3LjPK-kwrFNXl7mXvO6eeKZXFTLAHH0c-Y1uK4EVxpo7St6Jt_0FNac_1jo6S1SlmuK2UuVMiplIyDO-c4-fzbMXCbAe7k_hrgNgPcxYDa-vphwdpttcfGR8Ur8OECYFXkV8TsSog4B-xjrrK5PsX_b_kDNcabEg</recordid><startdate>20230901</startdate><enddate>20230901</enddate><creator>Chen, Zhiqing</creator><creator>Xinxian, Li</creator><creator>Guo, Ran</creator><creator>Zhang, Lejun</creator><creator>Dhahbi, Sami</creator><creator>Bourouis, Sami</creator><creator>Liu, Lei</creator><creator>Wang, Xianchuan</creator><general>Elsevier Ltd</general><general>Elsevier Limited</general><scope>NPM</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7RV</scope><scope>7X7</scope><scope>7XB</scope><scope>88E</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FH</scope><scope>8FI</scope><scope>8FJ</scope><scope>8FK</scope><scope>8G5</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BBNVY</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>BHPHI</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FR3</scope><scope>FYUFA</scope><scope>GHDGH</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>K9.</scope><scope>KB0</scope><scope>LK8</scope><scope>M0N</scope><scope>M0S</scope><scope>M1P</scope><scope>M2O</scope><scope>M7P</scope><scope>M7Z</scope><scope>MBDVC</scope><scope>NAPCQ</scope><scope>P5Z</scope><scope>P62</scope><scope>P64</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>Q9U</scope><scope>7X8</scope><orcidid>https://orcid.org/0000-0002-4698-2965</orcidid></search><sort><creationdate>20230901</creationdate><title>Dispersed differential hunger games search for high dimensional gene data feature selection</title><author>Chen, Zhiqing ; Xinxian, Li ; Guo, Ran ; Zhang, Lejun ; Dhahbi, Sami ; Bourouis, Sami ; Liu, Lei ; Wang, Xianchuan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c402t-740b264b3cb33a412b43496cd643796cdc514c8a8040e02937182b6185aab45e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Algorithms</topic><topic>Biomedical research</topic><topic>Classification</topic><topic>Datasets</topic><topic>Decision making</topic><topic>Differential evolution strategy</topic><topic>Dispersed foraging strategy</topic><topic>Dispersion</topic><topic>Evolutionary computation</topic><topic>Feature selection</topic><topic>Foraging behavior</topic><topic>Gene data feature selection</topic><topic>Gene expression</topic><topic>Genetic algorithms</topic><topic>Global optimization</topic><topic>Hunger</topic><topic>Hunger games search</topic><topic>Machine learning</topic><topic>Optimization algorithms</topic><topic>Performance evaluation</topic><topic>Strategy</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Chen, Zhiqing</creatorcontrib><creatorcontrib>Xinxian, Li</creatorcontrib><creatorcontrib>Guo, Ran</creatorcontrib><creatorcontrib>Zhang, Lejun</creatorcontrib><creatorcontrib>Dhahbi, Sami</creatorcontrib><creatorcontrib>Bourouis, Sami</creatorcontrib><creatorcontrib>Liu, Lei</creatorcontrib><creatorcontrib>Wang, Xianchuan</creatorcontrib><collection>PubMed</collection><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Proquest Nursing &amp; Allied Health Source</collection><collection>Health &amp; Medical Collection</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Medical Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Natural Science Collection</collection><collection>Hospital Premium Collection</collection><collection>Hospital Premium Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>Research Library (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>Biological Science Collection</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>Natural Science Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>Health Research Premium Collection</collection><collection>Health Research Premium Collection (Alumni)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>ProQuest Health &amp; Medical Complete (Alumni)</collection><collection>Nursing &amp; Allied Health Database (Alumni Edition)</collection><collection>ProQuest Biological Science Collection</collection><collection>Computing Database</collection><collection>Health &amp; Medical Collection (Alumni Edition)</collection><collection>Medical Database</collection><collection>Research Library</collection><collection>Biological Science Database</collection><collection>Biochemistry Abstracts 1</collection><collection>Research Library (Corporate)</collection><collection>Nursing &amp; Allied Health Premium</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>Biotechnology and BioEngineering Abstracts</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central Basic</collection><collection>MEDLINE - Academic</collection><jtitle>Computers in biology and medicine</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Chen, Zhiqing</au><au>Xinxian, Li</au><au>Guo, Ran</au><au>Zhang, Lejun</au><au>Dhahbi, Sami</au><au>Bourouis, Sami</au><au>Liu, Lei</au><au>Wang, Xianchuan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Dispersed differential hunger games search for high dimensional gene data feature selection</atitle><jtitle>Computers in biology and medicine</jtitle><addtitle>Comput Biol Med</addtitle><date>2023-09-01</date><risdate>2023</risdate><volume>163</volume><spage>107197</spage><epage>107197</epage><pages>107197-107197</pages><artnum>107197</artnum><issn>0010-4825</issn><eissn>1879-0534</eissn><abstract>The realms of modern medicine and biology have provided substantial data sets of genetic roots that exhibit a high dimensionality. Clinical practice and associated processes are primarily dependent on data-driven decision-making. However, the high dimensionality of the data in these domains increases the complexity and size of processing. It can be challenging to determine representative genes while reducing the data's dimensionality. A successful gene selection will serve to mitigate the computing costs and refine the accuracy of the classification by eliminating superfluous or duplicative features. To address this concern, this research suggests a wrapper gene selection approach based on the HGS, combined with a dispersed foraging strategy and a differential evolution strategy, to form a new algorithm named DDHGS. Introducing the DDHGS algorithm to the global optimization field and its binary derivative bDDHGS to the feature selection problem is anticipated to refine the existing search balance between explorative and exploitative cores. We assess and confirm the efficacy of our proposed method, DDHGS, by comparing it with DE and HGS combined with a single strategy, seven classic algorithms, and ten advanced algorithms on the IEEE CEC 2017 test suite. Furthermore, to further evaluate DDHGS' performance, we compare it with several CEC winners and DE-based techniques of great efficiency on 23 popular optimization functions and the IEEE CEC 2014 benchmark test suite. The experimentation asserted that the bDDHGS approach was able to surpass bHGS and a variety of existing methods when applied to fourteen feature selection datasets from the UCI repository. The metrics measured--classification accuracy, the number of selected features, fitness scores, and execution time--all showed marked improvements with the use of bDDHGS. Considering all results, it can be concluded that bDDHGS is an optimal optimizer and an effective feature selection tool in the wrapper mode. •We propose a novel method based on HGS with disperse foraging and differential crossover mechanisms named DDHGS.•The history trajectory, balance and diversity analysis test demonstrate the effect of DDHGS.•The new method outperforms many well-known algorithms on CEC2017 functions.•This proposed method performs well for feature selection on high dimensional dataset.</abstract><cop>United States</cop><pub>Elsevier Ltd</pub><pmid>37390761</pmid><doi>10.1016/j.compbiomed.2023.107197</doi><tpages>1</tpages><orcidid>https://orcid.org/0000-0002-4698-2965</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 0010-4825
ispartof Computers in biology and medicine, 2023-09, Vol.163, p.107197-107197, Article 107197
issn 0010-4825
1879-0534
language eng
recordid cdi_proquest_miscellaneous_2832578579
source Elsevier ScienceDirect Journals
subjects Algorithms
Biomedical research
Classification
Datasets
Decision making
Differential evolution strategy
Dispersed foraging strategy
Dispersion
Evolutionary computation
Feature selection
Foraging behavior
Gene data feature selection
Gene expression
Genetic algorithms
Global optimization
Hunger
Hunger games search
Machine learning
Optimization algorithms
Performance evaluation
Strategy
title Dispersed differential hunger games search for high dimensional gene data feature selection
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-29T05%3A35%3A18IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Dispersed%20differential%20hunger%20games%20search%20for%20high%20dimensional%20gene%20data%20feature%20selection&rft.jtitle=Computers%20in%20biology%20and%20medicine&rft.au=Chen,%20Zhiqing&rft.date=2023-09-01&rft.volume=163&rft.spage=107197&rft.epage=107197&rft.pages=107197-107197&rft.artnum=107197&rft.issn=0010-4825&rft.eissn=1879-0534&rft_id=info:doi/10.1016/j.compbiomed.2023.107197&rft_dat=%3Cproquest_cross%3E2832578579%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2849955927&rft_id=info:pmid/37390761&rft_els_id=S0010482523006625&rfr_iscdi=true