{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T13:04:00Z","timestamp":1765976640966,"version":"build-2065373602"},"reference-count":34,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2022,12,22]],"date-time":"2022-12-22T00:00:00Z","timestamp":1671667200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Gachon University Research Fund of 2019","award":["GCU-2019-2019-0766","2020R1I1A1A01066599"],"award-info":[{"award-number":["GCU-2019-2019-0766","2020R1I1A1A01066599"]}]},{"name":"National Research Foundation of Korea (NRF)","award":["GCU-2019-2019-0766","2020R1I1A1A01066599"],"award-info":[{"award-number":["GCU-2019-2019-0766","2020R1I1A1A01066599"]}]},{"DOI":"10.13039\/501100003725","name":"Ministry of Education","doi-asserted-by":"publisher","award":["GCU-2019-2019-0766","2020R1I1A1A01066599"],"award-info":[{"award-number":["GCU-2019-2019-0766","2020R1I1A1A01066599"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>In this study, we propose a method to automatically find features from a dataset that are effective for classification or prediction, using a new method called multi-agent reinforcement learning and a guide agent. Each feature of the dataset has one of the main and guide agents, and these agents decide whether to select a feature. Main agents select the optimal features, and guide agents present the criteria for judging the main agents\u2019 actions. After obtaining the main and guide rewards for the features selected by the agents, the main agent that behaves differently from the guide agent updates their Q-values by calculating the learning reward delivered to the main agents. The behavior comparison helps the main agent decide whether its own behavior is correct, without using other algorithms. After performing this process for each episode, the features are finally selected. The feature selection method proposed in this study uses multiple agents, reducing the number of actions each agent can perform and finding optimal features effectively and quickly. Finally, comparative experimental results on multiple datasets show that the proposed method can select effective features for classification and increase classification accuracy.<\/jats:p>","DOI":"10.3390\/s23010098","type":"journal-article","created":{"date-parts":[[2022,12,23]],"date-time":"2022-12-23T03:55:21Z","timestamp":1671767721000},"page":"98","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Feature Selection Method Using Multi-Agent Reinforcement Learning Based on Guide Agents"],"prefix":"10.3390","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8133-8449","authenticated-orcid":false,"given":"Minwoo","family":"Kim","sequence":"first","affiliation":[{"name":"Department of Computer Science, Gachon University, Sujeong-gu, Seongnam-si 13557, Gyeonggi-do, Republic of Korea"},{"name":"AI Team, 2nd R&D Center, MEZOO Co., Ltd., Gieopdosi-ro 200, Jijeong-myeon, Wonju-si 26354, Gangwon-do, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1694-6373","authenticated-orcid":false,"given":"Jinhee","family":"Bae","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Southern California, Los Angeles, CA 90007, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3112-2644","authenticated-orcid":false,"given":"Bohyun","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Gachon University, Sujeong-gu, Seongnam-si 13557, Gyeonggi-do, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hansol","family":"Ko","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Gachon University, Sujeong-gu, Seongnam-si 13557, Gyeonggi-do, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joon S.","family":"Lim","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Gachon University, Sujeong-gu, Seongnam-si 13557, Gyeonggi-do, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,12,22]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1328","DOI":"10.1109\/TKDE.2019.2946162","article-title":"A Survey on Data Collection for Machine Learning: A Big Data-AI Integration Perspective","volume":"33","author":"Roh","year":"2019","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/j.ijinfomgt.2018.06.005","article-title":"Big data with cognitive computing: A review for the future","volume":"42","author":"Gupta","year":"2018","journal-title":"Int. J. Inf. Manag."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1186\/s40537-019-0206-3","article-title":"Uncertainty in big data analytics: Survey, opportunities, and challenges","volume":"6","author":"Hariri","year":"2019","journal-title":"J. Big Data"},{"key":"ref_4","first-page":"1157","article-title":"An introduction to variable and feature selection","volume":"3","author":"Guyon","year":"2003","journal-title":"J. Mach Learn Res."},{"key":"ref_5","unstructured":"Bousquet, O., von Luxburg, U., and R\u00e4tsch, G. (2003). Introduction to Statistical Learning Theory in Summer School on Machine Learning, Springer."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"10312","DOI":"10.1038\/srep10312","article-title":"Application of high-dimensional feature selection: Evaluation for genomic prediction in man","volume":"5","author":"Bermingham","year":"2015","journal-title":"Sci. Rep."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.neucom.2017.11.077","article-title":"Feature selection in machine learning: A new perspective","volume":"300","author":"Cai","year":"2018","journal-title":"Neurocomputing"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1226","DOI":"10.1109\/TPAMI.2005.159","article-title":"Feature selection based on mutual information criteria of max-dependency, max-relevance, and min-redundancy","volume":"27","author":"Peng","year":"2015","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_9","unstructured":"Sleeman, D., and Edwards, P. (1992). A Practical Approach to Feature Selection in Machine Learning Proceedings 1992, Morgan Kaufmann."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Mirjalili, S. (2019). Genetic Algorithm in Evolutionary Algorithms and Neural Networks, Springer.","DOI":"10.1007\/978-3-319-93025-1"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1119","DOI":"10.1016\/0167-8655(94)90127-9","article-title":"Floating search methods in feature selection","volume":"15","author":"Pudil","year":"1994","journal-title":"Pattern Recognit. Lett."},{"key":"ref_12","first-page":"1","article-title":"Using recursive feature elimination in random forest to account for correlated variables in high dimensional data","volume":"19.1","author":"Darst","year":"2018","journal-title":"BMC Genet."},{"key":"ref_13","first-page":"659","article-title":"Improving the classification accuracy using recursive feature elimination with cross-validation","volume":"11","author":"Misra","year":"2020","journal-title":"Int. J. Emerg. Technol."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"101084","DOI":"10.1016\/j.frl.2018.12.032","article-title":"A novel cryptocurrency price trend forecasting model based on LightGBM","volume":"32","author":"Sun","year":"2020","journal-title":"Financ. Res. Lett."},{"key":"ref_15","first-page":"899","article-title":"A genetic algorithm-based feature selection","volume":"5","author":"Babatunde","year":"2014","journal-title":"Asian J. Comput. Inf. Syst."},{"key":"ref_16","unstructured":"Frohlich, H., Chapelle, O., and Scholkopf, B. (2003, January 5). Feature selection for support vector machines by means of genetic algorithm. Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence, Sacramento, CA, USA."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s00500-007-0193-8","article-title":"A genetic algorithm-based method for feature subset selection","volume":"12","author":"Tan","year":"2008","journal-title":"Soft Comput."},{"key":"ref_18","unstructured":"Sutton, R.S., and Barto, A.G. (2018). Reinforcement Learning: An Introduction, MIT Press."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1016\/j.tics.2019.02.006","article-title":"Reinforcement learning, fast and slow","volume":"23","author":"Botvinick","year":"2019","journal-title":"Trends Cogn. Sci."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1561\/2200000071","article-title":"An introduction to deep reinforcement learning","volume":"11","author":"Henderson","year":"2018","journal-title":"Found. Trends Mach. Learn."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/j.energy.2018.07.088","article-title":"Two stage forecast engine with feature selection technique and improved meta-heuristic algorithm for electricity load forecasting","volume":"161","author":"Ghadimi","year":"2018","journal-title":"Energy"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s12065-019-00218-5","article-title":"Deluge based genetic algorithm for feature selection","volume":"14","author":"Guha","year":"2021","journal-title":"Evol. Intell."},{"key":"ref_23","unstructured":"Platt, J., Koller, D., Singer, Y., and Roweis, S. (2007). Managing Power Consumption and Performance of Computing Systems Using Reinforcement Learning in Advances in Neural Information Processing Systems, Curran Associates, Inc."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"5508","DOI":"10.1109\/TCYB.2020.3034424","article-title":"Differential Advising in Multiagent Reinforcement Learning","volume":"52","author":"Ye","year":"2020","journal-title":"IEEE Trans. Cybern."},{"key":"ref_25","first-page":"6128","article-title":"Learning to Teach in Cooperative Multiagent Reinforcement Learning","volume":"33","author":"Omidshafiei","year":"2019","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"1173","DOI":"10.1007\/s10514-018-9786-6","article-title":"A fast hybrid reinforcement learning framework with human corrective feedback","volume":"43","author":"Celemin","year":"2019","journal-title":"Auton. Robot."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Liu, K., Fu, Y., Wang, P., Wu, L., Bo, R., and Li, X. (2019, January 25). Automating feature subspace exploration via multi-agent reinforcement learning. Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, New York, NY, USA.","DOI":"10.1145\/3292500.3330868"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Fan, W., Liu, K., Liu, H., Wang, P., Ge, Y., and Fu, Y. (2020). Autofs: Automated feature selection via diversity-aware interactive reinforcement learning. arXiv.","DOI":"10.1109\/ICDM50108.2020.00117"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Khurana, U., Samulowitz, H., and Turaga, D. (2018, January 2\u20137). Feature engineering for predictive modeling using reinforcement learning. Proceedings of the AAAI Conference on Artificial Intelligence, New Orleans, LA, USA.","DOI":"10.1609\/aaai.v32i1.11678"},{"key":"ref_30","unstructured":"Rasoul, S., Adewole, S., and Akakpo, A. (2021). Feature Selection Using Reinforcement Learning. arXiv."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"1892","DOI":"10.1016\/j.camwa.2013.06.031","article-title":"Using reinforcement learning to find an optimal set of features","volume":"66","author":"Hamzeh","year":"2013","journal-title":"Comput. Math. Appl."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Tokic, M., and Palm, G. (2011). Value-Difference Based Exploration: Adaptive Control between Epsilon-Greedy and Softmax in Annual Conference on Artificial Intelligence, Springer.","DOI":"10.1007\/978-3-642-24455-1_33"},{"key":"ref_33","unstructured":"Asuncion, A., and Newman, D. (2020, September 01). UCI Machine Learning Repository. Available online: http:\/\/archive.ics.uci.edu\/ml."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"6745","DOI":"10.1073\/pnas.96.12.6745","article-title":"Broad patterns of gene expression revealed by clustering analysis of tumor and normal colon tissues probed by oligonucleotide arrays","volume":"96","author":"Alon","year":"1999","journal-title":"Proc. Natl. Acad. Sci. USA"}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/23\/1\/98\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:48:02Z","timestamp":1760147282000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/23\/1\/98"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,22]]},"references-count":34,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,1]]}},"alternative-id":["s23010098"],"URL":"https:\/\/doi.org\/10.3390\/s23010098","relation":{},"ISSN":["1424-8220"],"issn-type":[{"type":"electronic","value":"1424-8220"}],"subject":[],"published":{"date-parts":[[2022,12,22]]}}}