{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T22:31:49Z","timestamp":1773268309696,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T00:00:00Z","timestamp":1718409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T00:00:00Z","timestamp":1718409600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["(62172065, 62072060)"],"award-info":[{"award-number":["(62172065, 62072060)"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["(62172065, 62072060)"],"award-info":[{"award-number":["(62172065, 62072060)"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["(62172065, 62072060)"],"award-info":[{"award-number":["(62172065, 62072060)"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["(62172065, 62072060)"],"award-info":[{"award-number":["(62172065, 62072060)"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["(62172065, 62072060)"],"award-info":[{"award-number":["(62172065, 62072060)"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1007\/s13042-024-02246-9","type":"journal-article","created":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T11:01:34Z","timestamp":1718449294000},"page":"5415-5425","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Semi-supervised filter feature selection based on natural Laplacian score and maximal information coefficient"],"prefix":"10.1007","volume":"15","author":[{"given":"Quanwang","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kun","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianxun","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shanwei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,15]]},"reference":[{"issue":"2","key":"2246_CR1","first-page":"38","volume":"11","author":"H Zhu","year":"2024","unstructured":"Zhu H, Zhou M, Xie Y, Albeshri A (2024) A self-adapting and efficient dandelion algorithm and its application to feature selection for credit card fraud detection. IEEE\/CAA J Automat Sin 11(2):38\u201351","journal-title":"IEEE\/CAA J Automat Sin"},{"issue":"1","key":"2246_CR2","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.compeleceng.2013.11.024","volume":"40","author":"G Chandrashekar","year":"2014","unstructured":"Chandrashekar G, Sahin F (2014) A survey on feature selection methods. Comput Electr Eng 40(1):16\u201328","journal-title":"Comput Electr Eng"},{"issue":"4","key":"2246_CR3","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1109\/72.298224","volume":"5","author":"R Battiti","year":"1994","unstructured":"Battiti R (1994) Using mutual information for selecting features in supervised neural net learning. IEEE Trans Neural Netw 5(4):537\u2013550","journal-title":"IEEE Trans Neural Netw"},{"key":"2246_CR4","first-page":"507","volume":"18","author":"X He","year":"2005","unstructured":"He X, Cai D, Niyogi P (2005) Laplacian score for feature selection. Adv Neural Inf Process Syst 18:507\u2013514","journal-title":"Adv Neural Inf Process Syst"},{"key":"2246_CR5","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.patcog.2016.11.003","volume":"64","author":"R Sheikhpour","year":"2017","unstructured":"Sheikhpour R, Sarram MA, Gharaghani S, Chahooki MAZ (2017) A survey on semi-supervised feature selection methods. Pattern Recogn 64:141\u2013158","journal-title":"Pattern Recogn"},{"key":"2246_CR6","doi-asserted-by":"crossref","unstructured":"Yang M, Chen Y-J, Ji G-L (2010) Semi_Fisher score: a semi-supervised method for feature selection. In: 2010 International Conference on Machine Learning and Cybernetics, vol. 1, pp 527\u2013532","DOI":"10.1109\/ICMLC.2010.5581007"},{"issue":"10","key":"2246_CR7","doi-asserted-by":"publisher","first-page":"1842","DOI":"10.1016\/j.neucom.2007.06.014","volume":"71","author":"J Zhao","year":"2008","unstructured":"Zhao J, Lu K, He X (2008) Locality sensitive semi-supervised feature selection. Neurocomputing 71(10):1842\u20131849","journal-title":"Neurocomputing"},{"issue":"9","key":"2246_CR8","doi-asserted-by":"publisher","first-page":"1974","DOI":"10.1109\/TNNLS.2016.2562670","volume":"28","author":"J Xu","year":"2016","unstructured":"Xu J, Tang B, He H, Man H (2016) Semisupervised feature selection based on relevance and redundancy criteria. IEEE Trans Neural Netw Learn Syst 28(9):1974\u20131984","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"2246_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106224","volume":"204","author":"Q-Q Pang","year":"2020","unstructured":"Pang Q-Q, Zhang L (2020) Semi-supervised neighborhood discrimination index for feature selection. Knowl-Based Syst 204:106224","journal-title":"Knowl-Based Syst"},{"key":"2246_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2023.110521","volume":"269","author":"R Sheikhpour","year":"2023","unstructured":"Sheikhpour R, Berahmand K, Forouzandeh S (2023) Hessian-based semi-supervised feature selection using generalized uncorrelated constraint. Knowl-Based Syst 269:110521","journal-title":"Knowl-Based Syst"},{"key":"2246_CR11","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/j.ins.2022.07.102","volume":"609","author":"J Lai","year":"2022","unstructured":"Lai J, Chen H, Li T, Yang X (2022) Adaptive graph learning for semi-supervised feature selection with redundancy minimization. Inf Sci 609:465\u2013488","journal-title":"Inf Sci"},{"issue":"6","key":"2246_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3136625","volume":"50","author":"J Li","year":"2017","unstructured":"Li J, Cheng K, Wang S, Morstatter F, Trevino RP, Tang J, Liu H (2017) Feature selection: a data perspective. ACM Comput Surv 50(6):1\u201345","journal-title":"ACM Comput Surv"},{"key":"2246_CR13","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198538493.001.0001","volume-title":"Neural networks for pattern recognition","author":"CM Bishop","year":"1995","unstructured":"Bishop CM (1995) Neural networks for pattern recognition. Oxford University Press, Oxford"},{"issue":"1","key":"2246_CR14","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1023\/A:1025667309714","volume":"53","author":"M Robnik-\u0160ikonja","year":"2003","unstructured":"Robnik-\u0160ikonja M, Kononenko I (2003) Theoretical and empirical analysis of ReliefF and RReliefF. Mach Learn 53(1):23\u201369","journal-title":"Mach Learn"},{"issue":"8","key":"2246_CR15","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":"2246_CR16","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1007\/s10462-019-09682-y","volume":"53","author":"S Solorio-Fern\u00e1ndez","year":"2020","unstructured":"Solorio-Fern\u00e1ndez S, Carrasco-Ochoa JA, Mart\u00ednez-Trinidad JF (2020) A review of unsupervised feature selection methods. Artif Intell Rev 53(2):907\u2013948","journal-title":"Artif Intell Rev"},{"issue":"4","key":"2246_CR17","doi-asserted-by":"publisher","first-page":"854","DOI":"10.1016\/j.patcog.2010.10.006","volume":"44","author":"M Breaban","year":"2011","unstructured":"Breaban M, Luchian H (2011) A unifying criterion for unsupervised clustering and feature selection. Pattern Recogn 44(4):854\u2013865","journal-title":"Pattern Recogn"},{"key":"2246_CR18","doi-asserted-by":"crossref","unstructured":"Guo J, Zhu W (2018) Dependence guided unsupervised feature selection. Proceedings of the AAAI Conference on Artificial Intelligence 32:1","DOI":"10.1609\/aaai.v32i1.11904"},{"issue":"1","key":"2246_CR19","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1109\/TKDE.2018.2879797","volume":"32","author":"X Chen","year":"2020","unstructured":"Chen X, Yuan G, Nie F, Ming Z (2020) Semi-supervised feature selection via sparse rescaled linear square regression. IEEE Trans Knowl Data Eng 32(1):165\u2013176","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"2246_CR20","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s10994-017-5648-2","volume":"107","author":"K Sechidis","year":"2018","unstructured":"Sechidis K, Brown G (2018) Simple strategies for semi-supervised feature selection. Mach Learn 107(2):357\u2013395","journal-title":"Mach Learn"},{"key":"2246_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.119130","volume":"214","author":"F Karimi","year":"2023","unstructured":"Karimi F, Dowlatshahi MB, Hashemi A (2023) SemiAco: a semi-supervised feature selection based on ant colony optimization. Expert Syst Appl 214:119130","journal-title":"Expert Syst Appl"},{"key":"2246_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.109243","volume":"251","author":"J Lai","year":"2022","unstructured":"Lai J, Chen H, Li W, Li T, Wan J (2022) Semi-supervised feature selection via adaptive structure learning and constrained graph learning. Knowl-Based Syst 251:109243","journal-title":"Knowl-Based Syst"},{"key":"2246_CR23","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/j.patcog.2016.08.011","volume":"61","author":"Y Wang","year":"2017","unstructured":"Wang Y, Wang J, Liao H, Chen H (2017) An efficient semi-supervised representatives feature selection algorithm based on information theory. Pattern Recogn 61:511\u2013523","journal-title":"Pattern Recogn"},{"key":"2246_CR24","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.neucom.2012.10.028","volume":"121","author":"G Doquire","year":"2013","unstructured":"Doquire G, Verleysen M (2013) A graph laplacian based approach to semi-supervised feature selection for regression problems. Neurocomputing 121:5\u201313","journal-title":"Neurocomputing"},{"issue":"2","key":"2246_CR25","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s10994-019-05855-6","volume":"109","author":"JE Van Engelen","year":"2020","unstructured":"Van Engelen JE, Hoos HH (2020) A survey on semi-supervised learning. Mach Learn 109(2):373\u2013440","journal-title":"Mach Learn"},{"issue":"6062","key":"2246_CR26","doi-asserted-by":"publisher","first-page":"1518","DOI":"10.1126\/science.1205438","volume":"334","author":"DN Reshef","year":"2011","unstructured":"Reshef DN, Reshef YA, Finucane HK, Grossman SR, McVean G, Turnbaugh PJ, Lander ES, Mitzenmacher M, Sabeti PC (2011) Detecting novel associations in large data sets. Science 334(6062):1518\u20131524","journal-title":"Science"},{"key":"2246_CR27","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.patrec.2016.05.007","volume":"80","author":"Q Zhu","year":"2016","unstructured":"Zhu Q, Feng J, Huang J (2016) Natural neighbor: a self-adaptive neighborhood method without parameter K. Pattern Recogn Lett 80:30\u201336","journal-title":"Pattern Recogn Lett"},{"key":"2246_CR28","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.ins.2022.12.078","volume":"624","author":"S Ding","year":"2023","unstructured":"Ding S, Du W, Xu X, Shi T, Wang Y, Li C (2023) An improved density peaks clustering algorithm based on natural neighbor with a merging strategy. Inf Sci 624:252\u2013276","journal-title":"Inf Sci"},{"key":"2246_CR29","doi-asserted-by":"crossref","unstructured":"Peng H, Zhang J, Huang X, Hao Z, Li A, Yu Z, Yu PS (2024) Unsupervised social bot detection via structural information theory. arXiv preprint arXiv:2404.13595 (2024)","DOI":"10.1145\/3660522"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-024-02246-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-024-02246-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-024-02246-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T05:22:19Z","timestamp":1728451339000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-024-02246-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,15]]},"references-count":29,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["2246"],"URL":"https:\/\/doi.org\/10.1007\/s13042-024-02246-9","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,15]]},"assertion":[{"value":"27 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 June 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}