{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:47:52Z","timestamp":1778251672731,"version":"3.51.4"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,8,4]],"date-time":"2010-08-04T00:00:00Z","timestamp":1280880000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sign Process Syst"],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1007\/s11265-010-0511-8","type":"journal-article","created":{"date-parts":[[2010,8,3]],"date-time":"2010-08-03T06:56:44Z","timestamp":1280818604000},"page":"351-359","source":"Crossref","is-referenced-by-count":4,"title":["Correlated Noise: How it Breaks NMF, and What to Do About it"],"prefix":"10.1007","volume":"65","author":[{"given":"Sergey M.","family":"Plis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vamsi K.","family":"Potluru","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Terran","family":"Lane","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vince D.","family":"Calhoun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,8,4]]},"reference":[{"key":"511_CR1","unstructured":"Daniel\u00a0Lee, D., & Sebastian\u00a0Seung, H. (2000). Algorithms for non-negative matrix factorization. In NIPS (pp. 556\u2013562)."},{"issue":"4","key":"511_CR2","doi-asserted-by":"crossref","first-page":"1148","DOI":"10.1016\/j.neuroimage.2007.05.031","volume":"37","author":"G Lohmann","year":"2007","unstructured":"Lohmann, G., Volz, K.\u00a0G., & Ullsperger, M. (2007). Using non-negative matrix factorization for single-trial analysis of fMRI data. Neuroimage, 37(4), 1148\u20131160.","journal-title":"Neuroimage"},{"key":"511_CR3","doi-asserted-by":"crossref","unstructured":"Potluru, V. K., & Calhoun, V. D. (2008). Group learning using contrast NMF: Application to functional and structural MRI of schizophrenia. In IEEE International Symposium on Circuits and Systems, 2008 (ISCAS 2008) (pp. 1336\u20131339).","DOI":"10.1109\/ISCAS.2008.4541673"},{"key":"511_CR4","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/j.jneumeth.2006.11.008","volume":"161","author":"M M\u00f8rup","year":"2007","unstructured":"M\u00f8rup, M., Hansen, L. K., & Arnfred, S. M. (2007). ERPWAVELAB a toolbox for multi-channel analysis of time-frequency transformed event related potentials. Journal of Neuroscience Method, 161, 361\u2013368.","journal-title":"Journal of Neuroscience Method"},{"issue":"7","key":"511_CR5","doi-asserted-by":"crossref","first-page":"1000029","DOI":"10.1371\/journal.pcbi.1000029","volume":"4","author":"K Devarajan","year":"2008","unstructured":"Devarajan, K. (2008). Nonnegative matrix factorization: An analytical and interpretive tool in computational biology. PLoS Computational Biology, 4(7), e1000029.","journal-title":"PLoS Computational Biology"},{"key":"511_CR6","volume-title":"Advances in neural information processing systems 16","author":"D Donoho","year":"2004","unstructured":"Donoho, D., & Stodden, V. (2004). When does non-negative matrix factorization give a correct decomposition into parts? In S. Thrun, L. Saul, & B. Sch\u00f6lkopf (Eds.), Advances in neural information processing systems 16. Cambridge: MIT Press."},{"key":"511_CR7","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1186\/1471-2105-7-175","volume":"7","author":"G Wang","year":"2006","unstructured":"Wang, G., Kossenkov, A. V., & Ochs, M. F. (2006). LS-NMF: A modified non-negative matrix factorization algorithm utilizing uncertainty estimates. BMC Bioinformatics, 7, 175.","journal-title":"BMC Bioinformatics"},{"key":"511_CR8","unstructured":"Stark, H., & Woods, J. W. (2002). Probability and random processes with applications to signal processing. Prentice Hall Upper Saddle River."},{"key":"511_CR9","doi-asserted-by":"crossref","first-page":"361705","DOI":"10.1155\/2008\/361705","volume":"2008","author":"MN Schmidt","year":"2008","unstructured":"Schmidt, M.\u00a0N., & Laurberg, H. (2008). Nonnegative matrix factorization with Gaussian process priors. Computational Intelligence and Neuroscience, 2008, 361705.","journal-title":"Computational Intelligence and Neuroscience"},{"issue":"14","key":"511_CR10","doi-asserted-by":"crossref","first-page":"2447","DOI":"10.1016\/S0167-8655(03)00089-8","volume":"24","author":"D Guillamet","year":"2003","unstructured":"Guillamet, D., Vitri, J., & Schiele, B. (2003). Introducing a weighted non-negative matrix factorization for image classification. Pattern Recognition Letters, 24(14), 2447\u20132454.","journal-title":"Pattern Recognition Letters"},{"key":"511_CR11","first-page":"793","volume-title":"ISNN 07: Proceedings of the 4th international symposium on neural networks","author":"A Cichocki","year":"2007","unstructured":"Cichocki, A., & Zdunek, R. (2007). Regularized alternating least squares algorithms for non-negative matrix\/tensor factorization. In ISNN 07: Proceedings of the 4th international symposium on neural networks (pp. 793\u2013802). Berlin, Heidelberg: Springer."},{"issue":"10","key":"511_CR12","doi-asserted-by":"crossref","first-page":"2756","DOI":"10.1162\/neco.2007.19.10.2756","volume":"19","author":"C-J Lin","year":"2007","unstructured":"Lin, C.-J. (2007). Projected gradient methods for nonnegative matrix factorization. Neural Computation, 19(10), 2756\u20132779.","journal-title":"Neural Computation"},{"key":"511_CR13","doi-asserted-by":"crossref","unstructured":"O\u2018Grady, P.\u00a0D., & Pearlmutter, B.\u00a0A. (2006). Convolutive non-negative matrix factorisation with a sparseness constraint. In Proceedings of the IEEE international workshop on Machine Learning for Signal Processing (MLSP 2006) (pp. 427\u2013432). Maynooth, Ireland.","DOI":"10.1109\/MLSP.2006.275588"},{"key":"511_CR14","doi-asserted-by":"crossref","unstructured":"Hoyer, P. O. (2002). Non-negative sparse coding. In Proceedings of the 2002 12th IEEE workshop on Neural networks for signal processing, 2002 (pp. 557\u2013565).","DOI":"10.1109\/NNSP.2002.1030067"},{"key":"511_CR15","doi-asserted-by":"crossref","unstructured":"Potluru, V. K., Plis, S. M., & Calhoun, V. D. (2008). Sparse shift-invariant NMF. In IEEE Southwest Symposium on Image analysis and interpretation, 2008 (SSIAI 2008) (pp. 69\u201372).","DOI":"10.1109\/SSIAI.2008.4512287"},{"key":"511_CR16","doi-asserted-by":"crossref","unstructured":"Smaragdis, P. (2004). Non-negative matrix factor deconvolution; extraction of multiple sound sources from monophonic inputs. In International Congress on Independent Component Analysis and Blind Signal Separation.","DOI":"10.1007\/978-3-540-30110-3_63"},{"key":"511_CR17","unstructured":"Petersen, K. B., & Pedersen, M. S. (2008). The matrix cookbook. Version 20081110."}],"container-title":["Journal of Signal Processing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-010-0511-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11265-010-0511-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-010-0511-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T08:19:34Z","timestamp":1559377174000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11265-010-0511-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,4]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["511"],"URL":"https:\/\/doi.org\/10.1007\/s11265-010-0511-8","relation":{},"ISSN":["1939-8018","1939-8115"],"issn-type":[{"value":"1939-8018","type":"print"},{"value":"1939-8115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,8,4]]}}}