{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T09:32:35Z","timestamp":1780738355437,"version":"3.54.1"},"reference-count":80,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2014,9,1]],"date-time":"2014-09-01T00:00:00Z","timestamp":1409529600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Signal Process. Mag."],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1109\/msp.2014.2327238","type":"journal-article","created":{"date-parts":[[2014,8,18]],"date-time":"2014-08-18T19:58:57Z","timestamp":1408391937000},"page":"18-31","source":"Crossref","is-referenced-by-count":191,"title":["Modeling and Optimization for Big Data Analytics: (Statistical) learning tools for our era of data deluge"],"prefix":"10.1109","volume":"31","author":[{"given":"Konstantinos","family":"Slavakis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Georgios B.","family":"Giannakis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gonzalo","family":"Mateos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref73","article-title":"Pattern alternating maximization algorithm for missing data in large p small n problems","author":"st\u00e4dler","year":"0","journal-title":"J Mach Learn Res"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1007\/11503415_37"},{"key":"ref71","first-page":"67","article-title":"Real-time online singing voice separation from monaural recordings using robust low-rank modeling","author":"sprechmann","year":"0","journal-title":"Proc Int'l Conf on Music Information Retrieval"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1214\/12-AOS1034"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1016\/j.chemolab.2004.07.003"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1023\/A:1017501703105"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1007\/BF02294992"},{"key":"ref39","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1038\/44565","article-title":"Learning the parts of objects by non-negative matrix factorization","volume":"401","author":"lee","year":"1999","journal-title":"Nature"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2010.938752"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015492"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2010.939739"},{"key":"ref79","first-page":"96","article-title":"Adaptive switching circuits","volume":"4","author":"widrow","year":"1960","journal-title":"IRE Wescon Conv Rec"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2120270"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1985.13167"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.3150\/12-BEJSP17"},{"key":"ref30","year":"0"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(77)90069-6"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"ref35","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-88146-1","author":"kolaczyk","year":"2009","journal-title":"Statistical Analysis of Network Data Methods and Models"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1111\/rssb.12050"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729586"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2007.906734"},{"key":"ref61","first-page":"119","article-title":"Think globally, fit locally: Unsupervised learning of low dimensional manifolds","volume":"4","author":"saul","year":"2003","journal-title":"J Mach Learn Res"},{"key":"ref63","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4175.001.0001","author":"sch\u00f6lkopf","year":"2001","journal-title":"Learning with kernels"},{"key":"ref28","author":"hastie","year":"2009","journal-title":"The Elements of Statistical Learning Data Mining Inference and Prediction"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2293126"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2012.6375887"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1561\/2200000018"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2011.2151856"},{"key":"ref29","first-page":"1568","article-title":"Incremental gradient on the Grassmannian for online foreground and background separation in subsampled video","author":"he","year":"0","journal-title":"Proc IEEE Conf Computer Vision and Pattern Recognition"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2040671"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2014.6853549"},{"key":"ref69","author":"solo","year":"1995","journal-title":"Adaptive Signal Processing Algorithms Stability and Performance"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"4311","DOI":"10.1109\/TSP.2006.881199","article-title":"K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation","volume":"54","author":"aharon","year":"2006","journal-title":"IEEE Trans Signal Processing"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.chemolab.2010.08.004"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2006.08.023"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1791212.1791218"},{"key":"ref21","first-page":"404","article-title":"Online robust PCA via stochastic optimization","author":"feng","year":"0","journal-title":"Proc Advances in Neural Information Processing Systems"},{"key":"ref24","year":"0"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2325798"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2013.2245726"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1088\/0031-9155\/56\/11\/002"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2417491"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2055862"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1137\/120891009"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2013.6736701"},{"key":"ref57","first-page":"59","article-title":"Large scale tensor decompositions: Algorithmic developments and applications","volume":"36","author":"papalexakis","year":"2013","journal-title":"IEEE Data Eng Bull"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1016\/S0042-6989(97)00169-7"},{"key":"ref55","year":"2012","journal-title":"Big data research and development initiative Executive Office of the President"},{"key":"ref54","first-page":"543","article-title":"A method for solving the convex programming problem with convergence rate O(1\/k2)","volume":"269","author":"nesterov","year":"1983","journal-title":"Dokl Mad Nauk SSSR"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792240406"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2204986"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.914731"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/090761793"},{"key":"ref15","first-page":"752","article-title":"Recursive sparse recovery in large but correlated noise","author":"chenlu","year":"0","journal-title":"Proc Allerton Conf Communication Control and Computing"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2282910"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488620"},{"key":"ref18","article-title":"Data, data everywhere","author":"cukier","year":"2010","journal-title":"The Economist"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/27\/10\/105008"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5706976"},{"key":"ref3","author":"baingana","year":"0","journal-title":"Embedding graphs under centrality constraints for network visualization"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2013.2253354"},{"key":"ref5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-9467-7","author":"bauschke","year":"2011","journal-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1214\/193940307000000518"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2278516"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2257913"},{"key":"ref9","author":"bertsekas","year":"1999","journal-title":"Parallel and Distributed Computation Numerical Methods"},{"key":"ref46","first-page":"19","article-title":"Online learning for matrix factorization and sparse coding","volume":"11","author":"mairal","year":"2010","journal-title":"J Machine Learn Res"},{"key":"ref45","first-page":"123","article-title":"Randomized algorithms for matrices and data","volume":"3","author":"mahoney","year":"2011","journal-title":"Found Trends Machine Learn"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2012.2233193"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2279080"},{"key":"ref42","article-title":"GraphLab: A new framework for parallel machine learning","author":"low","year":"0","journal-title":"Proc Conf Uncertainty of Artificial Intelligence"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.39"},{"key":"ref44","author":"mackey","year":"0","journal-title":"Distributed matrix completion and robust factorization"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2010.940005"}],"container-title":["IEEE Signal Processing Magazine"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/79\/6879573\/06879577.pdf?arnumber=6879577","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T07:56:12Z","timestamp":1746345372000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6879577"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9]]},"references-count":80,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/msp.2014.2327238","relation":{},"ISSN":["1053-5888"],"issn-type":[{"value":"1053-5888","type":"print"}],"subject":[],"published":{"date-parts":[[2014,9]]}}}