{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:02:32Z","timestamp":1750309352109,"version":"3.41.0"},"reference-count":52,"publisher":"Association for Computing Machinery (ACM)","issue":"9","license":[{"start":{"date-parts":[[2024,11,12]],"date-time":"2024-11-12T00:00:00Z","timestamp":1731369600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["61772473, 62073345, and 62011530148"],"award-info":[{"award-number":["61772473, 62073345, and 62011530148"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2024,11,30]]},"abstract":"<jats:p>\n            Feature selection is a key step in machine learning by eliminating features that are not related to the modeling target to create reliable and interpretable models. By exploring the potential complex correlations among features of unlabeled data, recently introduced self-supervision-enhanced feature selection greatly reduces the reliance on the labeled samples. However, they are generally based on the autoencoder with sample-wise self-supervision, which can hardly exploit the relations among samples. To address this limitation, this article proposes graph representation learning enhanced semi-supervised feature selection (G-FS) which performs feature selection based on the discovery and exploitation of the non-Euclidean relations among features and samples by translating unlabeled \u201cplain\u201d tabular data into a bipartite graph. A self-supervised edge prediction task is designed to distill rich information on the graph into low-dimensional embeddings, which remove redundant features and noise. Guided by the condensed graph representation, we propose a batch attention feature weight generation mechanism that generates more robust weights according to batch-based selection patterns rather than individual samples. The results show that G-FS achieves significant performance edges in 14 datasets compared to twelve state-of-the-art baselines, including two recent self-supervised baselines. The source code is public available at\n            <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"https:\/\/github.com\/Icannotnamemyselff\/G-FS_Graph_enhacned_feature_selection\">https:\/\/github.com\/Icannotnamemyselff\/G-FS_Graph_enhacned_feature_selection<\/jats:ext-link>\n            .\n          <\/jats:p>","DOI":"10.1145\/3689428","type":"journal-article","created":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T17:00:50Z","timestamp":1724778050000},"page":"1-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Graph Representation Learning Enhanced Semi-Supervised Feature Selection"],"prefix":"10.1145","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3236-7275","authenticated-orcid":false,"given":"Jun","family":"Tan","sequence":"first","affiliation":[{"name":"Central South University, School of Computer Science and Engineering, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7076-4343","authenticated-orcid":false,"given":"Zhifeng","family":"Qiu","sequence":"additional","affiliation":[{"name":"Central South University, School of Automation, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4983-5327","authenticated-orcid":false,"given":"Ning","family":"Gui","sequence":"additional","affiliation":[{"name":"Central South University, School of Computer Science and Engineering, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,11,12]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2023.3298955"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-19066-2_45"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i8.16826"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","unstructured":"Zahra Atashgahi Xuhao Zhang Neil Kichler Shiwei Liu Lu Yin Mykola Pechenizkiy Raymond Veldhuis and Decebal Constantin Mocanu. 2023. Supervised feature selection with neuron evolution in sparse neural networks. arXiv:2303.07200. Retrieved from 10.48550\/arXiv.2303.07200","DOI":"10.48550\/arXiv.2303.07200"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v28i1.8922"},{"key":"e_1_3_2_7_2","first-page":"2591","volume-title":"Proceedings of the Advances in Neural Information Processing Systems","volume":"30","author":"Chen Jianbo","year":"2017","unstructured":"Jianbo Chen, Mitchell Stern, Martin J. Wainwright, and Michael I. Jordan. 2017. Kernel feature selection via conditional covariance minimization. In Proceedings of the Advances in Neural Information Processing Systems, Vol. 30, 2591\u20132598."},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939785"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/CSICC55295.2022.9780486"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33013705"},{"key":"e_1_3_2_11_2","first-page":"1025","volume-title":"Proceedings of the Advances in neural Information Processing Systems","volume":"30","author":"Hamilton Will","year":"2017","unstructured":"Will Hamilton, Zhitao Ying, and Jure Leskovec. 2017. Inductive representation learning on large graphs. In Proceedings of the Advances in neural Information Processing Systems, Vol. 30, 1025\u20131035."},{"key":"e_1_3_2_12_2","first-page":"252","volume-title":"IEEE Transactions on Neural Networks and Learning Systems","volume":"26","author":"Han Yahong","year":"2014","unstructured":"Yahong Han, Yi Yang, Yan Yan, Zhigang Ma, Nicu Sebe, and Xiaofang Zhou. 2014. Semisupervised feature selection via spline regression for video semantic recognition. IEEE Transactions on Neural Networks and Learning Systems 26, 2 (2014), 252\u2013264."},{"key":"e_1_3_2_13_2","unstructured":"Keke Huang Yu Guang Wang Ming Li and Pietro Li\u00f2. 2024. How universal polynomial bases enhance spectral graph neural networks: Heterophily over-smoothing and over-squashing. arXiv:2405.12474."},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106202"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33013983"},{"key":"e_1_3_2_16_2","first-page":"3615","volume-title":"IEEE Transactions on Neural Networks and Learning Systems","volume":"35","author":"Jiang Bingbing","year":"2022","unstructured":"Bingbing Jiang, Xingyu Wu, Xiren Zhou, Yi Liu, Anthony G. Cohn, Weiguo Sheng, and Huanhuan Chen. 2022. Semi-supervised multiview feature selection with adaptive graph learning. IEEE Transactions on Neural Networks and Learning Systems 35, 3 (2022), 3615\u20133629."},{"key":"e_1_3_2_17_2","first-page":"3146","volume-title":"Proceedings of the Advances in Neural Information Processing Systems","volume":"30","author":"Ke Guolin","year":"2017","unstructured":"Guolin Ke, Qi Meng, Thomas Finley, Taifeng Wang, Wei Chen, Weidong Ma, Qiwei Ye, and Tie-Yan Liu. 2017. LightBGM: A highly efficient gradient boosting decision tree. In Proceedings of the Advances in Neural Information Processing Systems, Vol. 30, 3146\u20133154."},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","unstructured":"Thomas N. Kipf and Max Welling. 2016. Semi-supervised classification with graph convolutional networks. arXiv:1609.02907. Retrieved from 10.48550\/arXiv.1609.02907","DOI":"10.48550\/arXiv.1609.02907"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","unstructured":"Ludmila I. Kuncheva Clare E. Matthews \u00c1lvar Arnaiz-Gonz\u00e1lez and Juan J. Rodr\u00edguez. 2020. Feature selection from high-dimensional data with very low sample size: A cautionary tale. arXiv:2008.12025. Retrieved from 10.48550\/arXiv.2008.12025","DOI":"10.48550\/arXiv.2008.12025"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2022.07.102"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.109243"},{"key":"e_1_3_2_22_2","first-page":"1","volume-title":"Proceedings of the International Conference on Learning Representations","author":"Lee Changhee","year":"2021","unstructured":"Changhee Lee, Fergus Imrie, and Mihaela van der Schaar. 2021. Self-supervision enhanced feature selection with correlated gates. In Proceedings of the International Conference on Learning Representations, 1\u201326."},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2024.3370918"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2015.0189"},{"issue":"5","key":"e_1_3_2_25_2","first-page":"4880","article-title":"Graph representation learning beyond node and homophily","volume":"35","author":"Li You","year":"2022","unstructured":"You Li, Bei Lin, Binli Luo, and Ning Gui. 2022. Graph representation learning beyond node and homophily. IEEE Transactions on Knowledge and Data Engineering 35, 5 (2022), 4880\u20134893.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN52387.2021.9534401"},{"key":"e_1_3_2_27_2","first-page":"1530","volume-title":"Proceedings of the Advances in Neural Information Processing Systems","volume":"34","author":"Lindenbaum Ofir","year":"2021","unstructured":"Ofir Lindenbaum, Uri Shaham, Erez Peterfreund, Jonathan Svirsky, Nicolas Casey, and Yuval Kluger. 2021. Differentiable unsupervised feature selection based on a gated laplacian. In Proceedings of the Advances in Neural Information Processing Systems, Vol. 34, 1530\u20131542."},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.66"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2005.10.006"},{"key":"e_1_3_2_30_2","first-page":"4663","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Murphy Ryan","year":"2019","unstructured":"Ryan Murphy, Balasubramaniam Srinivasan, Vinayak Rao, and Bruno Ribeiro. 2019. Relational pooling for graph representations. In Proceedings of the International Conference on Machine Learning. PMLR, 4663\u20134673."},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-019-11461-w"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.109449"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-017-5648-2"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2023.110521"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2016.11.003"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.03.094"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.2478\/cait-2019-0001"},{"key":"e_1_3_2_39_2","first-page":"1279","volume-title":"Proceedings of the Advances in Neural Information Processing Systems","volume":"28","author":"Wang Jie","year":"2015","unstructured":"Jie Wang and Jieping Ye. 2015. Multi-layer feature reduction for tree structured group lasso via hierarchical projection. In Proceedings of the Advances in Neural Information Processing Systems, Vol. 28, 1279\u20131287."},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539290"},{"key":"e_1_3_2_41_2","first-page":"5105","volume-title":"Proceedings of the Advances in Neural Information Processing Systems","volume":"33","author":"Wojtas Maksymilian","year":"2020","unstructured":"Maksymilian Wojtas and Ke Chen. 2020. Feature importance ranking for deep learning. In Proceedings of the Advances in Neural Information Processing Systems, Vol. 33, 5105\u20135114."},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.06.018"},{"issue":"3","key":"e_1_3_2_43_2","first-page":"3169","article-title":"Group contrastive self-supervised learning on graphs","volume":"45","author":"Xu Xinyi","year":"2022","unstructured":"Xinyi Xu, Cheng Deng, Yaochen Xie, and Shuiwang Ji. 2022. Group contrastive self-supervised learning on graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence 45, 3 (2022), 3169\u20133180.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"e_1_3_2_44_2","first-page":"10648","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Yamada Yutaro","year":"2020","unstructured":"Yutaro Yamada, Ofir Lindenbaum, Sahand Negahban, and Yuval Kluger. 2020. Feature selection using stochastic gates. In Proceedings of the International Conference on Machine Learning. PMLR, 10648\u201310659."},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","unstructured":"Baosong Yang Longyue Wang Derek Wong Lidia S Chao and Zhaopeng Tu. 2019. Convolutional self-attention networks. arXiv:1904.03107. Retrieved from 10.48550\/arXiv.1904.03107","DOI":"10.48550\/arXiv.1904.03107"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2020.3026079"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2014.2301773"},{"key":"e_1_3_2_48_2","first-page":"19075","volume-title":"Proceedings of the Advances in Neural Information Processing Systems","volume":"33","author":"You Jiaxuan","year":"2020","unstructured":"Jiaxuan You, Xiaobai Ma, Yi Ding, Mykel J Kochenderfer, and Jure Leskovec. 2020. Handling missing data with graph representation learning. In Proceedings of the Advances in Neural Information Processing Systems, Vol. 33, 19075\u201319087."},{"key":"e_1_3_2_49_2","volume-title":"Proceedings of the Advances in Neural Information Processing Systems","volume":"32","author":"You Jiaxuan","year":"2019","unstructured":"Jiaxuan You, Haoze Wu, Clark Barrett, Raghuram Ramanujan, and Jure Leskovec. 2019. G2SAT: Learning to generate sat formulas. In Proceedings of the Advances in Neural Information Processing Systems, Vol. 32."},{"key":"e_1_3_2_50_2","first-page":"7134","volume-title":"Proceedings of the International conference on machine learning","author":"You Jiaxuan","year":"2019","unstructured":"Jiaxuan You, Rex Ying, and Jure Leskovec. 2019. Position-aware graph neural networks. In Proceedings of the International conference on machine learning. PMLR, 7134\u20137143."},{"key":"e_1_3_2_51_2","unstructured":"Wenbin Zhang Jeremy C. Weiss Shuigeng Zhou and Toby Walsh. 2022. Fairness amidst non-iid graph data: A literature review. arXiv:2202.07170."},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/473"},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i9.26348"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3689428","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3689428","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:05:45Z","timestamp":1750291545000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3689428"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,12]]},"references-count":52,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2024,11,30]]}},"alternative-id":["10.1145\/3689428"],"URL":"https:\/\/doi.org\/10.1145\/3689428","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"type":"print","value":"1556-4681"},{"type":"electronic","value":"1556-472X"}],"subject":[],"published":{"date-parts":[[2024,11,12]]},"assertion":[{"value":"2024-01-29","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-08-08","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-11-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}