{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T19:15:32Z","timestamp":1772910932764,"version":"3.50.1"},"reference-count":38,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T00:00:00Z","timestamp":1707782400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2024,5,31]]},"abstract":"<jats:p>Feature transformation aims to reconstruct an effective representation space by mathematically refining the existing features. It serves as a pivotal approach to combat the curse of dimensionality, enhance model generalization, mitigate data sparsity, and extend the applicability of classical models. Existing research predominantly focuses on domain knowledge-based feature engineering or learning latent representations. However, these methods, while insightful, lack full automation and fail to yield a traceable and optimal representation space. An indispensable question arises: Can we concurrently address these limitations when reconstructing a feature space for a machine learning task? Our initial work took a pioneering step towards this challenge by introducing a novel self-optimizing framework. This framework leverages the power of three cascading reinforced agents to automatically select candidate features and operations for generating improved feature transformation combinations. Despite the impressive strides made, there was room for enhancing its effectiveness and generalization capability. In this extended journal version, we advance our initial work from two distinct yet interconnected perspectives: 1) We propose a refinement of the original framework, which integrates a graph-based state representation method to capture the feature interactions more effectively and develop different Q-learning strategies to alleviate Q-value overestimation further. 2) We utilize a new optimization technique (actor-critic) to train the entire self-optimizing framework in order to accelerate the model convergence and improve the feature transformation performance. Finally, to validate the improved effectiveness and generalization capability of our framework, we perform extensive experiments and conduct comprehensive analyses. These provide empirical evidence of the strides made in this journal version over the initial work, solidifying our framework\u2019s standing as a substantial contribution to the field of automated feature transformation. To improve the reproducibility, we have released the associated code and data by the Github link\u00a0https:\/\/github.com\/coco11563\/TKDD2023_code.<\/jats:p>","DOI":"10.1145\/3638059","type":"journal-article","created":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T12:01:21Z","timestamp":1703073681000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Traceable Group-Wise Self-Optimizing Feature Transformation Learning: A Dual Optimization Perspective"],"prefix":"10.1145","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5294-5776","authenticated-orcid":false,"given":"Meng","family":"Xiao","sequence":"first","affiliation":[{"name":"Computer Network Information Center, Chinese Academy of Sciences, Beijing and University of Chinese Academy of Sciences, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3948-0059","authenticated-orcid":false,"given":"Dongjie","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Central Florida, Orlando, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0977-3600","authenticated-orcid":false,"given":"Min","family":"Wu","sequence":"additional","affiliation":[{"name":"Institute for Infocomm Research, Agency for Science, Singapore"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6053-5977","authenticated-orcid":false,"given":"Kunpeng","family":"Liu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Portland State University, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6016-6465","authenticated-orcid":false,"given":"Hui","family":"Xiong","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science and Technology (Guangzhou) and Guangzhou HKUST Fok Ying Tung Research Institute, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2144-1131","authenticated-orcid":false,"given":"Yuanchun","family":"Zhou","sequence":"additional","affiliation":[{"name":"Computer Network Information Center, Chinese Academy of Sciences and University of Chinese Academy of Sciences, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1767-8024","authenticated-orcid":false,"given":"Yanjie","family":"Fu","sequence":"additional","affiliation":[{"name":"Arizona State University, School of Computing and AI, Tempe, USA"}]}],"member":"320","published-online":{"date-parts":[[2024,2,13]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.50"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.5555\/944919.944937"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2019.00017"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/3447556.3447567"},{"key":"e_1_3_1_7_2","article-title":"LibSVM Dataset Download","author":"Chih-Jen Lin","year":"2022","unstructured":"Lin Chih-Jen. 2022. LibSVM Dataset Download. [EB\/OL]. Retrieved from https:\/\/www.csie.ntu.edu.tw\/cjlin\/libsvmtools\/datasets\/","journal-title":"[EB\/OL]"},{"key":"e_1_3_1_8_2","first-page":"1289","article-title":"An extensive empirical study of feature selection metrics for text classification.","volume":"3","author":"Forman George","year":"2003","unstructured":"George Forman. 2003. An extensive empirical study of feature selection metrics for text classification. Journal of Machine Learning Research 3, Mar (2003), 1289\u20131305.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_1_9_2","first-page":"3348","article-title":"Probabilistic matrix factorization for automated machine learning","volume":"31","author":"Fusi Nicolo","year":"2018","unstructured":"Nicolo Fusi, Rishit Sheth, and Melih Elibol. 2018. Probabilistic matrix factorization for automated machine learning. Advances in Neural Information Processing Systems 31 (2018), 3348\u20133357.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.03.022"},{"key":"e_1_3_1_11_2","doi-asserted-by":"crossref","unstructured":"Huifeng Guo Ruiming Tang Yunming Ye Zhenguo Li and Xiuqiang He. 2017. DeepFM: A factorization-machine based neural network for CTR prediction. In Proceedings of the 26th International Joint Conference on Artificial Intelligence. 1725\u20131731.","DOI":"10.24963\/ijcai.2017\/239"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.5555\/944919.944968"},{"key":"e_1_3_1_13_2","article-title":"Soft actor-critic algorithms and applications","author":"Haarnoja Tuomas","year":"2018","unstructured":"Tuomas Haarnoja, Aurick Zhou, Kristian Hartikainen, George Tucker, Sehoon Ha, Jie Tan, Vikash Kumar, Henry Zhu, Abhishek Gupta, Pieter Abbeel, and Sergey Levine. 2018. Soft actor-critic algorithms and applications. arXiv:1812.05905 . Retrieved from https:\/\/arxiv.org\/abs\/1812.05905","journal-title":"arXiv:1812.05905"},{"key":"e_1_3_1_14_2","volume-title":"Statistical Learning with Sparsity: The Lasso and Generalizations","author":"Hastie Trevor","year":"2019","unstructured":"Trevor Hastie, Robert Tibshirani, and Martin Wainwright. 2019. Statistical Learning with Sparsity: The Lasso and Generalizations. Chapman and Hall\/CRC."},{"key":"e_1_3_1_15_2","doi-asserted-by":"crossref","unstructured":"Franziska Horn Robert Pack and Michael Rieger. 2019. The autofeat python library for automated feature engineering and selection. Machine Learning and Knowledge Discovery in Databases: International Workshops of ECML PKDD 2019 W\u00fcrzburg Germany September 16\u201320 2019 Proceedings Part I. Springer International Publishing 111\u2013120.","DOI":"10.1007\/978-3-030-43823-4_10"},{"key":"e_1_3_1_16_2","article-title":"Kaggle Dataset Download","author":"Howard Jeremy","year":"2022","unstructured":"Jeremy Howard. 2022. Kaggle Dataset Download. [EB\/OL]. Retrieved from https:\/\/www.kaggle.com\/datasets","journal-title":"[EB\/OL]"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11678"},{"key":"e_1_3_1_18_2","unstructured":"Thomas N. Kipf and Max Welling. 2017. Semi-supervised classification with graph convolutional networks. In International Conference on Learning Representations. https:\/\/openreview.net\/forum?id=SJU4ayYgl"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(97)00043-X"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/3136625"},{"key":"e_1_3_1_21_2","unstructured":"Timothy P. Lillicrap Jonathan J. Hunt Alexander Pritzel Nicolas Heess Tom Erez Yuval Tassa David Silver and Daan Wierstra. 2016. Continuous control with deep reinforcement learning. In Proceedings of the 4th International Conference on Learning Representations."},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM51629.2021.00051"},{"key":"e_1_3_1_23_2","article-title":"Playing atari with deep reinforcement learning","author":"Mnih Volodymyr","year":"2013","unstructured":"Volodymyr Mnih, Koray Kavukcuoglu, David Silver, Alex Graves, Ioannis Antonoglou, Daan Wierstra, and Martin Riedmiller. 2013. Playing atari with deep reinforcement learning. arXiv:1312.5602 . Retrieved from https:\/\/arxiv.org\/abs\/1312.5602","journal-title":"arXiv:1312.5602"},{"key":"e_1_3_1_24_2","article-title":"Openml Dataset Download","year":"2022","unstructured":"Public. 2022. Openml Dataset Download. [EB\/OL]. Retrieved from https:\/\/www.openml.org","journal-title":"[EB\/OL]"},{"key":"e_1_3_1_25_2","article-title":"UCI Dataset Download","year":"2022","unstructured":"Public. 2022. UCI Dataset Download. [EB\/OL]. Retrieved from https:\/\/archive.ics.uci.edu\/","journal-title":"[EB\/OL]"},{"key":"e_1_3_1_26_2","article-title":"Proximal policy optimization algorithms","author":"Schulman John","year":"2017","unstructured":"John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov. 2017. Proximal policy optimization algorithms. arXiv:1707.06347 . Retrieved from https:\/\/arxiv.org\/abs\/1707.06347","journal-title":"arXiv:1707.06347"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ymssp.2006.05.004"},{"key":"e_1_3_1_28_2","volume-title":"Reinforcement Learning: An Introduction","author":"Sutton Richard S.","year":"2018","unstructured":"Richard S. Sutton and Andrew G. Barto. 2018. Reinforcement Learning: An Introduction. MIT press."},{"key":"e_1_3_1_29_2","first-page":"1057","volume-title":"Proceedings of the Advances in Neural Information Processing Systems","author":"Sutton Richard S.","year":"2000","unstructured":"Richard S. Sutton, David A. McAllester, Satinder P. Singh, and Yishay Mansour. 2000. Policy gradient methods for reinforcement learning with function approximation. In Proceedings of the Advances in Neural Information Processing Systems. 1057\u20131063."},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10295"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539278"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/3474717.3484212"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3270238"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16567"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512083"},{"key":"e_1_3_1_37_2","first-page":"1995","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Wang Ziyu","year":"2016","unstructured":"Ziyu Wang, Tom Schaul, Matteo Hessel, Hado Hasselt, Marc Lanctot, and Nando Freitas. 2016. Dueling network architectures for deep reinforcement learning. In Proceedings of the International Conference on Machine Learning. PMLR, 1995\u20132003."},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977653.ch87"},{"key":"e_1_3_1_39_2","first-page":"856","volume-title":"Proceedings of the 20th International Conference on Machine Learning","author":"Yu Lei","year":"2003","unstructured":"Lei Yu and Huan Liu. 2003. Feature selection for high-dimensional data: A fast correlation-based filter solution. In Proceedings of the 20th International Conference on Machine Learning. 856\u2013863."}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638059","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3638059","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:35:53Z","timestamp":1750178153000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638059"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,13]]},"references-count":38,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,5,31]]}},"alternative-id":["10.1145\/3638059"],"URL":"https:\/\/doi.org\/10.1145\/3638059","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,13]]},"assertion":[{"value":"2023-06-12","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-12-15","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-02-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}