{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:19:40Z","timestamp":1740169180273,"version":"3.37.3"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871128"],"award-info":[{"award-number":["11871128"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005230","name":"Natural Science Foundation of Chongqing","doi-asserted-by":"publisher","award":["cstc2019jcyj-msxmX0282","cstc2019jcyj-msxmX0368"],"award-info":[{"award-number":["cstc2019jcyj-msxmX0282","cstc2019jcyj-msxmX0368"]}],"id":[{"id":"10.13039\/501100005230","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007957","name":"Chongqing Municipal Education Commission","doi-asserted-by":"publisher","award":["KJQN201900531"],"award-info":[{"award-number":["KJQN201900531"]}],"id":[{"id":"10.13039\/501100007957","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2981429","type":"journal-article","created":{"date-parts":[[2020,3,17]],"date-time":"2020-03-17T21:04:29Z","timestamp":1584479069000},"page":"53962-53971","source":"Crossref","is-referenced-by-count":0,"title":["A New DC Algorithm for Sparse Optimal Scoring Problem"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3731-6848","authenticated-orcid":false,"given":"Guo-Quan","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5776-0014","authenticated-orcid":false,"given":"Xu-Xiang","family":"Duan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chang-Zhi","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105768"},{"key":"ref11","first-page":"517","article-title":"Generalized power method for sparse principal component analysis","volume":"11","author":"journ\u00e9e","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-016-9828-y"},{"key":"ref13","article-title":"Proximal methods for sparse optimal scoring and discriminant analysis","author":"atkins","year":"2017","journal-title":"arXiv 1705 07194"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiolchem.2008.07.015"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2015.12.068"},{"key":"ref16","first-page":"289","article-title":"Convex analysis approach to D.C. Programming: Theory, algorithms and applications","volume":"22","author":"tao","year":"1997","journal-title":"Acta Math Vietn"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-1235-y"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.3934\/jimo.2014.10.817"},{"key":"ref19","article-title":"DBWorld e-mail classification using a very small corpus","author":"filannino","year":"0","journal-title":"Project of Machine Learning Course"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1080\/00401706.2012.746208"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2726543"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp019"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.3724\/SP.J.1087.2012.01017"},{"key":"ref8","article-title":"Multiclass sparse discriminant analysis","author":"mai","year":"2015","journal-title":"arXiv 1504 05845"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2020.107456"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2016.2602354"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1214\/088342306000000060"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2422994"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.27"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1021\/jf950305a"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1021\/jf0108967"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.mimet.2006.12.020"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1021\/jf030232s"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09039647.pdf?arnumber=9039647","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T01:09:13Z","timestamp":1641949753000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9039647\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2981429","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}