{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T16:03:07Z","timestamp":1781884987444,"version":"3.54.5"},"reference-count":240,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2019,1,9]],"date-time":"2019-01-09T00:00:00Z","timestamp":1546992000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1657196"],"award-info":[{"award-number":["IIS-1657196"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["W911NF-16-1-0565"],"award-info":[{"award-number":["W911NF-16-1-0565"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2019,2,28]]},"abstract":"<jats:p>Tensor completion is a problem of filling the missing or unobserved entries of partially observed tensors. Due to the multidimensional character of tensors in describing complex datasets, tensor completion algorithms and their applications have received wide attention and achievement in areas like data mining, computer vision, signal processing, and neuroscience. In this survey, we provide a modern overview of recent advances in tensor completion algorithms from the perspective of big data analytics characterized by diverse variety, large volume, and high velocity. We characterize these advances from the following four perspectives: general tensor completion algorithms, tensor completion with auxiliary information (variety), scalable tensor completion algorithms (volume), and dynamic tensor completion algorithms (velocity). Further, we identify several tensor completion applications on real-world data-driven problems and present some common experimental frameworks popularized in the literature along with several available software repositories. Our goal is to summarize these popular methods and introduce them to researchers and practitioners for promoting future research and applications. We conclude with a discussion of key challenges and promising research directions in this community for future exploration.<\/jats:p>","DOI":"10.1145\/3278607","type":"journal-article","created":{"date-parts":[[2019,1,9]],"date-time":"2019-01-09T18:36:36Z","timestamp":1547058996000},"page":"1-48","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":165,"title":["Tensor Completion Algorithms in Big Data Analytics"],"prefix":"10.1145","volume":"13","author":[{"given":"Qingquan","family":"Song","sequence":"first","affiliation":[{"name":"Texas A8M University, College Station, TX"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hancheng","family":"Ge","sequence":"additional","affiliation":[{"name":"Texas A8M University, College Station, TX"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"James","family":"Caverlee","sequence":"additional","affiliation":[{"name":"Texas A8M University, College Station, TX"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xia","family":"Hu","sequence":"additional","affiliation":[{"name":"Texas A8M University, College Station, TX"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,1,9]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2009.54"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.chemolab.2010.08.004"},{"key":"e_1_2_1_3_1","volume-title":"Dunlavy","author":"Acar Evrim","year":"2011","unstructured":"Evrim Acar , Tamara G. Kolda , and Daniel M . Dunlavy . 2011 . All-at-once optimization for coupled matrix and tensor factorizations. arXiv:1105.3422. Evrim Acar, Tamara G. Kolda, and Daniel M. Dunlavy. 2011. All-at-once optimization for coupled matrix and tensor factorizations. arXiv:1105.3422."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2008.112"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7439(98)00010-0"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7439(00)00071-X"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1021\/ac00236a025"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/3122009.3153019"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1186785.1186794"},{"key":"e_1_2_1_10_1","unstructured":"Brett W. Bader Tamara G. Kolda etal 2012. Matlab tensor toolbox version 2.5. (January 2012). Retrieved from https:\/\/www.tensortoolbox.org\/.  Brett W. Bader Tamara G. Kolda et al. 2012. Matlab tensor toolbox version 2.5. (January 2012). Retrieved from https:\/\/www.tensortoolbox.org\/."},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of the 27th International Conference on Neural Information Processing Systems (NIPS\u201914)","author":"Bahadori Mohammad Taha","year":"2014","unstructured":"Mohammad Taha Bahadori , Qi Rose Yu , and Yan Liu . 2014 . Fast multivariate spatio-temporal analysis via low rank tensor learning . In Proceedings of the 27th International Conference on Neural Information Processing Systems (NIPS\u201914) . Mohammad Taha Bahadori, Qi Rose Yu, and Yan Liu. 2014. Fast multivariate spatio-temporal analysis via low rank tensor learning. In Proceedings of the 27th International Conference on Neural Information Processing Systems (NIPS\u201914)."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972771.14"},{"key":"e_1_2_1_13_1","unstructured":"Boaz Barak and Ankur Moitra. 2015. Tensor prediction rademacher complexity and random 3-xor. CoRR abs\/1501.06521.  Boaz Barak and Ankur Moitra. 2015. Tensor prediction rademacher complexity and random 3-xor. CoRR abs\/1501.06521."},{"key":"e_1_2_1_14_1","volume-title":"Proceedings of Conference on Learning Theory.","author":"Barak Boaz","year":"2016","unstructured":"Boaz Barak and Ankur Moitra . 2016 . Noisy tensor completion via the sum-of-squares hierarchy . In Proceedings of Conference on Learning Theory. Boaz Barak and Ankur Moitra. 2016. Noisy tensor completion via the sum-of-squares hierarchy. In Proceedings of Conference on Learning Theory."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2278516"},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of International Conference on Data Mining (ICDM\u201914)","author":"Beutel Alex","unstructured":"Alex Beutel , Partha Pratim Talukdar , Abhimanu Kumar , Christos Faloutsos , Evangelos E. Papalexakis , and Eric P. Xing . 2014. Flexifact: Scalable flexible factorization of coupled tensors on hadoop . In Proceedings of International Conference on Data Mining (ICDM\u201914) . Alex Beutel, Partha Pratim Talukdar, Abhimanu Kumar, Christos Faloutsos, Evangelos E. Papalexakis, and Eric P. Xing. 2014. Flexifact: Scalable flexible factorization of coupled tensors on hadoop. In Proceedings of International Conference on Data Mining (ICDM\u201914)."},{"key":"e_1_2_1_17_1","volume-title":"Challenge Involves More Than Just Managing Volumes of Data. Gartner. Archived from the Original on","author":"Beyer Mark","year":"2011","unstructured":"Mark Beyer . 2011. Gartner Says Solving \u2018Big data \u2019 Challenge Involves More Than Just Managing Volumes of Data. Gartner. Archived from the Original on ( 2011 ). Mark Beyer. 2011. Gartner Says Solving \u2018Big data\u2019 Challenge Involves More Than Just Managing Volumes of Data. Gartner. Archived from the Original on (2011)."},{"key":"e_1_2_1_18_1","unstructured":"Srinadh Bhojanapalli and Sujay Sanghavi. 2015. A new sampling technique for tensors. arXiv:1502.05023.  Srinadh Bhojanapalli and Sujay Sanghavi. 2015. A new sampling technique for tensors. arXiv:1502.05023."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7439(97)00032-4"},{"key":"e_1_2_1_20_1","volume-title":"Proc. ICSLP 2000 MRI, EPG and EMA.","author":"Bro Rasmus","year":"1998","unstructured":"Rasmus Bro . 1998 . Multi-way analysis in the food industry: Models, algorithms, and applications . In Proc. ICSLP 2000 MRI, EPG and EMA. Rasmus Bro. 1998. Multi-way analysis in the food industry: Models, algorithms, and applications. In Proc. ICSLP 2000 MRI, EPG and EMA."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.231"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"e_1_2_1_23_1","volume-title":"Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing.","author":"Cesar","unstructured":"Cesar F. Caiafa and Andrzej Cichocki. 2012. Block sparse representations of tensors using Kronecker bases . In Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing. Cesar F. Caiafa and Andrzej Cichocki. 2012. Block sparse representations of tensors using Kronecker bases. In Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00385"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2385040"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2184319.2184343"},{"key":"e_1_2_1_27_1","volume-title":"Robust principal component analysis?Journal of the ACM 58, 3","author":"Cand\u00e8s Emmanuel J.","year":"2011","unstructured":"Emmanuel J. Cand\u00e8s , Xiaodong Li , Yi Ma , and John Wright . 2011. Robust principal component analysis?Journal of the ACM 58, 3 ( 2011 ), Article 11. Emmanuel J. Cand\u00e8s, Xiaodong Li, Yi Ma, and John Wright. 2011. Robust principal component analysis?Journal of the ACM 58, 3 (2011), Article 11."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02310791"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02293596"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.2307\/2348687"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.164"},{"key":"e_1_2_1_34_1","unstructured":"Hao Cheng Yaoliang Yu Xinhua Zhang Eric Xing and Dale Schuurmans. 2016. Scalable and sound low-rank tensor learning. In Artificial Intelligence and Statistics.  Hao Cheng Yaoliang Yu Xinhua Zhang Eric Xing and Dale Schuurmans. 2016. Scalable and sound low-rank tensor learning. In Artificial Intelligence and Statistics."},{"key":"e_1_2_1_35_1","volume-title":"Proceedings of NIPS.","author":"Choi Joon Hee","unstructured":"Joon Hee Choi and S. Vishwanathan . 2014. DFacTo: Distributed factorization of tensors . In Proceedings of NIPS. Joon Hee Choi and S. Vishwanathan. 2014. DFacTo: Distributed factorization of tensors. In Proceedings of NIPS."},{"key":"e_1_2_1_36_1","volume-title":"Proceedings of AISTATS.","author":"Chu Wei","year":"2009","unstructured":"Wei Chu and Zoubin Ghahramani . 2009 . Probabilistic models for incomplete multi-dimensional arrays . In Proceedings of AISTATS. Wei Chu and Zoubin Ghahramani. 2009. Probabilistic models for incomplete multi-dimensional arrays. In Proceedings of AISTATS."},{"key":"e_1_2_1_37_1","volume-title":"Anh Huy Phan, and Shun-ichi Amari","author":"Cichocki Andrzej","year":"2009","unstructured":"Andrzej Cichocki , Rafal Zdunek , Anh Huy Phan, and Shun-ichi Amari . 2009 . Nonnegative Matrix and Tensor Factorizations: Applications to Exploratory Multi-Way Data Analysis and Blind Source Separation. John Wiley and Sons . Andrzej Cichocki, Rafal Zdunek, Anh Huy Phan, and Shun-ichi Amari. 2009. Nonnegative Matrix and Tensor Factorizations: Applications to Exploratory Multi-Way Data Analysis and Blind Source Separation. John Wiley and Sons."},{"key":"e_1_2_1_38_1","volume-title":"Proceedings of Workshop on Tensor Decompositions","author":"Comon Pierre","year":"2004","unstructured":"Pierre Comon . 2004 . Canonical tensor decompositions . In Proceedings of Workshop on Tensor Decompositions , Palo Alto, CA. Pierre Comon. 2004. Canonical tensor decompositions. In Proceedings of Workshop on Tensor Decompositions, Palo Alto, CA."},{"key":"e_1_2_1_39_1","volume-title":"Proceedings of International Conference on Sampling Theory and Applications.","author":"Silva Curt Da","unstructured":"Curt Da Silva and Felix J. Herrmann . 2013. Hierarchical tucker tensor optimization-applications to tensor completion . In Proceedings of International Conference on Sampling Theory and Applications. Curt Da Silva and Felix J. Herrmann. 2013. Hierarchical tucker tensor optimization-applications to tensor completion. In Proceedings of International Conference on Sampling Theory and Applications."},{"key":"e_1_2_1_40_1","volume-title":"Herrmann","author":"Da Curt","year":"2015","unstructured":"Curt Da and Felix J . Herrmann . 2015 . Optimization on the hierarchical tucker manifold--applications to tensor completion. Linear Algebra and its Applications 481 (2015), 131--173. Curt Da and Felix J. Herrmann. 2015. Optimization on the hierarchical tucker manifold--applications to tensor completion. Linear Algebra and its Applications 481 (2015), 131--173."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICICS.2011.6174300"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479896305696"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479898346995"},{"key":"e_1_2_1_44_1","volume-title":"Dhillon and Suvrit Sra","author":"Inderjit","year":"2005","unstructured":"Inderjit S. Dhillon and Suvrit Sra . 2005 . Generalized nonnegative matrix approximations with Bregman divergences. In Proceedings of NIPS. Inderjit S. Dhillon and Suvrit Sra. 2005. Generalized nonnegative matrix approximations with Bregman divergences. In Proceedings of NIPS."},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2011.2165289"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1921632.1921636"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.5555\/3113611.3113965"},{"key":"e_1_2_1_49_1","volume-title":"Eldar and Gitta Kutyniok","author":"Yonina","year":"2012","unstructured":"Yonina C. Eldar and Gitta Kutyniok . 2012 . Compressed Sensing : Theory and Applications. Cambridge University Press . Yonina C. Eldar and Gitta Kutyniok. 2012. Compressed Sensing: Theory and Applications. Cambridge University Press."},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2012.04.002"},{"key":"e_1_2_1_51_1","unstructured":"Beyza Ermi\u015f Evrim Acar and A. Taylan Cemgil. 2012. Link prediction via generalized coupled tensor factorisation. arXiv:1208.6231.  Beyza Ermi\u015f Evrim Acar and A. Taylan Cemgil. 2012. Link prediction via generalized coupled tensor factorisation. arXiv:1208.6231."},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-013-0341-y"},{"key":"e_1_2_1_53_1","first-page":"1103","article-title":"Recent developments in CANDECOMP\/PARAFAC algorithms: A critical review","volume":"79","author":"Faber Nicolaas Klaas M.","year":"2003","unstructured":"Nicolaas Klaas M. Faber , Rasmus Bro , and Philip K. Hopke . 2003 . Recent developments in CANDECOMP\/PARAFAC algorithms: A critical review . Chemometrics and Intelligent Laboratory Systems 79 , 11 (2003), 1103 -- 1108 . Nicolaas Klaas M. Faber, Rasmus Bro, and Philip K. Hopke. 2003. Recent developments in CANDECOMP\/PARAFAC algorithms: A critical review. Chemometrics and Intelligent Laboratory Systems 79, 11 (2003), 1103--1108.","journal-title":"Chemometrics and Intelligent Laboratory Systems"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2015.07.013"},{"key":"e_1_2_1_55_1","volume-title":"Proceedings of NIPS.","author":"Feng Jiashi","year":"2013","unstructured":"Jiashi Feng , Huan Xu , and Shuicheng Yan . 2013 . Online robust PCA via stochastic optimization . In Proceedings of NIPS. Jiashi Feng, Huan Xu, and Shuicheng Yan. 2013. Online robust PCA via stochastic optimization. In Proceedings of NIPS."},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11045-013-0269-9"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0952523804213335"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2014.2348796"},{"key":"e_1_2_1_59_1","volume-title":"Tensor completion and low-n-rank tensor recovery via convex optimization. Inverse Problems 27, 2","author":"Gandy Silvia","year":"2011","unstructured":"Silvia Gandy , Benjamin Recht , and Isao Yamada . 2011. Tensor completion and low-n-rank tensor recovery via convex optimization. Inverse Problems 27, 2 ( 2011 ), Article 025010. Silvia Gandy, Benjamin Recht, and Isao Yamada. 2011. Tensor completion and low-n-rank tensor recovery via convex optimization. Inverse Problems 27, 2 (2011), Article 025010."},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/2959100.2959151"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983782"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00022"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020426"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2009.4959721"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2010.2097588"},{"key":"e_1_2_1_66_1","unstructured":"Navid Ghadermarzy Yaniv Plan and \u00d6zg\u00fcr Y\u0131lmaz. 2017. Near-optimal sample complexity for convex tensor completion. arXiv:1711.04965.  Navid Ghadermarzy Yaniv Plan and \u00d6zg\u00fcr Y\u0131lmaz. 2017. Near-optimal sample complexity for convex tensor completion. arXiv:1711.04965."},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1137\/130905010"},{"key":"e_1_2_1_68_1","doi-asserted-by":"crossref","unstructured":"Lars Grasedyck Melanie Kluge and Sebastian Kr\u00e4mer. 2015. Alternating least squares tensor completion in the TT-format. arXiv:1509.00311.  Lars Grasedyck Melanie Kluge and Sebastian Kr\u00e4mer. 2015. Alternating least squares tensor completion in the TT-format. arXiv:1509.00311.","DOI":"10.1137\/130942401"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1002\/gamm.201310004"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2104999"},{"key":"e_1_2_1_71_1","volume-title":"Proceedings of AAAI.","author":"Guo Xiawei","year":"2017","unstructured":"Xiawei Guo , Quanming Yao , and James Tin-Yau Kwok . 2017 . Efficient sparse low-rank tensor completion using the frank-wolfe algorithm . In Proceedings of AAAI. Xiawei Guo, Quanming Yao, and James Tin-Yau Kwok. 2017. Efficient sparse low-rank tensor completion using the frank-wolfe algorithm. In Proceedings of AAAI."},{"key":"e_1_2_1_72_1","volume-title":"Tensor Spaces and Numerical Tensor Calculus","author":"Hackbusch Wolfgang","unstructured":"Wolfgang Hackbusch . 2012. Tensor Spaces and Numerical Tensor Calculus . Springer Science 8 Business Media. Wolfgang Hackbusch. 2012. Tensor Spaces and Numerical Tensor Calculus. Springer Science 8 Business Media."},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0778-9"},{"key":"e_1_2_1_74_1","volume-title":"Multi-Modal Factor Analysis","author":"Harshman Richard A.","unstructured":"Richard A. Harshman . 1970. Foundations of the PARAFAC Procedure: Models and Conditions for an \u201cExplanatory \u201d Multi-Modal Factor Analysis . University of California at Los Angeles , Los Angeles, CA . Richard A. Harshman. 1970. Foundations of the PARAFAC Procedure: Models and Conditions for an \u201cExplanatory\u201d Multi-Modal Factor Analysis. University of California at Los Angeles, Los Angeles, CA."},{"key":"e_1_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(90)90014-6"},{"key":"e_1_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1016\/0169-7439(93)E0086-J"},{"key":"e_1_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00222-010-0256-9"},{"key":"e_1_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1002\/sapm19287139"},{"key":"e_1_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1002\/sapm192761164"},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jbi.2014.07.001"},{"key":"e_1_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-010-0399-6"},{"key":"e_1_2_1_82_1","unstructured":"Bo Huang Cun Mu Donald Goldfarb and John Wright. 2014. Provable low-rank tensor recovery. Optimization-Online.  Bo Huang Cun Mu Donald Goldfarb and John Wright. 2014. Provable low-rank tensor recovery. Optimization-Online."},{"key":"e_1_2_1_83_1","unstructured":"Furong Huang U. N. Niranjan M. Hakeem and Animashree Anandkumar. 2013. Fast detection of overlapping communities via online tensor methods. arXiv:1309.0787.  Furong Huang U. N. Niranjan M. Hakeem and Animashree Anandkumar. 2013. Fast detection of overlapping communities via online tensor methods. arXiv:1309.0787."},{"key":"e_1_2_1_84_1","volume-title":"Proceedings of NIPS.","author":"Imaizumi Masaaki","year":"2017","unstructured":"Masaaki Imaizumi , Takanori Maehara , and Kohei Hayashi . 2017 . On tensor train rank minimization: Statistical efficiency and scalable algorithm . In Proceedings of NIPS. Masaaki Imaizumi, Takanori Maehara, and Kohei Hayashi. 2017. On tensor train rank minimization: Statistical efficiency and scalable algorithm. In Proceedings of NIPS."},{"key":"e_1_2_1_85_1","volume-title":"Proceedings of NIPS.","author":"Jain Prateek","year":"2014","unstructured":"Prateek Jain and Sewoong Oh . 2014 . Provable tensor factorization with missing data . In Proceedings of NIPS. Prateek Jain and Sewoong Oh. 2014. Provable tensor factorization with missing data. In Proceedings of NIPS."},{"key":"e_1_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006910"},{"key":"e_1_2_1_87_1","doi-asserted-by":"publisher","DOI":"10.1049\/ic.2015.0105"},{"key":"e_1_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113355"},{"key":"e_1_2_1_89_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.07.049"},{"key":"e_1_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1090\/psapm\/040\/1059486"},{"key":"e_1_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339583"},{"key":"e_1_2_1_92_1","doi-asserted-by":"publisher","DOI":"10.1145\/1864708.1864727"},{"key":"e_1_2_1_93_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2015.10.002"},{"key":"e_1_2_1_94_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2016.7472131"},{"key":"e_1_2_1_95_1","volume-title":"Proceedings of the NeurIPS Workshop on Optimization for Machine Learning (OPT'15)","author":"Kasai Hiroyuki","year":"2015","unstructured":"Hiroyuki Kasai and Bamdev Mishra . 2015 . Riemannian preconditioning for tensor completion . In Proceedings of the NeurIPS Workshop on Optimization for Machine Learning (OPT'15) . Hiroyuki Kasai and Bamdev Mishra. 2015. Riemannian preconditioning for tensor completion. In Proceedings of the NeurIPS Workshop on Optimization for Machine Learning (OPT'15)."},{"key":"e_1_2_1_96_1","volume-title":"Proceedings of the International Conference on Machine Learning. 1012--1021","author":"Kasai Hiroyuki","year":"2016","unstructured":"Hiroyuki Kasai and Bamdev Mishra . 2016 . Low-rank tensor completion: A Riemannian manifold preconditioning approach . In Proceedings of the International Conference on Machine Learning. 1012--1021 . Hiroyuki Kasai and Bamdev Mishra. 2016. Low-rank tensor completion: A Riemannian manifold preconditioning approach. In Proceedings of the International Conference on Machine Learning. 1012--1021."},{"key":"e_1_2_1_97_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972795.94"},{"key":"e_1_2_1_99_1","volume-title":"Khan and Muhammad Ammad-ud-din","author":"Suleiman","year":"2016","unstructured":"Suleiman A. Khan and Muhammad Ammad-ud-din . 2016 . tensorBF: An R package for Bayesian tensor factorization. bioRxiv. Suleiman A. Khan and Muhammad Ammad-ud-din. 2016. tensorBF: An R package for Bayesian tensor factorization. bioRxiv."},{"key":"e_1_2_1_100_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02295279"},{"key":"e_1_2_1_101_1","doi-asserted-by":"publisher","DOI":"10.1002\/1099-128X(200005\/06)14:3<105::AID-CEM582>3.0.CO;2-I"},{"key":"e_1_2_1_102_1","doi-asserted-by":"publisher","DOI":"10.1037\/1082-989X.6.1.84"},{"key":"e_1_2_1_103_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1099-128X(199905\/08)13:3\/4<275::AID-CEM543>3.0.CO;2-B"},{"key":"e_1_2_1_104_1","doi-asserted-by":"publisher","DOI":"10.1137\/110837711"},{"key":"e_1_2_1_105_1","volume-title":"Mathematical Thought From Ancient to Modern Times","author":"Kline Morris","unstructured":"Morris Kline . 1990. Mathematical Thought From Ancient to Modern Times : Volume 3 . OUP. Morris Kline. 1990. Mathematical Thought From Ancient to Modern Times: Volume 3. OUP."},{"key":"e_1_2_1_106_1","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"e_1_2_1_107_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.89"},{"key":"e_1_2_1_108_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401944"},{"key":"e_1_2_1_109_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"e_1_2_1_110_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10543-013-0455-z"},{"key":"e_1_2_1_111_1","volume-title":"Proceedings of NIPS.","author":"Krishnamurthy Akshay","year":"2013","unstructured":"Akshay Krishnamurthy and Aarti Singh . 2013 . Low-rank matrix and tensor completion via adaptive sampling . In Proceedings of NIPS. Akshay Krishnamurthy and Aarti Singh. 2013. Low-rank matrix and tensor completion via adaptive sampling. In Proceedings of NIPS."},{"key":"e_1_2_1_112_1","volume-title":"Three-Mode Principal Component Analysis: Theory and Applications","author":"Kroonenberg Pieter M.","unstructured":"Pieter M. Kroonenberg . 1983. Three-Mode Principal Component Analysis: Theory and Applications . DSWO Press . Pieter M. Kroonenberg. 1983. Three-Mode Principal Component Analysis: Theory and Applications. DSWO Press."},{"key":"e_1_2_1_113_1","volume-title":"Applied Multiway Data Analysis","author":"Kroonenberg Pieter M.","unstructured":"Pieter M. Kroonenberg . 2008. Applied Multiway Data Analysis , Vol. 702 . John Wiley and Sons . Pieter M. Kroonenberg. 2008. Applied Multiway Data Analysis, Vol. 702. John Wiley and Sons."},{"key":"e_1_2_1_114_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02293599"},{"key":"e_1_2_1_115_1","volume-title":"Three-way arrays: Rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics. Linear Algebra and its Applications 18, 2","author":"Kruskal Joseph B.","year":"1977","unstructured":"Joseph B. Kruskal . 1977. Three-way arrays: Rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics. Linear Algebra and its Applications 18, 2 ( 1977 ), 95--138. Joseph B. Kruskal. 1977. Three-way arrays: Rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics. Linear Algebra and its Applications 18, 2 (1977), 95--138."},{"key":"e_1_2_1_116_1","volume-title":"decomposition, and uniqueness for 3-way and n-way arrays","author":"Kruskal Joseph B.","unstructured":"Joseph B. Kruskal . 1989. Rank , decomposition, and uniqueness for 3-way and n-way arrays . In Multiway Data Analysis. R. Coppi and S. Bolasco (Eds.). North-Holland Publishing Co. Joseph B. Kruskal. 1989. Rank, decomposition, and uniqueness for 3-way and n-way arrays. In Multiway Data Analysis. R. Coppi and S. Bolasco (Eds.). North-Holland Publishing Co."},{"key":"e_1_2_1_117_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872518.2889371"},{"key":"e_1_2_1_118_1","volume-title":"Encyclopedia of Optimization","author":"Laurent Monique","unstructured":"Monique Laurent . 2009. Matrix completion problems . In Encyclopedia of Optimization . Springer . Monique Laurent. 2009. Matrix completion problems. In Encyclopedia of Optimization. Springer."},{"key":"e_1_2_1_119_1","volume-title":"Introduction to Smooth Manifolds","author":"Lee John","unstructured":"John Lee . 2012. Introduction to Smooth Manifolds . Springer Science and Business Media . John Lee. 2012. Introduction to Smooth Manifolds. Springer Science and Business Media."},{"key":"e_1_2_1_120_1","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v034.i10"},{"key":"e_1_2_1_121_1","unstructured":"James Li Jacob Bien Martin Wells and Maintainer James Li. 2015. Tools for Tensor Analysis and Decomposition. Package \u2018rTensor\u2019 .  James Li Jacob Bien Martin Wells and Maintainer James Li. 2015. Tools for Tensor Analysis and Decomposition. Package \u2018rTensor\u2019 ."},{"key":"e_1_2_1_122_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2017.80"},{"key":"e_1_2_1_123_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICME.2013.6607560"},{"key":"e_1_2_1_124_1","volume-title":"Proceedings of IJCAI.","author":"Li Wu-Jun","year":"2009","unstructured":"Wu-Jun Li and Dit Yan Yeung . 2009 . Relation regularized matrix factorization . In Proceedings of IJCAI. Wu-Jun Li and Dit Yan Yeung. 2009. Relation regularized matrix factorization. In Proceedings of IJCAI."},{"key":"e_1_2_1_125_1","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2016.16"},{"key":"e_1_2_1_126_1","doi-asserted-by":"publisher","DOI":"10.5555\/1927006.1927068"},{"key":"e_1_2_1_127_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557080"},{"key":"e_1_2_1_128_1","unstructured":"Zhouchen Lin Minming Chen and Yi Ma. 2010. The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices. arXiv:1009.5055.  Zhouchen Lin Minming Chen and Yi Ma. 2010. The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices. arXiv:1009.5055."},{"key":"e_1_2_1_129_1","volume-title":"Proceedings of ICCV.","author":"Liu Ji","year":"2009","unstructured":"Ji Liu , Przemyslaw Musialski , Peter Wonka , and Jieping Ye . 2009 . Tensor completion for estimating missing values in visual data . In Proceedings of ICCV. Ji Liu, Przemyslaw Musialski, Peter Wonka, and Jieping Ye. 2009. Tensor completion for estimating missing values in visual data. In Proceedings of ICCV."},{"key":"e_1_2_1_130_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.39"},{"key":"e_1_2_1_131_1","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2013.2245416"},{"key":"e_1_2_1_132_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973440.99"},{"key":"e_1_2_1_133_1","volume-title":"Proceedings of NIPS.","author":"Liu Yuanyuan","year":"2014","unstructured":"Yuanyuan Liu , Fanhua Shang , Wei Fan , James Cheng , and Hong Cheng . 2014 . Generalized higher-order orthogonal iteration for tensor decomposition and completion . In Proceedings of NIPS. Yuanyuan Liu, Fanhua Shang, Wei Fan, James Cheng, and Hong Cheng. 2014. Generalized higher-order orthogonal iteration for tensor decomposition and completion. In Proceedings of NIPS."},{"key":"e_1_2_1_134_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2374695"},{"key":"e_1_2_1_135_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2011.01.004"},{"key":"e_1_2_1_136_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2009.4959787"},{"key":"e_1_2_1_137_1","volume-title":"Giannakis","author":"Mardani Morteza","year":"2014","unstructured":"Morteza Mardani , Gonzalo Mateos , and Georgios B . Giannakis . 2014 . Imputation of streaming low-rank tensor data. In Proceedings of IEEE SAM. Morteza Mardani, Gonzalo Mateos, and Georgios B. Giannakis. 2014. Imputation of streaming low-rank tensor data. In Proceedings of IEEE SAM."},{"key":"e_1_2_1_138_1","volume-title":"Giannakis","author":"Mardani Morteza","year":"2015","unstructured":"Morteza Mardani , Gonzalo Mateos , and Georgios B . Giannakis . 2015 . Subspace learning and imputation for streaming big data matrices and tensors. In Proceedings of IEEE TSP. Morteza Mardani, Gonzalo Mateos, and Georgios B. Giannakis. 2015. Subspace learning and imputation for streaming big data matrices and tensors. In Proceedings of IEEE TSP."},{"key":"e_1_2_1_139_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339577"},{"key":"e_1_2_1_140_1","doi-asserted-by":"publisher","DOI":"10.1002\/cem.776"},{"key":"e_1_2_1_141_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2014.7039534"},{"key":"e_1_2_1_142_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.21748"},{"key":"e_1_2_1_143_1","unstructured":"Cun Mu Bo Huang John Wright and Donald Goldfarb. 2014. Square deal: Lower bounds and improved relaxations for tensor recovery. InProceedings of ICML.   Cun Mu Bo Huang John Wright and Donald Goldfarb. 2014. Square deal: Lower bounds and improved relaxations for tensor recovery. InProceedings of ICML."},{"key":"e_1_2_1_144_1","doi-asserted-by":"publisher","DOI":"10.5555\/2034117.2034150"},{"key":"e_1_2_1_145_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btu269"},{"key":"e_1_2_1_146_1","unstructured":"Maximilian Nickel. &lsqb;n. d.&rsqb;. Scikit-tensor: Python library for multilinear algebra and tensor factorizations.  Maximilian Nickel. &lsqb;n. d.&rsqb;. Scikit-tensor: Python library for multilinear algebra and tensor factorizations."},{"key":"e_1_2_1_147_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271713"},{"key":"e_1_2_1_148_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2016885"},{"key":"e_1_2_1_149_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2004.11.035"},{"key":"e_1_2_1_150_1","volume-title":"Proceedings of the 2018 IEEE 34th International Conference on Data Engineering (ICDE'18)","author":"Oh Sejoon","unstructured":"Sejoon Oh , Namyong Park , Lee Sael , and U. Kang . 2018. Scalable tucker factorization for sparse tensors-algorithms and discoveries . In Proceedings of the 2018 IEEE 34th International Conference on Data Engineering (ICDE'18) . IEEE, 1120--1131. Sejoon Oh, Namyong Park, Lee Sael, and U. Kang. 2018. Scalable tucker factorization for sparse tensors-algorithms and discoveries. In Proceedings of the 2018 IEEE 34th International Conference on Data Engineering (ICDE'18). IEEE, 1120--1131."},{"key":"e_1_2_1_151_1","doi-asserted-by":"publisher","DOI":"10.1137\/090752286"},{"key":"e_1_2_1_152_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7439(97)00031-2"},{"key":"e_1_2_1_153_1","doi-asserted-by":"publisher","DOI":"10.1109\/MLSP.2015.7324363"},{"key":"e_1_2_1_154_1","volume-title":"Sidiropoulos","author":"Papalexakis Evangelos E.","year":"2016","unstructured":"Evangelos E. Papalexakis , Christos Faloutsos , and Nicholas D . Sidiropoulos . 2016 . Tensors for data mining and data fusion: Models, applications, and scalable algorithms. In Proceedings of TIST. Evangelos E. Papalexakis, Christos Faloutsos, and Nicholas D. Sidiropoulos. 2016. Tensors for data mining and data fusion: Models, applications, and scalable algorithms. In Proceedings of TIST."},{"key":"e_1_2_1_155_1","volume-title":"Proceedings of IEEE International Conference on Big Data (Big Data\u201917)","author":"Papastergiou T.","unstructured":"T. Papastergiou and V. Megalooikonomou . 2017. A distributed proximal gradient descent method for tensor completion . In Proceedings of IEEE International Conference on Big Data (Big Data\u201917) . T. Papastergiou and V. Megalooikonomou. 2017. A distributed proximal gradient descent method for tensor completion. In Proceedings of IEEE International Conference on Big Data (Big Data\u201917)."},{"key":"e_1_2_1_156_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871541"},{"key":"e_1_2_1_157_1","unstructured":"M. G. Peterson and D. M. Dunlavy. 2014. Tensor toolbox: Wrapping to PYTHON using SWIG. CCR.  M. G. Peterson and D. M. Dunlavy. 2014. Tensor toolbox: Wrapping to PYTHON using SWIG. CCR."},{"key":"e_1_2_1_158_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2010.06.030"},{"key":"e_1_2_1_159_1","volume-title":"Do","author":"Phien Ho N.","year":"2016","unstructured":"Ho N. Phien , Hoang D. Tuan , Johann A. Bengua , and Minh N . Do . 2016 . Efficient tensor completion: Low-rank tensor train. arXiv:1601.01083. Ho N. Phien, Hoang D. Tuan, Johann A. Bengua, and Minh N. Do. 2016. Efficient tensor completion: Low-rank tensor train. arXiv:1601.01083."},{"key":"e_1_2_1_160_1","volume-title":"Proceedings of International Conference on Machine Learning.","author":"Rai Piyush","year":"2014","unstructured":"Piyush Rai , Yingjian Wang , Shengbo Guo , Gary Chen , David Dunson , and Lawrence Carin . 2014 . Scalable Bayesian low-rank decomposition of incomplete multiway tensors . In Proceedings of International Conference on Machine Learning. Piyush Rai, Yingjian Wang, Shengbo Guo, Gary Chen, David Dunson, and Lawrence Carin. 2014. Scalable Bayesian low-rank decomposition of incomplete multiway tensors. In Proceedings of International Conference on Machine Learning."},{"key":"e_1_2_1_161_1","volume-title":"Compressed Sensing and its Applications","author":"Rauhut Holger","unstructured":"Holger Rauhut , Reinhold Schneider , and \u017deljka Stojanac . 2015. Tensor completion in hierarchical tensor representations . In Compressed Sensing and its Applications . Birkh\u00e4user Verlag . Holger Rauhut, Reinhold Schneider, and \u017deljka Stojanac. 2015. Tensor completion in hierarchical tensor representations. In Compressed Sensing and its Applications. Birkh\u00e4user Verlag."},{"key":"e_1_2_1_162_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2017.02.028"},{"key":"e_1_2_1_163_1","unstructured":"Holger Rauhut and \u017deljka Stojanac. 2015. Tensor theta norms and low rank recovery. arXiv:1505.05175.  Holger Rauhut and \u017deljka Stojanac. 2015. Tensor theta norms and low rank recovery. arXiv:1505.05175."},{"key":"e_1_2_1_164_1","volume-title":"Journal of Machine Learning Research 12","author":"Recht Benjamin","year":"2011","unstructured":"Benjamin Recht . 2011 . A simpler approach to matrix completion . Journal of Machine Learning Research 12 , (2011), 3413--3430. Benjamin Recht. 2011. A simpler approach to matrix completion. Journal of Machine Learning Research 12, (2011), 3413--3430."},{"key":"e_1_2_1_165_1","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"e_1_2_1_166_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.127"},{"key":"e_1_2_1_167_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557100"},{"key":"e_1_2_1_168_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718498"},{"key":"e_1_2_1_169_1","volume-title":"Proceedings of NIPS.","author":"Romera-Paredes Bernardino","year":"2013","unstructured":"Bernardino Romera-Paredes and Massimiliano Pontil . 2013 . A new convex relaxation for tensor completion . In Proceedings of NIPS. Bernardino Romera-Paredes and Massimiliano Pontil. 2013. A new convex relaxation for tensor completion. In Proceedings of NIPS."},{"key":"e_1_2_1_170_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.bdr.2015.01.004"},{"key":"e_1_2_1_171_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390267"},{"key":"e_1_2_1_172_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2610420"},{"key":"e_1_2_1_173_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939809"},{"key":"e_1_2_1_174_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2690524"},{"key":"e_1_2_1_175_1","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2012.2210872"},{"key":"e_1_2_1_176_1","volume-title":"Lieven De Lathauwer, and Johan A. K. Suykens","author":"Signoretto Marco","year":"2010","unstructured":"Marco Signoretto , Lieven De Lathauwer, and Johan A. K. Suykens . 2010 . Nuclear norms for tensors and their use for convex multilinear estimation. Linear Algebra and Its Applications 43 (2010), to be submitted. Marco Signoretto, Lieven De Lathauwer, and Johan A. K. Suykens. 2010. Nuclear norms for tensors and their use for convex multilinear estimation. Linear Algebra and Its Applications 43 (2010), to be submitted."},{"key":"e_1_2_1_177_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-013-5366-3"},{"key":"e_1_2_1_178_1","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2011.2151856"},{"key":"e_1_2_1_179_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401969"},{"key":"e_1_2_1_180_1","volume-title":"Multi-Way Analysis: Applications in the Chemical Sciences","author":"Smilde Age","unstructured":"Age Smilde , Rasmus Bro , and Paul Geladi . 2005. Multi-Way Analysis: Applications in the Chemical Sciences . John Wiley 8 Sons. Age Smilde, Rasmus Bro, and Paul Geladi. 2005. Multi-Way Analysis: Applications in the Chemical Sciences. John Wiley 8 Sons."},{"key":"e_1_2_1_181_1","doi-asserted-by":"publisher","DOI":"10.1002\/1099-128X(200005\/06)14:3<301::AID-CEM594>3.0.CO;2-H"},{"key":"e_1_2_1_182_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2017.20"},{"key":"e_1_2_1_183_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-64203-1_47"},{"key":"e_1_2_1_184_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11758-4_11"},{"key":"e_1_2_1_185_1","volume-title":"Adaptive Signal Processing Algorithms: Stability and Performance","author":"Solo Victor","unstructured":"Victor Solo and Xuan Kong . 1994. Adaptive Signal Processing Algorithms: Stability and Performance . Prentice-Hall, Inc. Victor Solo and Xuan Kong. 1994. Adaptive Signal Processing Algorithms: Stability and Performance. Prentice-Hall, Inc."},{"key":"e_1_2_1_186_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098007"},{"key":"e_1_2_1_187_1","doi-asserted-by":"publisher","DOI":"10.1007\/11503415_37"},{"key":"e_1_2_1_188_1","doi-asserted-by":"publisher","DOI":"10.1155\/2009\/421425"},{"key":"e_1_2_1_189_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150445"},{"key":"e_1_2_1_190_1","doi-asserted-by":"publisher","DOI":"10.1145\/1409620.1409621"},{"key":"e_1_2_1_191_1","doi-asserted-by":"publisher","DOI":"10.1145\/2959100.2959195"},{"key":"e_1_2_1_192_1","doi-asserted-by":"publisher","DOI":"10.1145\/1454008.1454017"},{"key":"e_1_2_1_193_1","doi-asserted-by":"publisher","DOI":"10.1145\/3009912.3009914"},{"key":"e_1_2_1_194_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2012.03.039"},{"key":"e_1_2_1_195_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2013.11.020"},{"key":"e_1_2_1_196_1","volume-title":"Traffic","author":"Tan Huachun","year":"2013","unstructured":"Huachun Tan , Jianshuai Feng , Guangdong Feng , Wuhong Wang , and Yu-Jin Zhang . 2013. Traffic volume data outlier recovery via tensor model. Mathematical Problems in Engineering 2013 ( 2013 ), Article 164810. Huachun Tan, Jianshuai Feng, Guangdong Feng, Wuhong Wang, and Yu-Jin Zhang. 2013. Traffic volume data outlier recovery via tensor model. Mathematical Problems in Engineering 2013 (2013), Article 164810."},{"key":"e_1_2_1_197_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sbspro.2013.08.272"},{"key":"e_1_2_1_198_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2016.2608882"},{"key":"e_1_2_1_199_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.chemolab.2004.07.003"},{"key":"e_1_2_1_200_1","unstructured":"Ryota Tomioka Kohei Hayashi and Hisashi Kashima. 2010. Estimation of low-rank tensors via convex optimization. arXiv:1010.0789.  Ryota Tomioka Kohei Hayashi and Hisashi Kashima. 2010. Estimation of low-rank tensors via convex optimization. arXiv:1010.0789."},{"key":"e_1_2_1_201_1","volume-title":"Proceedings of NIPS.","author":"Tomioka Ryota","year":"2011","unstructured":"Ryota Tomioka , Taiji Suzuki , Kohei Hayashi , and Hisashi Kashima . 2011 . Statistical performance of convex tensor decomposition . In Proceedings of NIPS. Ryota Tomioka, Taiji Suzuki, Kohei Hayashi, and Hisashi Kashima. 2011. Statistical performance of convex tensor decomposition. In Proceedings of NIPS."},{"key":"e_1_2_1_202_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909108"},{"key":"e_1_2_1_203_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289464"},{"key":"e_1_2_1_204_1","doi-asserted-by":"publisher","DOI":"10.5555\/645315.649173"},{"key":"e_1_2_1_206_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7439(01)00131-9"},{"key":"e_1_2_1_207_1","volume-title":"Proceedings of AAAI.","author":"Wang Hua","year":"2014","unstructured":"Hua Wang , Feiping Nie , and Heng Huang . 2014 . Low-rank tensor completion with spatio-temporal consistency . In Proceedings of AAAI. Hua Wang, Feiping Nie, and Heng Huang. 2014. Low-rank tensor completion with spatio-temporal consistency. In Proceedings of AAAI."},{"key":"e_1_2_1_208_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783395"},{"key":"e_1_2_1_209_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623656"},{"key":"e_1_2_1_210_1","unstructured":"Kishan Wimalawarne Makoto Yamada and Hiroshi Mamitsuka. 2017. Convex coupled matrix and tensor completion. arXiv:1705.05197.  Kishan Wimalawarne Makoto Yamada and Hiroshi Mamitsuka. 2017. Convex coupled matrix and tensor completion. arXiv:1705.05197."},{"key":"e_1_2_1_211_1","volume-title":"On polynomial time methods for exact low rank tensor completion. Foundations of Computational Mathematics","author":"Xia Dong","year":"2017","unstructured":"Dong Xia and Ming Yuan . 2017. On polynomial time methods for exact low rank tensor completion. Foundations of Computational Mathematics ( 2017 ), to be appear. Dong Xia and Ming Yuan. 2017. On polynomial time methods for exact low rank tensor completion. Foundations of Computational Mathematics (2017), to be appear."},{"key":"e_1_2_1_212_1","volume-title":"Turaga","author":"Xiao Houping","year":"2015","unstructured":"Houping Xiao , Yaliang Li , Jing Gao , Fei Wang , Liang Ge , Wei Fan , Long H. Vu , and Deepak S . Turaga . 2015 . Believe it today or tomorrow? Detecting untrustworthy information from dynamic multi-source data. In Proceedings of SDM. Houping Xiao, Yaliang Li, Jing Gao, Fei Wang, Liang Ge, Wei Fan, Long H. Vu, and Deepak S. Turaga. 2015. Believe it today or tomorrow? Detecting untrustworthy information from dynamic multi-source data. In Proceedings of SDM."},{"key":"e_1_2_1_213_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2018.2806225"},{"key":"e_1_2_1_214_1","volume-title":"Carbonell","author":"Xiong Liang","year":"2010","unstructured":"Liang Xiong , Xi Chen , Tzu-Kuo Huang , Jeff Schneider , and Jaime G . Carbonell . 2010 . Temporal collaborative filtering with bayesian probabilistic tensor factorization. In Proceedings of ICDM. Liang Xiong, Xi Chen, Tzu-Kuo Huang, Jeff Schneider, and Jaime G. Carbonell. 2010. Temporal collaborative filtering with bayesian probabilistic tensor factorization. In Proceedings of ICDM."},{"key":"e_1_2_1_215_1","unstructured":"Yangyang Xu Ruru Hao Wotao Yin and Zhixun Su. 2013. Parallel matrix factorization for low-rank tensor completion. arXiv:1312.1254.  Yangyang Xu Ruru Hao Wotao Yin and Zhixun Su. 2013. Parallel matrix factorization for low-rank tensor completion. arXiv:1312.1254."},{"key":"e_1_2_1_216_1","doi-asserted-by":"publisher","DOI":"10.1137\/120887795"},{"key":"e_1_2_1_217_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11464-012-0194-5"},{"key":"e_1_2_1_218_1","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2015.2420592"},{"key":"e_1_2_1_219_1","volume-title":"Proceedings of NIPS.","author":"Y\u0131lmaz Kenan Y.","year":"2011","unstructured":"Kenan Y. Y\u0131lmaz , Ali T. Cemgil , and Umut Simsekli . 2011 . Generalised coupled tensor factorisation . In Proceedings of NIPS. Kenan Y. Y\u0131lmaz, Ali T. Cemgil, and Umut Simsekli. 2011. Generalised coupled tensor factorisation. In Proceedings of NIPS."},{"key":"e_1_2_1_220_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2388958"},{"key":"e_1_2_1_221_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2695566"},{"key":"e_1_2_1_222_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00861"},{"key":"e_1_2_1_223_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.409"},{"key":"e_1_2_1_224_1","doi-asserted-by":"crossref","unstructured":"Tatsuya Yokota and Hidekata Hontani. 2018. Simultaneous tensor completion and denoising by noise inequality constrained convex optimization. arXiv:1801.03299.  Tatsuya Yokota and Hidekata Hontani. 2018. Simultaneous tensor completion and denoising by noise inequality constrained convex optimization. arXiv:1801.03299.","DOI":"10.1109\/ACCESS.2019.2894622"},{"key":"e_1_2_1_225_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2586759"},{"key":"e_1_2_1_227_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.168"},{"key":"e_1_2_1_228_1","volume-title":"Proceedings of ICML.","author":"Yu Rose","year":"2015","unstructured":"Rose Yu , Dehua Cheng , and Yan Liu . 2015 . Accelerated online low-rank tensor learning for multivariate spatio-temporal streams . In Proceedings of ICML. Rose Yu, Dehua Cheng, and Yan Liu. 2015. Accelerated online low-rank tensor learning for multivariate spatio-temporal streams. In Proceedings of ICML."},{"key":"e_1_2_1_229_1","unstructured":"Longhao Yuan Chao Li Danilo Mandic Jianting Cao and Qibin Zhao. 2018. Rank minimization on tensor ring: A new paradigm in scalable tensor decomposition and completion. arXiv:1805.08468.  Longhao Yuan Chao Li Danilo Mandic Jianting Cao and Qibin Zhao. 2018. Rank minimization on tensor ring: A new paradigm in scalable tensor decomposition and completion. arXiv:1805.08468."},{"key":"e_1_2_1_230_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2724549"},{"key":"e_1_2_1_231_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-015-9269-5"},{"key":"e_1_2_1_232_1","volume-title":"Mohammad Ali Abbasi, and Huan Liu","author":"Zafarani Reza","year":"2014","unstructured":"Reza Zafarani , Mohammad Ali Abbasi, and Huan Liu . 2014 . Social Media Mining: An Introduction . Cambridge University Press . Reza Zafarani, Mohammad Ali Abbasi, and Huan Liu. 2014. Social Media Mining: An Introduction. Cambridge University Press."},{"key":"e_1_2_1_233_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2639466"},{"key":"e_1_2_1_234_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.485"},{"key":"e_1_2_1_235_1","doi-asserted-by":"crossref","unstructured":"Longhao Yuan Zhao Jianting Cao etal 2018. High-dimension tensor completion via gradient-based optimization under tensor-train format. arXiv:1804.01983.  Longhao Yuan Zhao Jianting Cao et al. 2018. High-dimension tensor completion via gradient-based optimization under tensor-train format. arXiv:1804.01983.","DOI":"10.1016\/j.image.2018.11.012"},{"key":"e_1_2_1_236_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2392756"},{"key":"e_1_2_1_237_1","unstructured":"Qibin Zhao Liqing Zhang and Andrzej Cichocki. 2015. Bayesian sparse tucker models for dimension reduction and tensor completion. arXiv:1505.02343.  Qibin Zhao Liqing Zhang and Andrzej Cichocki. 2015. Bayesian sparse tucker models for dimension reduction and tensor completion. arXiv:1505.02343."},{"key":"e_1_2_1_238_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2423694"},{"key":"e_1_2_1_239_1","volume-title":"Proceedings of AAAI.","author":"Zheng Vincent Wenchen","year":"2010","unstructured":"Vincent Wenchen Zheng , Bin Cao , Yu Zheng , Xing Xie , and Qiang Yang . 2010 . Collaborative filtering meets mobile recommendation: A user-centered approach . In Proceedings of AAAI. Vincent Wenchen Zheng, Bin Cao, Yu Zheng, Xing Xie, and Qiang Yang. 2010. Collaborative filtering meets mobile recommendation: A user-centered approach. In Proceedings of AAAI."},{"key":"e_1_2_1_240_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939763"},{"key":"e_1_2_1_241_1","doi-asserted-by":"publisher","DOI":"10.5555\/3172077.3172384"},{"key":"e_1_2_1_242_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68880-8_32"},{"key":"e_1_2_1_243_1","volume-title":"Smola","author":"Zinkevich Martin","year":"2010","unstructured":"Martin Zinkevich , Markus Weimer , Lihong Li , and Alex J . Smola . 2010 . Parallelized stochastic gradient descent. In Proceedings of NIPS. Martin Zinkevich, Markus Weimer, Lihong Li, and Alex J. Smola. 2010. Parallelized stochastic gradient descent. In Proceedings of NIPS."}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3278607","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3278607","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3278607","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:43:53Z","timestamp":1750207433000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3278607"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,9]]},"references-count":240,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,2,28]]}},"alternative-id":["10.1145\/3278607"],"URL":"https:\/\/doi.org\/10.1145\/3278607","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,9]]},"assertion":[{"value":"2017-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-01-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}