{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:24:04Z","timestamp":1750220644403,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,11,6]],"date-time":"2020-11-06T00:00:00Z","timestamp":1604620800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"??(??)????????"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,11,6]]},"DOI":"10.1145\/3443467.3443722","type":"proceedings-article","created":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T23:43:58Z","timestamp":1612223038000},"page":"16-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Feature Selection Algorithm based on Sparse Effective Distance combined with sPCA for Microarray Data"],"prefix":"10.1145","author":[{"given":"Shen","family":"NingMin","sequence":"first","affiliation":[{"name":"China Mobile (SuZhou)Software Technology Company, SuZhou City China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fan","family":"YaQiong","sequence":"additional","affiliation":[{"name":"China Mobile (SuZhou)Software Technology Company, SuZhou City China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Long","family":"Peng","sequence":"additional","affiliation":[{"name":"China Mobile (SuZhou)Software Technology Company, SuZhou City China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,2]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"International Journal of Knowledge-based and Intelligent Engineering Systems","author":"Analysis L O D I","year":"2016","unstructured":"Analysis L O D I, Center H G, Science I O M, et al. A feature selection method using fixed-point algorithm for DNA microarray gene expression data[J]. International Journal of Knowledge-based and Intelligent Engineering Systems, 2016."},{"key":"e_1_3_2_1_2_1","first-page":"228","volume-title":"Information Sciences[J]","author":"Maldonado S","year":"2014","unstructured":"Maldonado S, Weber R, Famili F, Feature selection for high-dimensional class-imbalanced data sets using Support Vector Machin, Information Sciences[J], 2014, pp. 228--246."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2010.103"},{"key":"e_1_3_2_1_4_1","volume-title":"International journal of data mining and bioinformatics","author":"Yao D","year":"2015","unstructured":"Yao D, Yang J, Zhan X, et al.(2015), A novel random forests-based feature selectionmethod for microarray expression data analysis[J], International journal of data mining and bioinformatics, Vol.1, No. 13, pp. 84--101."},{"volume-title":"Improving accuracy of microarray classification by a simple multi-task feature selection filter[C], bioinformatics","author":"Lan L","key":"e_1_3_2_1_5_1","unstructured":"Lan L, Vucetic S.(2011), Improving accuracy of microarray classification by a simple multi-task feature selection filter[C], bioinformatics, Vol.2, No. 5, pp. 189--208."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJDMB.2015.070071"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00180-013-0434-5"},{"issue":"3","key":"e_1_3_2_1_8_1","first-page":"182","article-title":"Sparse principal component analysis in cancer research[J]","volume":"3","author":"Hsu P. Y.","year":"2014","unstructured":"Y. L. Hsu, P. Y. Huang and D. T. Chen.(2014), Sparse principal component analysis in cancer research[J], Translational Cancer Research, Vol. 3, No. 3, pp. 182--190.","journal-title":"Translational Cancer Research"},{"key":"e_1_3_2_1_9_1","first-page":"1269","article-title":"Optimal solutions for sparse principal component analysis[J]","volume":"9","author":"Aspremont A","year":"2008","unstructured":"d'Aspremont A, Bach F, Ghaoui L E.(2008), Optimal solutions for sparse principal component analysis[J], The Journal of Machine Learning Research, Vol. 9, pp. 1269--1294.","journal-title":"The Journal of Machine Learning Research"},{"issue":"15","key":"e_1_3_2_1_10_1","first-page":"265","article-title":"Sparse principal component analysis[J]","volume":"2","author":"Zou H","year":"2008","unstructured":"Zou H, Hastie T, Tibshirani R.(2008), Sparse principal component analysis[J], Journal of computational and graphical statistics, Vol. 2, No.15, pp. 265--286.","journal-title":"Journal of computational and graphical statistics"},{"key":"e_1_3_2_1_11_1","first-page":"507","volume-title":"Advances in neural information processing systems","author":"He X","unstructured":"He X, Cai D, Niyogi P.(2005) Laplacian score for feature selection[J], Advances in neural information processing systems, pp. 507--514."}],"event":{"name":"EITCE 2020: 2020 4th International Conference on Electronic Information Technology and Computer Engineering","acronym":"EITCE 2020","location":"Xiamen China"},"container-title":["Proceedings of the 2020 4th International Conference on Electronic Information Technology and Computer Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3443467.3443722","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3443467.3443722","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:13Z","timestamp":1750197733000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3443467.3443722"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,6]]},"references-count":11,"alternative-id":["10.1145\/3443467.3443722","10.1145\/3443467"],"URL":"https:\/\/doi.org\/10.1145\/3443467.3443722","relation":{},"subject":[],"published":{"date-parts":[[2020,11,6]]},"assertion":[{"value":"2021-02-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}