{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T05:42:14Z","timestamp":1775626934541,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,1,21]],"date-time":"2023-01-21T00:00:00Z","timestamp":1674259200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,21]],"date-time":"2023-01-21T00:00:00Z","timestamp":1674259200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s10115-022-01812-3","type":"journal-article","created":{"date-parts":[[2023,1,21]],"date-time":"2023-01-21T03:02:38Z","timestamp":1674270158000},"page":"1935-1962","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Interactive reinforced feature selection with traverse strategy"],"prefix":"10.1007","volume":"65","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6053-5977","authenticated-orcid":false,"given":"Kunpeng","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongjie","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wan","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dapeng\u00a0Oliver","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanjie","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,21]]},"reference":[{"key":"1812_CR1","first-page":"412","volume":"97","author":"Y Yang","year":"1997","unstructured":"Yang Y, Pedersen JO (1997) A comparative study on feature selection in text categorization. Icml 97:412\u2013420","journal-title":"Icml"},{"issue":"3","key":"1812_CR2","first-page":"1289","volume":"3","author":"G Forman","year":"2003","unstructured":"Forman G (2003) An extensive empirical study of feature selection metrics for text classification. J Mach Learn Res 3(3):1289\u20131305","journal-title":"J Mach Learn Res"},{"key":"1812_CR3","unstructured":"Hall MA (1999) Feature selection for discrete and numeric class machine learning"},{"key":"1812_CR4","unstructured":"Yu L, Liu H (2003) Feature selection for high-dimensional data: a fast correlation-based filter solution. In: Proceedings of the 20th International conference on machine learning (ICML-03), pp 856\u2013863"},{"key":"1812_CR5","doi-asserted-by":"crossref","unstructured":"Yang J, Honavar V (1998) Feature subset selection using a genetic algorithm, pp 117\u2013136","DOI":"10.1007\/978-1-4615-5725-8_8"},{"key":"1812_CR6","doi-asserted-by":"crossref","unstructured":"Kim Y, Street WN, Menczer F (2000) Feature selection in unsupervised learning via evolutionary search. In: Proceedings of the Sixth ACM SIGKDD International conference on knowledge discovery and data mining, pp 365\u2013369 ACM","DOI":"10.1145\/347090.347169"},{"key":"1812_CR7","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1109\/TC.1977.1674939","volume":"9","author":"PM Narendra","year":"1977","unstructured":"Narendra PM, Fukunaga K (1977) A branch and bound algorithm for feature subset selection. IEEE Trans Comput 9:917\u2013922","journal-title":"IEEE Trans Comput"},{"issue":"1\u20132","key":"1812_CR8","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0004-3702(97)00043-X","volume":"97","author":"R Kohavi","year":"1997","unstructured":"Kohavi R, John GH (1997) Wrappers for feature subset selection. Artif Intell 97(1\u20132):273\u2013324","journal-title":"Artif Intell"},{"key":"1812_CR9","doi-asserted-by":"crossref","unstructured":"Tibshirani R (1996) Regression shrinkage and selection via the lasso. J R Stat Soc Series B (Methodol), pp 267\u2013288","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"issue":"2","key":"1812_CR10","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1016\/j.ymssp.2006.05.004","volume":"21","author":"V Sugumaran","year":"2007","unstructured":"Sugumaran V, Muralidharan V, Ramachandran K (2007) Feature selection using decision tree and classification through proximal support vector machine for fault diagnostics of roller bearing. Mech Syst Signal Process 21(2):930\u2013942","journal-title":"Mech Syst Signal Process"},{"key":"1812_CR11","doi-asserted-by":"crossref","unstructured":"Liu K, Fu Y, Wang P, Wu L, Bo R, Li X (2019) Automating feature subspace exploration via multi-agent reinforcement learning. In: Proceedings of the 25th ACM SIGKDD International conference on knowledge discovery and data mining, pp 207\u2013215","DOI":"10.1145\/3292500.3330868"},{"key":"1812_CR12","doi-asserted-by":"crossref","unstructured":"Fan W, Liu K, Liu H, Wang P, Ge Y, Fu Y (2020) Autofs: automated feature selection via diversity-aware interactive reinforcement learning. arXiv preprint arXiv:2008.12001","DOI":"10.1109\/ICDM50108.2020.00117"},{"key":"1812_CR13","unstructured":"Sutton RS, Barto AG (2018) Reinforcement learning: an introduction"},{"key":"1812_CR14","unstructured":"Schaul T, Quan J, Antonoglou I, Silver D (2015) Prioritized experience replay. arXiv preprint arXiv:1511.05952"},{"issue":"8","key":"1812_CR15","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1073\/pnas.43.8.749","volume":"43","author":"R Bellman","year":"1957","unstructured":"Bellman R (1957) Kalaba R Dynamic programming and statistical communication theory. Proc Natl Acad Sci USA 43(8):749","journal-title":"Proc Natl Acad Sci USA"},{"key":"1812_CR16","doi-asserted-by":"crossref","unstructured":"Suay HB, Chernova S (2011) Effect of human guidance and state space size on interactive reinforcement learning. In: 2011 Ro-Man, pp 1\u20136. IEEE","DOI":"10.1109\/ROMAN.2011.6005223"},{"key":"1812_CR17","unstructured":"Torrey L, Taylor M (2013) Teaching on a budget: agents advising agents in reinforcement learning. In: Proceedings of the 2013 International conference on autonomous agents and multi-agent systems, pp 1053\u20131060"},{"issue":"2","key":"1812_CR18","doi-asserted-by":"publisher","first-page":"251","DOI":"10.2307\/3315637","volume":"27","author":"SN MacEachern","year":"1999","unstructured":"MacEachern SN, Clyde M, Liu JS (1999) Sequential importance sampling for nonparametric bayes models: the next generation. Can J Stat 27(2):251\u2013267","journal-title":"Can J Stat"},{"key":"1812_CR19","unstructured":"Mnih V, Kavukcuoglu K, Silver D, Graves A, Antonoglou I, Wierstra D, Riedmiller M (2013) Playing atari with deep reinforcement learning. arXiv preprint arXiv:1312.5602"},{"key":"1812_CR20","doi-asserted-by":"crossref","unstructured":"Gupta P, Doermann D, DeMenthon D (2002) Beam search for feature selection in automatic svm defect classification. In: 2002 International conference on pattern recognition, vol 2, pp 212\u2013215 . IEEE","DOI":"10.1109\/ICPR.2002.1048275"},{"key":"1812_CR21","unstructured":"Fraiman N, Li Z (2022) Beam search for feature selection. arXiv preprint arXiv:2203.04350"},{"key":"1812_CR22","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3115477","author":"K Liu","year":"2021","unstructured":"Liu K, Fu Y, Wu L, Li X, Aggarwal C, Xiong H (2021) Automated feature selection: a reinforcement learning perspective. IEEE Trans Knowl Data Eng. https:\/\/doi.org\/10.1109\/TKDE.2021.3115477","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1812_CR23","unstructured":"Blackard JA (2015) Kaggle forest cover type prediction. [EB\/OL]. https:\/\/www.kaggle.com\/c\/forest-cover-type-prediction\/data"},{"key":"1812_CR24","unstructured":"Dua D, Graff C (2017) UCI machine learning repository. http:\/\/archive.ics.uci.edu\/ml"},{"key":"1812_CR25","unstructured":"Van Der\u00a0Putten P, van Someren M (2000) Coil challenge 2000: the insurance company case"},{"key":"1812_CR26","first-page":"433","volume":"1997","author":"HA Guvenir","year":"1997","unstructured":"Guvenir HA, Acar B, Demiroz G, Cekin A (1997) A supervised machine learning algorithm for arrhythmia analysis. Comput Cardiol 1997:433\u2013436","journal-title":"Comput Cardiol"},{"key":"1812_CR27","doi-asserted-by":"publisher","DOI":"10.1155\/2010\/616358","author":"G Stiglic","year":"2010","unstructured":"Stiglic G, Kokol P (2010) Stability of ranked gene lists in large microarray analysis studies. J Biomed Biotechnol. https:\/\/doi.org\/10.1155\/2010\/616358","journal-title":"J Biomed Biotechnol"},{"issue":"1","key":"1812_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/ncomms5308","volume":"5","author":"P Baldi","year":"2014","unstructured":"Baldi P, Sadowski P (2014) Whiteson D Searching for exotic particles in high-energy physics with deep learning. Nat Commun 5(1):1\u20139","journal-title":"Nat Commun"},{"key":"1812_CR29","doi-asserted-by":"crossref","unstructured":"Leardi R (1996) Genetic algorithms in feature selection, pp 67\u201386","DOI":"10.1016\/B978-012213810-2\/50004-9"},{"issue":"8","key":"1812_CR30","doi-asserted-by":"publisher","first-page":"1226","DOI":"10.1109\/TPAMI.2005.159","volume":"27","author":"H Peng","year":"2005","unstructured":"Peng H, Long F, Ding C (2005) Feature selection based on mutual information criteria of max-dependency, max-relevance, and min-redundancy. IEEE Trans Pattern Anal Mach Intell 27(8):1226\u20131238","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"2","key":"1812_CR31","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.chemolab.2006.01.007","volume":"83","author":"PM Granitto","year":"2006","unstructured":"Granitto PM, Furlanello C, Biasioli F (2006) Gasperi F Recursive feature elimination with random forest for ptr-ms analysis of agroindustrial products. Chemom Intell Lab Syst 83(2):83\u201390","journal-title":"Chemom Intell Lab Syst"},{"issue":"443","key":"1812_CR32","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1080\/01621459.1998.10473764","volume":"93","author":"JS Liu","year":"1998","unstructured":"Liu JS, Chen R, Wong WH (1998) Rejection control and sequential importance sampling. J Am Stat Assoc 93(443):1022\u20131031","journal-title":"J Am Stat Assoc"},{"key":"1812_CR33","unstructured":"Xie T, Ma Y, Wang Y-X (2019) Towards optimal off-policy evaluation for reinforcement learning with marginalized importance sampling. In: Advances in Neural Information Processing Systems, pp 9668\u20139678"},{"key":"1812_CR34","unstructured":"Fortunato M, Azar MG, Piot B, Menick J, Osband I, Graves A, Mnih V, Munos R, Hassabis D, Pietquin O, et al (2017) Noisy networks for exploration. arXiv preprint arXiv:1706.10295"},{"key":"1812_CR35","doi-asserted-by":"crossref","unstructured":"Yu Y (2018) Towards sample efficient reinforcement learning. In: IJCAI, pp 5739\u20135743","DOI":"10.24963\/ijcai.2018\/820"},{"key":"1812_CR36","unstructured":"Raginsky M, Rakhlin A, Telgarsky M (2017) Non-convex learning via stochastic gradient langevin dynamics: a nonasymptotic analysis. arXiv preprint arXiv:1702.03849"},{"key":"1812_CR37","doi-asserted-by":"crossref","unstructured":"Wang D, Wang P, Zhou J, Sun L, Du B, Fu Y (2020) Defending water treatment networks: Exploiting spatio-temporal effects for cyber attack detection. In: 2020 IEEE International conference on data mining (ICDM), pp 32\u201341. IEEE","DOI":"10.1109\/ICDM50108.2020.00012"},{"key":"1812_CR38","doi-asserted-by":"crossref","unstructured":"Zhao X, Liu K, Fan W, Jiang L, Zhao X, Yin M, Fu Y (2020) Simplifying reinforced feature selection via restructured choice strategy of single agent. In: 2020 IEEE International conference on data mining (ICDM), pp 871\u2013880 . IEEE","DOI":"10.1109\/ICDM50108.2020.00096"},{"key":"1812_CR39","unstructured":"Lin LJ (1991) Programming robots using reinforcement learning and teaching. In: AAAI, pp 781\u2013786"},{"issue":"6","key":"1812_CR40","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S1364-6613(99)01327-3","volume":"3","author":"S Schaal","year":"1999","unstructured":"Schaal S (1999) Is imitation learning the route to humanoid robots? Trends Cogn Sci 3(6):233\u2013242","journal-title":"Trends Cogn Sci"},{"key":"1812_CR41","unstructured":"Ho J, Ermon S (2016) Generative adversarial imitation learning. In: Advances in neural information processing systems, pp 4565\u20134573"},{"key":"1812_CR42","doi-asserted-by":"crossref","unstructured":"Knox WB, Stone P, Breazeal C (2013) Teaching agents with human feedback: a demonstration of the tamer framework. In: Proceedings of the companion publication of the 2013 international conference on intelligent user interfaces companion, pp 65\u201366","DOI":"10.1145\/2451176.2451201"},{"key":"1812_CR43","first-page":"4410","volume":"35","author":"D Wang","year":"2021","unstructured":"Wang D, Wang P, Liu K, Zhou Y, Hughes CE, Fu Y (2021) Reinforced imitative graph representation learning for mobile user profiling: an adversarial training perspective. Proc AAAI Conf Artif Intell 35:4410\u20134417","journal-title":"Proc AAAI Conf Artif Intell"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-022-01812-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-022-01812-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-022-01812-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,12]],"date-time":"2024-10-12T18:20:51Z","timestamp":1728757251000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-022-01812-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,21]]},"references-count":43,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1812"],"URL":"https:\/\/doi.org\/10.1007\/s10115-022-01812-3","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,21]]},"assertion":[{"value":"30 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 December 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 December 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}