{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T19:26:23Z","timestamp":1775935583147,"version":"3.50.1"},"reference-count":55,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"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 J. Sel. Top. Signal Process."],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1109\/jstsp.2021.3051488","type":"journal-article","created":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T08:38:49Z","timestamp":1612859929000},"page":"464-475","source":"Crossref","is-referenced-by-count":33,"title":["Block-Term Tensor Decomposition: Model Selection and Computation"],"prefix":"10.1109","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6161-4055","authenticated-orcid":false,"given":"Athanasios A.","family":"Rontogiannis","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5887-9404","authenticated-orcid":false,"given":"Eleftherios","family":"Kofidis","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2039-0758","authenticated-orcid":false,"given":"Paris V.","family":"Giampouras","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93764-9_1"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2734888"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2017.04.001"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93764-9_14"},{"key":"ref31","article-title":"Non-iterative low-multilinear-rank tensor approximation with application to decomposition in rank-${(1,L,L)}$ terms","author":"de m goulart","year":"2017"},{"key":"ref30","article-title":"Variants of ALS on tensor decompositions and applications","author":"li","year":"2013"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2620965"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974348.80"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/CAMSAP.2017.8313206"},{"key":"ref34","article-title":"Block-term tensor decomposition via constrained matrix factorization","author":"fu","year":"2019","journal-title":"Proc Mach Learn Signal Process"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/120868323"},{"key":"ref27","article-title":"Algebraic and optimization-based algorithms for decomposing tensors into block terms","author":"vervliet","year":"2020","journal-title":"Proc 21st Householder Symp Numer Linear Algebra"},{"key":"ref29","author":"vervliet","year":"2016","journal-title":"Tensorlab user guide - Release 3 0"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2690524"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/070690729"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2020.05.034"},{"key":"ref22","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-28551-6_1","article-title":"Block component analysis: A new concept for blind source separation","author":"lathauwer","year":"2012","journal-title":"Proc Latent Variable Anal Signal Separation"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/100805510"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2018.09.031"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/070690730"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/18M1206849"},{"key":"ref25","article-title":"From computation to comparison of tensor decompositions","author":"domanov","year":"2019"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20303"},{"key":"ref51","article-title":"Block-term tensor decomposition: Model selection and computation","author":"rontogiannis","year":"2020","journal-title":"Proc Eur Signal Process Conf"},{"key":"ref55","first-page":"160","article-title":"Hadamard, Khatri-Rao, Kronecker and other matrix products","volume":"4","author":"liu","year":"2008","journal-title":"Int J Inf Syst Sci"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2015.2481563"},{"key":"ref53","article-title":"A projected Newton-type algorithm for non-negative matrix factorization with model order selection","author":"giampouras","year":"2019","journal-title":"Proc IEEE Int Conf Acoust Speech Signal Process"},{"key":"ref52","first-page":"960","article-title":"Group sparse optimization via $\\ell _{p,q}$ regularization","volume":"18","author":"hu","year":"2017","journal-title":"J Mach Learn Res"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.14209\/jcis.2019.12"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"144","DOI":"10.3934\/mbe.2020008","article-title":"Noninvasive fetal ECG extraction using doubly constrained block-term decomposition","volume":"17","author":"mousavian","year":"2019","journal-title":"Math Biosci Eng"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2008.918089"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2016.2633279"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"10 410","DOI":"10.1109\/TGRS.2019.2935150","article-title":"Hyperspectral restoration via ${L}_0$ gradient regularized low-rank tensor factorization","volume":"57","author":"xiong","year":"2019","journal-title":"IEEE Trans Geosci Remote Sens"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CAMSAP45676.2019.9022476"},{"key":"ref15","article-title":"Unsupervised clustering for hyperspectral images","volume":"12","author":"bianca","year":"2020","journal-title":"Symmetry"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380129"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2993530"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ultramic.2016.12.025"},{"key":"ref19","article-title":"A tensorized transformer for language modeling","author":"ma","year":"2019","journal-title":"Proc NeurIPS-2019"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2706183"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2007.910469"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jneumeth.2018.12.007"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1186\/1687-6180-2014-139"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/EMBC.2019.8856772"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JBHI.2018.2829877"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2883921"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CAMSAP.2017.8313173"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2985591"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2018.2852490"},{"key":"ref48","article-title":"$\\ell _1\/\\ell _2$ regularized non-convex low-rank matrix factorization","author":"giampouras","year":"2017","journal-title":"Proc Signal Process Adaptive Sparse Struct Representations"},{"key":"ref47","article-title":"Online low-rank subspace learning from incomplete data using rank revealing $\\ell _2\/\\ell _1$ regularization","author":"giampouras","year":"2016","journal-title":"Proc Stat Signal Process Workshop"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2013.6638254"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2013.6638839"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2016.7869682"},{"key":"ref43","article-title":"Robust low-rank tensor approximations using group sparsity","author":"han","year":"2019"}],"container-title":["IEEE Journal of Selected Topics in Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4200690\/9393360\/09321500.pdf?arnumber=9321500","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:52:44Z","timestamp":1652194364000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9321500\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4]]},"references-count":55,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/jstsp.2021.3051488","relation":{},"ISSN":["1932-4553","1941-0484"],"issn-type":[{"value":"1932-4553","type":"print"},{"value":"1941-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4]]}}}