{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T13:21:38Z","timestamp":1762608098434,"version":"3.37.3"},"reference-count":51,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100013209","name":"Hellenic Foundation for Research and Innovation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100013209","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Informatics and Telematics Institute research"},{"DOI":"10.13039\/501100003448","name":"General Secretariat for Research and Technology","doi-asserted-by":"publisher","award":["ASPENDYS_ T1E \u0394 K-02264"],"award-info":[{"award-number":["ASPENDYS_ T1E \u0394 K-02264"]}],"id":[{"id":"10.13039\/501100003448","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Emerg. Top. Comput. Intell."],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1109\/tetci.2020.3042268","type":"journal-article","created":{"date-parts":[[2020,12,23]],"date-time":"2020-12-23T20:40:34Z","timestamp":1608756034000},"page":"192-204","source":"Crossref","is-referenced-by-count":4,"title":["Non-Negative Sparse PCA: An Intelligible Exact Approach"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2590-325X","authenticated-orcid":false,"given":"Ioannis","family":"Tsingalis","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9939-7930","authenticated-orcid":false,"given":"Constantine","family":"Kotropoulos","sequence":"additional","affiliation":[]},{"given":"Anastasios","family":"Drosou","sequence":"additional","affiliation":[]},{"given":"Dimitrios","family":"Tzovaras","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref1","first-page":"1017","article-title":"Deflation methods for sparse PCA","volume-title":"Proc. Adv. Neural Inf. Process. Syst. Adv. Neural Inf. Process. Syst.","author":"Mackey","year":"2009"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2018.2877582"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/7503.003.0200"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2910585"},{"key":"ref5","first-page":"41","article-title":"A direct formulation for sparse PCA using semidefinite programming","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"dAspremont","year":"2005"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273519"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390277"},{"key":"ref8","first-page":"1728","article-title":"Nonnegative sparse pca with provable guarantees","volume-title":"Proc. 31st Int. Conf. Mach. Learn.","author":"Asteris","year":"2014"},{"key":"ref9","first-page":"298","article-title":"Optimal sparse linear encoders and sparse PCA","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Ismail","year":"2016"},{"key":"ref10","first-page":"747","article-title":"Sparse PCA through low-rank approximations","volume-title":"Proc. 30th Int. Conf. Mach. Learn.","author":"Papailiopoulos","year":"2013"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2427451"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3046948"},{"key":"ref13","article-title":"Approximation algorithms for sparse principal component analysis","author":"Chowdhury","year":"2020","journal-title":"arXiv:2006.12748"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref15","first-page":"4152","article-title":"Fast algorithms for robust PCA via gradient descent","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Yi","year":"2016"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2017.2671849"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2924520"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2020.3007673"},{"key":"ref19","first-page":"7493","article-title":"Greedy orthogonal pivoting algorithm for non-negative matrix factorization","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","author":"Zhang","year":"2019"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2018.01.007"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.12.004"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2019.2962679"},{"key":"ref23","first-page":"343","article-title":"Orthogonal NMF through subspace exploration","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Asteris","year":"2015"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1142\/S0129065789000475"},{"volume-title":"Nonlinear Programming,","year":"2017","author":"Bertsekas","key":"ref25"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2017.2665557"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TSA.2005.858055"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TASL.2009.2036813"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TASL.2010.2040784"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36079-4_29"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1038\/44565"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186009"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2008.06.002"},{"issue":"38","key":"ref34","first-page":"1853","article-title":"Analysis of financial data using non-negative matrix factorization","volume":"3","author":"Frin","year":"2008","journal-title":"Int. J. Math. Sci."},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1080\/14697680903124632"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2019.8804397"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btr522"},{"volume-title":"Digital Neural Networks","year":"1993","author":"Kung","key":"ref38"},{"key":"ref39","first-page":"249","article-title":"Understanding the difficulty of training deep feedforward neural networks","volume-title":"Proc. 13th Int. Conf. Artif. Intell. Statist.","author":"Glorot","year":"2010"},{"article-title":"Learning and example selection for object and pattern recognition","year":"1996","author":"Sung","key":"ref40"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"ref42","article-title":"Fashion-MNIST: A novel image dataset for benchmarking Machine Learning algorithms","author":"Xiao","year":"2017","journal-title":"arXiv:1708.07747"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1198\/106186006X113430"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2005.10.010"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2011.941551"},{"volume-title":"Principles of Corporate Finance","year":"2016","author":"Brealey","key":"ref46"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1002\/SERIES1345"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.3905\/jpm.1994.409501"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ICPADS51040.2020.00013"},{"key":"ref50","article-title":"On the variance of the adaptive learning rate and beyond","volume-title":"Proc. 20th Int. Conf. Learn. Representations","author":"Liu","year":"2020"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719512"}],"container-title":["IEEE Transactions on Emerging Topics in Computational Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7433297\/9687848\/09305265.pdf?arnumber=9305265","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T23:21:03Z","timestamp":1704842463000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9305265\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2]]},"references-count":51,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tetci.2020.3042268","relation":{},"ISSN":["2471-285X"],"issn-type":[{"type":"electronic","value":"2471-285X"}],"subject":[],"published":{"date-parts":[[2022,2]]}}}