乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T01:10:20Z","timestamp":1732669820688,"version":"3.28.2"},"reference-count":73,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/tsp.2024.3469830","type":"journal-article","created":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T17:32:59Z","timestamp":1727803979000},"page":"4798-4811","source":"Crossref","is-referenced-by-count":0,"title":["A Framework for Compressed Weighted Nonnegative Matrix Factorization"],"prefix":"10.1109","volume":"72","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-4147-2453","authenticated-orcid":false,"given":"Farouk","family":"Yahaya","sequence":"first","affiliation":[{"name":"Université du Littoral Côte d’Opale, Calais, France"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-3264-4981","authenticated-orcid":false,"given":"Matthieu","family":"Puigt","sequence":"additional","affiliation":[{"name":"Université du Littoral Côte d’Opale, Calais, France"}]},{"ORCID":"http:\/\/orcid.org\/0000-0003-4425-4507","authenticated-orcid":false,"given":"Gilles","family":"Delmaire","sequence":"additional","affiliation":[{"name":"Université du Littoral Côte d’Opale, Calais, France"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-8531-1566","authenticated-orcid":false,"given":"Gilles","family":"Roussel","sequence":"additional","affiliation":[{"name":"Université du Littoral Côte d’Opale, Calais, France"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1201\/b17558-15"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2016.2535298"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/env.3170050203"},{"key":"ref4","first-page":"556","article-title":"Algorithms for non-negative matrix factorization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"13","author":"Lee","year":"2000"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.3390\/e13010134"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1162\/neco.2008.04-08-771"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.apnum.2014.05.009"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2306181"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/NNSP.2002.1030067"},{"article-title":"Sparse NMF\u2014Half-baked or well done?","year":"2015","author":"Roux","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.45"},{"key":"ref12","first-page":"1329","article-title":"Maximum-margin matrix factorization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"17","author":"Srebro","year":"2004"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2012.2228474"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.231"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2213994"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.226"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/070709967"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2007.895831"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1162\/neco.2007.19.10.2756"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/07069239X"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772760"},{"key":"ref22","first-page":"19","article-title":"Online learning for matrix factorization and sparse coding","volume":"11","author":"Mairal","year":"2010","journal-title":"J. Mach. Learn. Res."},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2842602"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972801.25"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2516971"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2018.01.007"},{"article-title":"Faster-than-fast NMF using random projections and Nesterov iterations","volume-title":"Proc. Int. Traveling Workshop Interact. Between Low-Complexity Data Models Sens. Techn. (iTWIST)","year":"2018","author":"Yahaya","key":"ref28"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2018.2811962"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(03)00089-8"},{"article-title":"Non negative matrix factorization algorithms and applications","year":"2008","author":"Ho","key":"ref32"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2009.4959890"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.23919\/EUSIPCO.2019.8903036"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972764.58"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1028788.1028827"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.3390\/e21030253"},{"issue":"2","key":"ref38","first-page":"372","article-title":"A method of solving a convex programming problem with convergence rate O(1\/k2)","volume":"27","author":"Nesterov","year":"1983","journal-title":"Sov. Math. Doklady"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-53547-0_3"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2018.8461325"},{"article-title":"Applications of stochastic gradient descent to nonnegative matrix factorization","year":"2019","author":"Slavin","key":"ref41"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2021.3100067"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3184286"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/026\/737400"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1137\/18M1183480"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1561\/2200000035"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00599-2_19"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2190410"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283064"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.277"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2190406"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1137\/130938700"},{"key":"ref53","first-page":"2101","article-title":"How to fake multiply by a Gaussian matrix","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Kapralov","year":"2016"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/3019134"},{"key":"ref55","first-page":"5690","article-title":"Compressed factorization: Fast and accurate low-rank factorization of compressively-sensed data","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Sharan","year":"2019"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-017-5673-1"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1137\/130940670"},{"key":"ref58","first-page":"1","article-title":"Positive matrix factorization of large aerosol mass spectrometry datasets using error-weighted randomized hierarchical alternating least squares","volume":"2022","author":"Sapper","year":"2022","journal-title":"EGUsphere"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9414742"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/ICSMC.2004.1400815"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2014.04.001"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23222-5_62"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"article-title":"Learning with matrix factorizations","year":"2004","author":"Srebro","key":"ref64"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976410"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-012-0044-1"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5706976"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2015.2392491"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23222-5"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2016.12.024"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2017.2728181"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.3906\/elk-1111-11"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/78\/10347386\/10702524.pdf?arnumber=10702524","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T00:39:34Z","timestamp":1732667974000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10702524\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":73,"URL":"https:\/\/doi.org\/10.1109\/tsp.2024.3469830","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"type":"print","value":"1053-587X"},{"type":"electronic","value":"1941-0476"}],"subject":[],"published":{"date-parts":[[2024]]}}}