{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:11:49Z","timestamp":1753888309518,"version":"3.41.2"},"reference-count":35,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2023,12,2]],"date-time":"2023-12-02T00:00:00Z","timestamp":1701475200000},"content-version":"vor","delay-in-days":335,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62192783","62376117"],"award-info":[{"award-number":["62192783","62376117"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008048","name":"Nanjing University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100008048","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Intelligent Systems"],"published-print":{"date-parts":[[2023,1]]},"abstract":"<jats:p><jats:italic>Objective<\/jats:italic>. The data processing of medical test report has always been one of the important contents in biological information domain, especially the process of extracting the effective information from the report so as to assist doctors with the correct medical plan. Usual methods neglect the implicit relationship between features. More features are generally not a better choice because more noise is generated between feature combinations. We propose a practical feature selection strategy RMFS, which aims to select the optimal combination of features. <jats:italic>Materials and Methods<\/jats:italic>. Based on the above situation, in this paper, 64 features are extracted from a real medical test report dataset for stroke and feature selection is defined as a reinforcement learning problem to optimize the feature combination by minimizing regret. We select three current mainstream feature selection methods and conduct comparative experiments. <jats:italic>Results<\/jats:italic>. We processed and completed a dataset derived from real medical test reports of stroke. We redefine the feature selection problem as a reinforcement learning problem and propose an optimization strategy based on regret minimization and train weight parameters in a DQN network. Experimental results demonstrate that our method can identify feature combinations with higher prediction accuracy. <jats:italic>Discussion<\/jats:italic>. RMFS shows a strong robustness to the randomness of the environment and has high computational efficiency and accuracy. Compared with the previous feature selection methods, our method yields superior results. <jats:italic>Conclusion<\/jats:italic>. The experimental results demonstrate that our method can obtain a more accurate prediction rate under the same feature scale and we can achieve baseline performance with fewer features.<\/jats:p>","DOI":"10.1155\/2023\/5588877","type":"journal-article","created":{"date-parts":[[2023,12,2]],"date-time":"2023-12-02T19:50:08Z","timestamp":1701546608000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Predicting Potential Risk: Cerebral Stroke via Regret Minimization"],"prefix":"10.1155","volume":"2023","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-4553-3752","authenticated-orcid":false,"given":"Jie","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiangqiang","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2628-7033","authenticated-orcid":false,"given":"Chongjun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2023,12,2]]},"reference":[{"key":"e_1_2_10_1_2","doi-asserted-by":"crossref","unstructured":"MaF. ChittaR. ZhouJ. JingY. QuanzengS. andTongG. J. Dipole: diagnosis prediction in healthcare via attention-based bidirectional recurrent neural networks Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining August 2017 Halifax Canada 1903\u20131911.","DOI":"10.1145\/3097983.3098088"},{"key":"e_1_2_10_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.bspc.2023.104603"},{"key":"e_1_2_10_3_2","doi-asserted-by":"publisher","DOI":"10.1378\/chest.09-1584"},{"key":"e_1_2_10_4_2","doi-asserted-by":"publisher","DOI":"10.1161\/01.str.25.1.40"},{"key":"e_1_2_10_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2012.02.002"},{"key":"e_1_2_10_6_2","first-page":"15650","article-title":"Reinforcement learning with state observation costs in action-contingent noiselessly observable Markov decision processes","volume":"34","author":"Nam H.J. A.","year":"2021","journal-title":"Advances in Neural Information Processing Systems"},{"volume-title":"Time and Space: Why Imperfect Information Games Are Hard","year":"2018","author":"Burch N.","key":"e_1_2_10_7_2"},{"key":"e_1_2_10_8_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i2.20086"},{"key":"e_1_2_10_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.media.2021.102193"},{"key":"e_1_2_10_10_2","doi-asserted-by":"crossref","unstructured":"ParrR. LiL. TaylorG. PainterW. ChristopherL. andMichaelL. An analysis of linear models linear value-function approximation and feature selection for reinforcement learning Proceedings of the 25th international conference on Machine learning July 2008 Helsinki Finland 752\u2013759.","DOI":"10.1145\/1390156.1390251"},{"key":"e_1_2_10_11_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33019510"},{"key":"e_1_2_10_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/3477600"},{"key":"e_1_2_10_13_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11628"},{"key":"e_1_2_10_14_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9477"},{"key":"e_1_2_10_15_2","doi-asserted-by":"crossref","unstructured":"ShaL. CamburuO. M. andLukasiewiczT. Learning from the best: rationalizing predictions by adversarial information calibration Proceedings of the The 35th AAAI Conference on Artificial Intelligence (AAAI-21) May 2021 London UK 13771\u201313779.","DOI":"10.1609\/aaai.v35i15.17623"},{"key":"e_1_2_10_16_2","first-page":"132","article-title":"Sequential feature selection for classification","author":"R\u00fcckstie\u00df T.","year":"2011","journal-title":"Australasian Joint Conference on Artificial Intelligence"},{"key":"e_1_2_10_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.bspc.2022.103948"},{"key":"e_1_2_10_18_2","doi-asserted-by":"crossref","unstructured":"JinW. LiX. andHamarnehG. Evaluating explainable AI on a multi-modal medical imaging task: can existing algorithms fulfill clinical requirements? Proceedings of the Association for the Advancement of Artificial Intelligence Conference (AAAI) August 2022 London UK.","DOI":"10.1609\/aaai.v36i11.21452"},{"key":"e_1_2_10_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-32962-4_18"},{"key":"e_1_2_10_20_2","first-page":"6799","article-title":"Extracting relationships by multi-domain matching","volume":"31","author":"Li Y.","year":"2018","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_10_21_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i01.5423"},{"key":"e_1_2_10_22_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i1.19993"},{"key":"e_1_2_10_23_2","unstructured":"BaiY. XieT. JiangN. andWangY. X. Provably efficient q-learning with low switching cost 2019 https:\/\/arxiv.org\/abs\/1905.12849."},{"key":"e_1_2_10_24_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i15.17577"},{"key":"e_1_2_10_25_2","article-title":"Model-based reinforcement learning for biological sequence design","author":"Angermueller C.","year":"2019","journal-title":"International Conference on Learning Representations"},{"key":"e_1_2_10_26_2","unstructured":"GottesmanO. FutomaJ. LiuY. SonaliP. LeoA. C. EmmaB. andDoshiV. Interpretable off-policy evaluation in reinforcement learning by highlighting influential transitions Proceedings of the 37 th International Conference on Machine Learning August 2020 Vienna Austria 3658\u20133667."},{"key":"e_1_2_10_27_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i06.6590"},{"key":"e_1_2_10_28_2","first-page":"11148","article-title":"Oracle-efficient regret minimization in factored mdps with unknown structure","volume":"34","author":"Rosenberg A.","year":"2021","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_10_29_2","first-page":"17604","article-title":"Regret minimization experience replay in off-policy reinforcement learning","volume":"34","author":"Liu X. H.","year":"2021","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_10_30_2","doi-asserted-by":"publisher","DOI":"10.1038\/nature14236"},{"key":"e_1_2_10_31_2","doi-asserted-by":"publisher","DOI":"10.1137\/0330046"},{"key":"e_1_2_10_32_2","unstructured":"LillicrapT. P. HuntJ. J. PritzelA. NicolasH. TomE. YuvalT. DavidS. andDaanW. Continuous control with deep reinforcement learning 2015 https:\/\/arxiv.org\/abs\/1509.02971."},{"key":"e_1_2_10_33_2","article-title":"Regret minimization in games with incomplete information","volume":"20","author":"Zinkevich M.","year":"2007","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_10_34_2","unstructured":"BrownN. AdamL. GrossS. andSandholmT. Deep Counterfactual Regret Minimization 2019 https:\/\/arxiv.org\/abs\/1811.00164."},{"key":"e_1_2_10_35_2","doi-asserted-by":"crossref","unstructured":"HesselM. ModayilJ. andVan HasseltH. Rainbow: combining improvements in deep reinforcement learning Proceedings of the 32nd AAAI conference on artificial intelligence July 2018 Vienna Austria.","DOI":"10.1609\/aaai.v32i1.11796"}],"container-title":["International Journal of Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/ijis\/2023\/5588877.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/ijis\/2023\/5588877.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2023\/5588877","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T05:25:21Z","timestamp":1735622721000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2023\/5588877"}},"subtitle":[],"editor":[{"given":"Alexander","family":"Ho\u0161ovsk\u00fd","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2023,1]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["10.1155\/2023\/5588877"],"URL":"https:\/\/doi.org\/10.1155\/2023\/5588877","archive":["Portico"],"relation":{},"ISSN":["0884-8173","1098-111X"],"issn-type":[{"type":"print","value":"0884-8173"},{"type":"electronic","value":"1098-111X"}],"subject":[],"published":{"date-parts":[[2023,1]]},"assertion":[{"value":"2023-04-05","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-10-03","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-12-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"5588877"}}