{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T16:01:23Z","timestamp":1784044883454,"version":"3.55.0"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"24","license":[{"start":{"date-parts":[[2021,10,4]],"date-time":"2021-10-04T00:00:00Z","timestamp":1633305600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,10,4]],"date-time":"2021-10-04T00:00:00Z","timestamp":1633305600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["91748105"],"award-info":[{"award-number":["91748105"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Foundation in China","award":["JCKY2019110B009"],"award-info":[{"award-number":["JCKY2019110B009"]}]},{"name":"Fundamental Research Funds for the Central Universities in Dalian University of Technology","award":["DUT20LAB303"],"award-info":[{"award-number":["DUT20LAB303"]}]},{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","award":["201600090043"],"award-info":[{"award-number":["201600090043"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Foundation in China","award":["2020-JCJQ-JJ-252"],"award-info":[{"award-number":["2020-JCJQ-JJ-252"]}]},{"name":"Fundamental Research Funds for the Central Universities in Dalian University of Technology","award":["DUT20LAB308"],"award-info":[{"award-number":["DUT20LAB308"]}]},{"DOI":"10.13039\/501100005222","name":"University of Jyv\u00e4skyl\u00e4","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100005222","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput &amp; Applic"],"published-print":{"date-parts":[[2021,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Nonnegative tensor decomposition is a versatile tool for multiway data analysis, by which the extracted components are nonnegative and usually sparse. Nevertheless, the sparsity is only a side effect and cannot be explicitly controlled without additional regularization. In this paper, we investigated the nonnegative CANDECOMP\/PARAFAC (NCP) decomposition with the sparse regularization item using <jats:inline-formula><jats:alternatives><jats:tex-math>$$l_1$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>l<\/mml:mi>\n                    <mml:mn>1<\/mml:mn>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-norm (sparse NCP). When high sparsity is imposed, the factor matrices will contain more zero components and will not be of full column rank. Thus, the sparse NCP is prone to rank deficiency, and the algorithms of sparse NCP may not converge. In this paper, we proposed a novel model of sparse NCP with the proximal algorithm. The subproblems in the new model are strongly convex in the block coordinate descent (BCD) framework. Therefore, the new sparse NCP provides a full column rank condition and guarantees to converge to a stationary point. In addition, we proposed an inexact BCD scheme for sparse NCP, where each subproblem is updated multiple times to speed up the computation. In order to prove the effectiveness and efficiency of the sparse NCP with the proximal algorithm, we employed two optimization algorithms to solve the model, including inexact alternating nonnegative quadratic programming and inexact hierarchical alternating least squares. We evaluated the proposed sparse NCP methods by experiments on synthetic, real-world, small-scale, and large-scale tensor data. The experimental results demonstrate that our proposed algorithms can efficiently impose sparsity on factor matrices, extract meaningful sparse components, and outperform state-of-the-art methods.<\/jats:p>","DOI":"10.1007\/s00521-021-06325-8","type":"journal-article","created":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T03:39:57Z","timestamp":1633405197000},"page":"17369-17387","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Sparse nonnegative tensor decomposition using proximal algorithm and inexact block coordinate descent scheme"],"prefix":"10.1007","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1333-0928","authenticated-orcid":false,"given":"Deqing","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zheng","family":"Chang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fengyu","family":"Cong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,10,4]]},"reference":[{"key":"6325_CR1","unstructured":"Allen G (2012) Sparse higher-order principal components analysis. In: Lawrence ND, Girolami M (eds) Proceedings of the Fifteenth International Conference on Artificial Intelligence and Statistics, PMLR, La Palma, Canary Islands, Proceedings of Machine Learning Research, 22: 27\u201336"},{"issue":"1","key":"6325_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000015","volume":"4","author":"F Bach","year":"2012","unstructured":"Bach F, Jenatton R, Mairal J, Obozinski G (2012) Optimization with sparsity-inducing penalties. Found Trends\u00ae Mach Learn 4(1):1\u2013106. https:\/\/doi.org\/10.1561\/2200000015","journal-title":"Found Trends\u00ae Mach Learn"},{"key":"6325_CR3","unstructured":"Bader BW, Kolda TG et al (2015) Matlab tensor toolbox version 2.6. Available online, http:\/\/www.sandia.gov\/~tgkolda\/TensorToolbox\/"},{"key":"6325_CR4","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"2016","unstructured":"Bertsekas DP (2016) Nonlinear Programming, 3rd edn. Athena Scientific, Belmont, Massachusetts","edition":"3"},{"issue":"5","key":"6325_CR5","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1002\/cem.801","volume":"17","author":"R Bro","year":"2003","unstructured":"Bro R, Kiers HAL (2003) A new efficient method for determining the number of components in PARAFAC models. J Chemom 17(5):274\u2013286. https:\/\/doi.org\/10.1002\/cem.801","journal-title":"J Chemom"},{"issue":"1","key":"6325_CR6","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1137\/060657704","volume":"51","author":"AM Bruckstein","year":"2009","unstructured":"Bruckstein AM, Donoho DL, Elad M (2009) From sparse solutions of systems of equations to sparse modeling of signals and images. SIAM Rev 51(1):34\u201381. https:\/\/doi.org\/10.1137\/060657704","journal-title":"SIAM Rev"},{"issue":"3","key":"6325_CR7","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1587\/transfun.e92.a.708","volume":"E92\u2013A","author":"A Cichocki","year":"2009","unstructured":"Cichocki A, Phan AH (2009) Fast local algorithms for large scale nonnegative matrix and tensor factorizations. IEICE Trans Fundam Electron Commun Comput Sci E92\u2013A(3):708\u2013721. https:\/\/doi.org\/10.1587\/transfun.e92.a.708","journal-title":"IEICE Trans Fundam Electron Commun Comput Sci"},{"key":"6325_CR8","unstructured":"Cichocki A, Zdunek R (2006) NMFLAB\u2014MATLAB toolbox for non-negative matrix factorization. http:\/\/www.bsp.brain.riken.jp\/ICALAB\/nmflab.html. Accessed 22 Nov 2017"},{"key":"6325_CR9","doi-asserted-by":"publisher","DOI":"10.1002\/9780470747278","volume-title":"Nonnegative matrix and tensor factorizations: applications to exploratory multi-way data analysis and blind source separation","author":"A Cichocki","year":"2009","unstructured":"Cichocki A, Zdunek R, Phan AH, Si Amari (2009) Nonnegative matrix and tensor factorizations: applications to exploratory multi-way data analysis and blind source separation. Wiley, New York"},{"issue":"2","key":"6325_CR10","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1109\/msp.2013.2297439","volume":"32","author":"A Cichocki","year":"2015","unstructured":"Cichocki A, Mandic D, Lathauwer LD, Zhou G, Zhao Q, Caiafa C, Phan HA (2015) Tensor decompositions for signal processing applications: from two-way to multiway component analysis. IEEE Signal Process Mag 32(2):145\u2013163. https:\/\/doi.org\/10.1109\/msp.2013.2297439","journal-title":"IEEE Signal Process Mag"},{"key":"6325_CR11","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.jneumeth.2015.03.018","volume":"248","author":"F Cong","year":"2015","unstructured":"Cong F, Lin QH, Kuang LD, Gong XF, Astikainen P, Ristaniemi T (2015) Tensor decomposition of EEG signals: a brief review. J Neurosci Methods 248:59\u201369. https:\/\/doi.org\/10.1016\/j.jneumeth.2015.03.018","journal-title":"J Neurosci Methods"},{"issue":"6","key":"6325_CR12","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1002\/cpa.20132","volume":"59","author":"DL Donoho","year":"2006","unstructured":"Donoho DL (2006) For most large underdetermined systems of linear equations the minimal $$\\ell _1$$-norm solution is also the sparsest solution. Commun Pure Appl Math 59(6):797\u2013829. https:\/\/doi.org\/10.1002\/cpa.20132","journal-title":"Commun Pure Appl Math"},{"key":"6325_CR13","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.chemolab.2015.01.017","volume":"142","author":"S Elcoroaristizabal","year":"2015","unstructured":"Elcoroaristizabal S, Bro R, Garc\u00eda JA, Alonso L (2015) PARAFAC models of fluorescence data with scattering: a comparative study. Chemom Intell LabD Syst 142:124\u2013130. https:\/\/doi.org\/10.1016\/j.chemolab.2015.01.017","journal-title":"Chemom Intell LabD Syst"},{"issue":"4","key":"6325_CR14","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1080\/10556780801996244","volume":"23","author":"MP Friedlander","year":"2008","unstructured":"Friedlander MP, Hatz K (2008) Computing non-negative tensor factorizations. Optim Methods Softw 23(4):631\u2013647. https:\/\/doi.org\/10.1080\/10556780801996244","journal-title":"Optim Methods Softw"},{"issue":"4","key":"6325_CR15","doi-asserted-by":"publisher","first-page":"1085","DOI":"10.1162\/NECO_a_00256","volume":"24","author":"N Gillis","year":"2012","unstructured":"Gillis N, Glineur F (2012) Accelerated multiplicative updates and hierarchical ALS algorithms for nonnegative matrix factorization. Neural Computation 24(4):1085\u20131105. https:\/\/doi.org\/10.1162\/NECO_a_00256","journal-title":"Neural Computation"},{"key":"6325_CR16","unstructured":"Globerson A, Chechik G, Pereira F, Tishby N (2007) Euclidean Embedding of Co-occurrence Data. The Journal of Machine Learning Research 8: 2265\u20132295, http:\/\/www.jmlr.org\/papers\/volume8\/globerson07a\/globerson07a.pdf"},{"issue":"1","key":"6325_CR17","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1109\/msp.2015.2481563","volume":"33","author":"M Hong","year":"2016","unstructured":"Hong M, Razaviyayn M, Luo ZQ, Pang JS (2016) A unified algorithmic framework for block-structured optimization involving big data: with applications in machine learning and signal processing. IEEE Signal Process Mag 33(1):57\u201377. https:\/\/doi.org\/10.1109\/msp.2015.2481563","journal-title":"IEEE Signal Process Mag"},{"issue":"Nov","key":"6325_CR18","first-page":"1457","volume":"5","author":"PO Hoyer","year":"2004","unstructured":"Hoyer PO (2004) Non-negative matrix factorization with sparseness constraints. J Mach Learn Res 5(Nov):1457\u20131469","journal-title":"J Mach Learn Res"},{"issue":"19","key":"6325_CR19","doi-asserted-by":"publisher","first-page":"5052","DOI":"10.1109\/tsp.2016.2576427","volume":"64","author":"K Huang","year":"2016","unstructured":"Huang K, Sidiropoulos ND, Liavas AP (2016) A flexible and efficient algorithmic framework for constrained matrix and tensor factorization. IEEE Trans Signal Process 64(19):5052\u20135065. https:\/\/doi.org\/10.1109\/tsp.2016.2576427","journal-title":"IEEE Trans Signal Process"},{"issue":"2","key":"6325_CR20","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1137\/07069239x","volume":"30","author":"H Kim","year":"2008","unstructured":"Kim H, Park H (2008) Nonnegative matrix factorization based on alternating nonnegativity constrained least squares and active set method. SIAM J Matrix Anal Appl 30(2):713\u2013730. https:\/\/doi.org\/10.1137\/07069239x","journal-title":"SIAM J Matrix Anal Appl"},{"key":"6325_CR21","doi-asserted-by":"publisher","unstructured":"Kim HJ, Ollila E, Koivunen V (2013) Sparse regularization of tensor decompositions. In: 2013 IEEE international conference on acoustics, speech and signal processing. IEEE. https:\/\/doi.org\/10.1109\/ICASSP.2013.6638376","DOI":"10.1109\/ICASSP.2013.6638376"},{"issue":"6","key":"6325_CR22","doi-asserted-by":"publisher","first-page":"3261","DOI":"10.1137\/110821172","volume":"33","author":"J Kim","year":"2011","unstructured":"Kim J, Park H (2011) Fast nonnegative matrix factorization: an active-set-like method and comparisons. SIAM J Sci Comput 33(6):3261\u20133281. https:\/\/doi.org\/10.1137\/110821172","journal-title":"SIAM J Sci Comput"},{"key":"6325_CR23","doi-asserted-by":"publisher","unstructured":"Kim J, Park H (2012) Fast nonnegative tensor factorization with an active-set-like method. In: High-performance scientific computing. Springer, London, pp 311\u2013326. https:\/\/doi.org\/10.1007\/978-1-4471-2437-5_16","DOI":"10.1007\/978-1-4471-2437-5_16"},{"issue":"2","key":"6325_CR24","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10898-013-0035-4","volume":"58","author":"J Kim","year":"2014","unstructured":"Kim J, He Y, Park H (2014) Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework. J Global Optim 58(2):285\u2013319. https:\/\/doi.org\/10.1007\/s10898-013-0035-4","journal-title":"J Global Optim"},{"issue":"3","key":"6325_CR25","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111x","volume":"51","author":"TG Kolda","year":"2009","unstructured":"Kolda TG, Bader BW (2009) Tensor decompositions and applications. SIAM Rev 51(3):455\u2013500. https:\/\/doi.org\/10.1137\/07070111x","journal-title":"SIAM Rev"},{"issue":"2","key":"6325_CR26","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1016\/j.laa.2011.12.002","volume":"438","author":"N Li","year":"2013","unstructured":"Li N, Kindermann S, Navasca C (2013) Some convergence results on the regularized alternating least-squares method for tensor decomposition. Linear Algebra Appl 438(2):796\u2013812. https:\/\/doi.org\/10.1016\/j.laa.2011.12.002","journal-title":"Linear Algebra Appl"},{"issue":"1","key":"6325_CR27","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1186\/1751-0473-8-10","volume":"8","author":"Y Li","year":"2013","unstructured":"Li Y, Ngom A (2013) The non-negative matrix factorization toolbox for biological data mining. Source Code Biol Med 8(1):10. https:\/\/doi.org\/10.1186\/1751-0473-8-10","journal-title":"Source Code Biol Med"},{"issue":"1","key":"6325_CR28","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1016\/j.patcog.2011.05.015","volume":"45","author":"J Liu","year":"2012","unstructured":"Liu J, Liu J, Wonka P, Ye J (2012) Sparse non-negative tensor factorization using columnwise coordinate descent. Pattern Recogn 45(1):649\u2013656. https:\/\/doi.org\/10.1016\/j.patcog.2011.05.015","journal-title":"Pattern Recogn"},{"issue":"11","key":"6325_CR29","doi-asserted-by":"publisher","first-page":"2437","DOI":"10.1109\/tcyb.2014.2374695","volume":"45","author":"Y Liu","year":"2015","unstructured":"Liu Y, Shang F, Jiao L, Cheng J, Cheng H (2015) Trace norm regularized CANDECOMP\/PARAFAC decomposition with missing data. IEEE Trans Cybern 45(11):2437\u20132448. https:\/\/doi.org\/10.1109\/tcyb.2014.2374695","journal-title":"IEEE Trans Cybern"},{"issue":"1","key":"6325_CR30","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1002\/widm.1","volume":"1","author":"M M\u00f8rup","year":"2011","unstructured":"M\u00f8rup M (2011) Applications of tensor (multiway array) factorizations and decompositions in data mining. Wiley Interdiscip Rev Data Mining Knowl Discov 1(1):24\u201340. https:\/\/doi.org\/10.1002\/widm.1","journal-title":"Wiley Interdiscip Rev Data Mining Knowl Discov"},{"issue":"8","key":"6325_CR31","doi-asserted-by":"publisher","first-page":"2112","DOI":"10.1162\/neco.2008.11-06-407","volume":"20","author":"M M\u00f8rup","year":"2008","unstructured":"M\u00f8rup M, Hansen LK, Arnfred SM (2008) Algorithms for sparse nonnegative tucker decompositions. Neural Comput 20(8):2112\u20132131. https:\/\/doi.org\/10.1162\/neco.2008.11-06-407","journal-title":"Neural Comput"},{"issue":"2","key":"6325_CR32","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1109\/tsp.2012.2225052","volume":"61","author":"EE Papalexakis","year":"2013","unstructured":"Papalexakis EE, Sidiropoulos ND, Bro R (2013) From $$k$$-means to higher-way co-clustering: Multilinear decomposition with sparse latent factors. IEEE Trans Signal Process 61(2):493\u2013506. https:\/\/doi.org\/10.1109\/tsp.2012.2225052","journal-title":"IEEE Trans Signal Process"},{"issue":"2","key":"6325_CR33","doi-asserted-by":"publisher","first-page":"1126","DOI":"10.1137\/120891009","volume":"23","author":"M Razaviyayn","year":"2013","unstructured":"Razaviyayn M, Hong M, Luo ZQ (2013) A unified convergence analysis of block successive minimization methods for nonsmooth optimization. SIAM J Optim 23(2):1126\u20131153. https:\/\/doi.org\/10.1137\/120891009","journal-title":"SIAM J Optim"},{"issue":"17","key":"6325_CR34","doi-asserted-by":"publisher","first-page":"4481","DOI":"10.1109\/tsp.2017.2711501","volume":"65","author":"I Selesnick","year":"2017","unstructured":"Selesnick I (2017) Sparse regularization via convex analysis. IEEE Trans Signal Process 65(17):4481\u20134494. https:\/\/doi.org\/10.1109\/tsp.2017.2711501","journal-title":"IEEE Trans Signal Process"},{"issue":"13","key":"6325_CR35","doi-asserted-by":"publisher","first-page":"3551","DOI":"10.1109\/tsp.2017.2690524","volume":"65","author":"ND Sidiropoulos","year":"2017","unstructured":"Sidiropoulos ND, Lathauwer LD, Fu X, Huang K, Papalexakis EE, Faloutsos C (2017) Tensor decomposition for signal processing and machine learning. IEEE Trans Signal Process 65(13):3551\u20133582. https:\/\/doi.org\/10.1109\/tsp.2017.2690524","journal-title":"IEEE Trans Signal Process"},{"issue":"11","key":"6325_CR36","doi-asserted-by":"publisher","first-page":"6793","DOI":"10.1109\/tgrs.2014.2303155","volume":"52","author":"J Sigurdsson","year":"2014","unstructured":"Sigurdsson J, Ulfarsson MO, Sveinsson JR (2014) Hyperspectral unmixing with $$l_q$$ regularization. IEEE Trans Geosci Remote Sens 52(11):6793\u20136806. https:\/\/doi.org\/10.1109\/tgrs.2014.2303155","journal-title":"IEEE Trans Geosci Remote Sens"},{"issue":"4","key":"6325_CR37","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1109\/msp.2004.1311138","volume":"21","author":"P Stoica","year":"2004","unstructured":"Stoica P, Selen Y (2004) Model-order selection: a review of information criterion rules. IEEE Signal Process Mag 21(4):36\u201347. https:\/\/doi.org\/10.1109\/msp.2004.1311138","journal-title":"IEEE Signal Process Mag"},{"issue":"1","key":"6325_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1348\/000711000159132","volume":"53","author":"ME Timmerman","year":"2000","unstructured":"Timmerman ME, Kiers HAL (2000) Three-mode principal components analysis: choosing the numbers of components and sensitivity to local optima. British J Math Stat Psychol 53(1):1\u201316. https:\/\/doi.org\/10.1348\/000711000159132","journal-title":"British J Math Stat Psychol"},{"issue":"5","key":"6325_CR39","doi-asserted-by":"publisher","first-page":"2577","DOI":"10.1109\/tgrs.2015.2503737","volume":"54","author":"MA Veganzones","year":"2016","unstructured":"Veganzones MA, Cohen JE, Farias RC, Chanussot J, Comon P (2016) Nonnegative tensor CP decomposition of hyperspectral data. IEEE Trans Geosci Remote Sens 54(5):2577\u20132588. https:\/\/doi.org\/10.1109\/tgrs.2015.2503737","journal-title":"IEEE Trans Geosci Remote Sens"},{"key":"6325_CR40","doi-asserted-by":"publisher","unstructured":"Vervliet N, Lathauwer LD (2019) Numerical optimization-based algorithms for data fusion. In: Data handling in science and technology. Elsevier, pp 81\u2013128. https:\/\/doi.org\/10.1016\/B978-0-444-63984-4.00004-1","DOI":"10.1016\/B978-0-444-63984-4.00004-1"},{"key":"6325_CR41","doi-asserted-by":"publisher","unstructured":"Viswanath B, Mislove A, Cha M, Gummadi KP (2009) On the evolution of user interaction in facebook. In: Proceedings of the 2nd ACM workshop on Online social networks\u2014WOSN \u201909. ACM Press. https:\/\/doi.org\/10.1145\/1592665.1592675","DOI":"10.1145\/1592665.1592675"},{"issue":"9","key":"6325_CR42","doi-asserted-by":"publisher","first-page":"1893","DOI":"10.1007\/s11431-020-1840-4","volume":"64","author":"D Wang","year":"2021","unstructured":"Wang D, Cong F (2021) An inexact alternating proximal gradient algorithm for nonnegative CP tensor decomposition. Sci China Technol Sci 64(9):1893\u20131906. https:\/\/doi.org\/10.1007\/s11431-020-1840-4","journal-title":"Sci China Technol Sci"},{"key":"6325_CR43","doi-asserted-by":"publisher","unstructured":"Wang D, Cong F, Zhao Q, Toiviainen P, Nandi AK, Huotilainen M, Ristaniemi T, Cichocki A (2016) Exploiting ongoing EEG with multilinear partial least squares during free-listening to music. In: IEEE 26th international workshop on machine learning for signal processing (MLSP). IEEE. https:\/\/doi.org\/10.1109\/mlsp.2016.7738849","DOI":"10.1109\/mlsp.2016.7738849"},{"key":"6325_CR44","doi-asserted-by":"publisher","unstructured":"Wang D, Wang X, Zhu Y, Toiviainen P, Huotilainen M, Ristaniemi T, Cong F (2018) Increasing stability of EEG components extraction using sparsity regularized tensor decomposition. In: Advances in neural networks \u2013 ISNN 2018. Springer, pp 789\u2013799. https:\/\/doi.org\/10.1007\/978-3-319-92537-0_89","DOI":"10.1007\/978-3-319-92537-0_89"},{"key":"6325_CR45","doi-asserted-by":"publisher","unstructured":"Wang D, Cong F, Ristaniemi T (2019) Higher-order nonnegative CANDECOMP\/PARAFAC tensor decomposition using proximal algorithm. In: 2019 IEEE international conference on acoustics, speech and signal processing (ICASSP). IEEE, pp 3457\u20133461. https:\/\/doi.org\/10.1109\/ICASSP.2019.8683217","DOI":"10.1109\/ICASSP.2019.8683217"},{"issue":"6","key":"6325_CR46","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1016\/j.neuron.2018.05.015","volume":"98","author":"AH Williams","year":"2018","unstructured":"Williams AH, Kim TH, Wang F, Vyas S, Ryu SI, Shenoy KV, Schnitzer M, Kolda TG, Ganguli S (2018) Unsupervised discovery of demixed, low-dimensional neural dynamics across multiple timescales through tensor component analysis. Neuron 98(6):1099-1115.e8. https:\/\/doi.org\/10.1016\/j.neuron.2018.05.015","journal-title":"Neuron"},{"issue":"1","key":"6325_CR47","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s12532-014-0074-y","volume":"7","author":"Y Xu","year":"2015","unstructured":"Xu Y (2015) Alternating proximal gradient method for sparse nonnegative tucker decomposition. Math Program Comput 7(1):39\u201370. https:\/\/doi.org\/10.1007\/s12532-014-0074-y","journal-title":"Math Program Comput"},{"issue":"3","key":"6325_CR48","doi-asserted-by":"publisher","first-page":"1758","DOI":"10.1137\/120887795","volume":"6","author":"Y Xu","year":"2013","unstructured":"Xu Y, Yin W (2013) A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion. SIAM J Imag Sci 6(3):1758\u20131789. https:\/\/doi.org\/10.1137\/120887795","journal-title":"SIAM J Imag Sci"},{"key":"6325_CR49","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1109\/tsp.2019.2959240","volume":"68","author":"Y Yang","year":"2020","unstructured":"Yang Y, Pesavento M, Luo ZQ, Ottersten B (2020) Inexact block coordinate descent algorithms for nonsmooth nonconvex optimization. IEEE Trans Signal Process 68:947\u2013961. https:\/\/doi.org\/10.1109\/tsp.2019.2959240","journal-title":"IEEE Trans Signal Process"},{"issue":"11","key":"6325_CR50","doi-asserted-by":"publisher","first-page":"5304","DOI":"10.1109\/tnnls.2018.2797060","volume":"29","author":"H Zhang","year":"2018","unstructured":"Zhang H, Wang S, Xu X, Chow TWS, Wu QMJ (2018) Tree2vector: learning a vectorial representation for tree-structured data. IEEE Trans Neural Networks Learn Syst 29(11):5304\u20135318. https:\/\/doi.org\/10.1109\/tnnls.2018.2797060","journal-title":"IEEE Trans Neural Networks Learn Syst"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-021-06325-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-021-06325-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-021-06325-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,5]],"date-time":"2021-11-05T16:23:57Z","timestamp":1636129437000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-021-06325-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,4]]},"references-count":50,"journal-issue":{"issue":"24","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["6325"],"URL":"https:\/\/doi.org\/10.1007\/s00521-021-06325-8","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10,4]]},"assertion":[{"value":"14 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 July 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 October 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}