Qingquan Song
Skip Abstract Section
Abstract
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.
- Evrim Acar, Daniel M. Dunlavy, and Tamara G. Kolda. 2009. Link prediction on evolving data using matrix and tensor factorizations. In Proceedings of the IEEE International Conference on Data Mining Workshops (ICDMW’09). Google Scholar
Digital Library
- Evrim Acar, Daniel M. Dunlavy, Tamara G. Kolda, and Morten Mørup. 2011. Scalable tensor factorizations for incomplete data. Chemometrics and Intelligent Laboratory Systems 106, 1 (2011), 41--56.Google ScholarCross Ref
- Evrim Acar, Tamara G. Kolda, and Daniel M. Dunlavy. 2011. All-at-once optimization for coupled matrix and tensor factorizations. arXiv:1105.3422.Google Scholar
- Evrim Acar and Bülent Yener. 2009. Unsupervised multiway data analysis: A literature survey. IEEE Transactions on Knowledge and Data Engineering 21, 1 (2009), 6--20. Google ScholarDigital Library
- Claus A. Andersson and Rasmus Bro. 1998. Improving the speed of multi-way algorithms:: Part I. Tucker3. Chemometrics and Intelligent Laboratory Systems 42, 1 (1998), 93--103.Google ScholarCross Ref
- Claus A. Andersson and Rasmus Bro. 2000. The N-way toolbox for MATLAB. Chemometrics and Intelligent Laboratory Systems 52, 1 (2000), 1--4.Google ScholarCross Ref
- Carl J. Appellof and E. R. Davidson. 1981. Strategies for analyzing data from video fluorometric monitoring of liquid chromatographic effluents. Analytical Chemistry 53, 13 (1981), 2053--2056.Google ScholarCross Ref
- Morteza Ashraphijuo and Xiaodong Wang. 2017. Fundamental conditions for low-CP-rank tensor completion. Journal of Machine Learning Research 18, 1 (2017), 2116--2145. Google ScholarDigital Library
- Brett W. Bader and Tamara G. Kolda. 2006. Algorithm 862: MATLAB tensor classes for fast algorithm prototyping. ACM Transactions on Mathematical Software 32, 4 (2006), 635--653. Google ScholarDigital Library
- Brett W. Bader, Tamara G. Kolda, et al. 2012. Matlab tensor toolbox version 2.5. (January 2012). Retrieved from https://www.tensortoolbox.org/.Google Scholar
- 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’14).Google Scholar
- Arindam Banerjee, Sugato Basu, and Srujana Merugu. 2007. Multi-way clustering on relation graphs. In Proceedings of the 2007 SIAM International Conference on Data Mining (ICDM’07).Google ScholarCross Ref
- Boaz Barak and Ankur Moitra. 2015. Tensor prediction, rademacher complexity and random 3-xor. CoRR, abs/1501.06521.Google Scholar
- Boaz Barak and Ankur Moitra. 2016. Noisy tensor completion via the sum-of-squares hierarchy. In Proceedings of Conference on Learning Theory.Google Scholar
- Juan Andrés Bazerque, Gonzalo Mateos, and Georgios B. Giannakis. 2013. Rank regularization and Bayesian inference for tensor completion and extrapolation. IEEE Transactions on Signal Processing 61, 22 (2013), 5689--5703. Google ScholarDigital Library
- 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’14).Google Scholar
- Mark Beyer. 2011. Gartner Says Solving ‘Big data’ Challenge Involves More Than Just Managing Volumes of Data. Gartner. Archived from the Original on (2011).Google Scholar
- Srinadh Bhojanapalli and Sujay Sanghavi. 2015. A new sampling technique for tensors. arXiv:1502.05023.Google Scholar
- Rasmus Bro. 1997. PARAFAC. Tutorial and applications. Chemometrics and Intelligent Laboratory Systems 38 (1997), 149--171.Google ScholarCross Ref
- Rasmus Bro. 1998. Multi-way analysis in the food industry: Models, algorithms, and applications. In Proc. ICSLP 2000 MRI, EPG and EMA.Google Scholar
- Deng Cai, Xiaofei He, Jiawei Han, and Thomas S. Huang. 2011. Graph regularized nonnegative matrix factorization for data representation. IEEE Transactions on Pattern Analysis and Machine Intelligence 33, 8 (2011), 1548--1560. Google ScholarDigital Library
- Jian-Feng Cai, Emmanuel J. Candès, and Zuowei Shen. 2010. A singular value thresholding algorithm for matrix completion. SIAM Journal on Optimization 20, 4 (2010), 1956--1982.Google ScholarCross Ref
- 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.Google Scholar
- Cesar F. Caiafa and Andrzej Cichocki. 2013. Computing sparse representations of multidimensional signals using kronecker bases. Neural Computation 25, 1 (2013), 186--220. Google ScholarDigital Library
- Cesar F. Caiafa and Andrzej Cichocki. 2015. Stable, robust, and super fast reconstruction of tensors using multi-way projections. IEEE Transactions on Signal Processing 63, 3 (2015), 780--793.Google ScholarCross Ref
- Emmanuel Candes and Benjamin Recht. 2012. Exact matrix completion via convex optimization. Communications of the ACM 55, 6 (2012), 111--119. Google ScholarDigital Library
- Emmanuel J. Candès, Xiaodong Li, Yi Ma, and John Wright. 2011. Robust principal component analysis?Journal of the ACM 58, 3 (2011), Article 11.Google Scholar
- Emmanuel J. Candes and Yaniv Plan. 2010. Matrix completion with noise. Proceedings of IEEE 98, 6 (2010), 925--936.Google ScholarCross Ref
- Emmanuel J. Candès, Justin Romberg, and Terence Tao. 2006. Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information. IEEE Transactions on Information Theory 52, 2 (2006), 489--509. Google ScholarDigital Library
- J. Douglas Carroll and Jih-Jie Chang. 1970. Analysis of individual differences in multidimensional scaling via an N-way generalization of “Eckart-Young” decomposition. Psychometrika 53, 3 (1970), 283--319.Google ScholarCross Ref
- J. Douglas Carroll, Sandra Pruzansky, and Joseph B. Kruskal. 1980. CANDELINC: A general approach to multidimensional analysis of many-way arrays with linear constraints on parameters. Psychometrika 45, 1 (1980), 3--24.Google ScholarCross Ref
- Chris Chatfield and Mohammad Yar. 1988. Holt-Winters forecasting: Some practical issues. Statistician 37, 2 (1988), 129--140.Google ScholarCross Ref
- Yi-Lei Chen, Chiou-Ting Hsu, and Hong-Yuan Mark Liao. 2014. Simultaneous tensor decomposition and completion using factor priors. IEEE Transactions on Pattern Analysis and Machine Intelligence 36, 3 (2014), 577--591. Google ScholarDigital Library
- Hao Cheng, Yaoliang Yu, Xinhua Zhang, Eric Xing, and Dale Schuurmans. 2016. Scalable and sound low-rank tensor learning. In Artificial Intelligence and Statistics.Google Scholar
- Joon Hee Choi and S. Vishwanathan. 2014. DFacTo: Distributed factorization of tensors. In Proceedings of NIPS. Google ScholarDigital Library
- Wei Chu and Zoubin Ghahramani. 2009. Probabilistic models for incomplete multi-dimensional arrays. In Proceedings of AISTATS.Google Scholar
- 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. Google ScholarDigital Library
- Pierre Comon. 2004. Canonical tensor decompositions. In Proceedings of Workshop on Tensor Decompositions, Palo Alto, CA.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- Justin Dauwels, Lalit Garg, Arul Earnest, and Leong Khai Pang. 2011. Handling missing data in medical questionnaires using tensor decompositions. In Proceedings of ICICS.Google ScholarCross Ref
- Lieven De Lathauwer, Bart De Moor, and Joos Vandewalle. 2000. A multilinear singular value decomposition. SIAM Journal on Matrix Analysis and Applications 21, 4 (2000), 1253--1278. Google ScholarDigital Library
- Lieven De Lathauwer, Bart De Moor, and Joos Vandewalle. 2000. On the best rank-1 and rank-(r 1, r 2,…, rn) approximation of higher-order tensors. SIAM Journal on Matrix Analysis and Applications 21, 4 (2000), 1324--1342. Google ScholarDigital Library
- Inderjit S. Dhillon and Suvrit Sra. 2005. Generalized nonnegative matrix approximations with Bregman divergences. In Proceedings of NIPS. Google ScholarDigital Library
- David L. Donoho. 2006. Compressed sensing. IEEE Transactions on Information Theory 52, 4 (2006), 1289--1306. Google ScholarDigital Library
- Marco F. Duarte and Richard G. Baraniuk. 2012. Kronecker compressive sensing. IEEE Transactions on Image Processing 21, 2 (2012), 494--504. Google ScholarDigital Library
- Daniel M. Dunlavy, Tamara G. Kolda, and Evrim Acar. 2011. Temporal link prediction using matrix and tensor factorizations. ACM Transactions on Knowledge Discovery from Data 5, 2 (2011), Article 10. Google ScholarDigital Library
- Jonathan Eckstein and Dimitri P. Bertsekas. 1992. On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operators. Mathematical Programming 55, 1--3 (1992), 293--318. Google ScholarDigital Library
- Yonina C. Eldar and Gitta Kutyniok. 2012. Compressed Sensing: Theory and Applications. Cambridge University Press.Google Scholar
- Yonina C. Eldar, Deanna Needell, and Yaniv Plan. 2012. Uniqueness conditions for low-rank matrix recovery. Applied and Computational Harmonic Analysis 33, 2 (2012), 309--314.Google ScholarCross Ref
- Beyza Ermiş, Evrim Acar, and A. Taylan Cemgil. 2012. Link prediction via generalized coupled tensor factorisation. arXiv:1208.6231.Google Scholar
- Beyza Ermiş, Evrim Acar, and A. Taylan Cemgil. 2015. Link prediction in heterogeneous data via generalized coupled tensor factorization. Data Mining and Knowledge Discovery 29, 1 (2015), 203--236. Google ScholarDigital Library
- 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.Google Scholar
- Hadi Fanaee-T. and João Gama. 2015. Multi-aspect-streaming tensor analysis. Knowledge-Based Systems 89 (2015), 332--345. Google ScholarDigital Library
- Jiashi Feng, Huan Xu, and Shuicheng Yan. 2013. Online robust PCA via stochastic optimization. In Proceedings of NIPS. Google ScholarDigital Library
- Marko Filipović and Ante Jukić. 2015. Tucker factorization with missing data with application to low-n-rank tensor completion. Multidimensional Systems and Signal Processing 26, 3 (2015), 677--692. Google ScholarDigital Library
- David H. Foster, Sérgio M. C. Nascimento, and Kinjiro Amano. 2004. Information limits on neural identification of colored surfaces in natural scenes. Visual Neuroscience 21, 3 (2004), 331--336.Google ScholarCross Ref
- Shmuel Friedland, Qun Li, and Dan Schonfeld. 2014. Compressive sensing of sparse tensors. IEEE Transactions on Image Processing 23, 10 (2014), 4438--4447.Google ScholarCross Ref
- 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.Google Scholar
- Hancheng Ge, James Caverlee, and Haokai Lu. 2016. Taper: A contextual tensor-based approach for personalized expert recommendation. In Proceedings of RecSys. Google ScholarDigital Library
- Hancheng Ge, James Caverlee, Nan Zhang, and Anna Squicciarini. 2016. Uncovering the spatio-temporal dynamics of memes in the presence of incomplete information. In Proceedings of CIKM. Google ScholarDigital Library
- Hancheng Ge, Kai Zhang, Majid Alfifi, Xia Hu, and James Caverlee. 2018. DisTenC: A distributed algorithm for scalable tensor completion on spark. In Proceedings of ICDE.Google ScholarCross Ref
- Rainer Gemulla, Erik Nijkamp, Peter J. Haas, and Yannis Sismanis. 2011. Large-scale matrix factorization with distributed stochastic gradient descent. In Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 69--77. Google ScholarDigital Library
- Xin Geng and Kate Smith-Miles. 2009. Facial age estimation by multilinear subspace analysis. In Proceedings of ICASSP. Google ScholarDigital Library
- Xin Geng, Kate Smith-Miles, Zhi-Hua Zhou, and Liang Wang. 2011. Face image modeling by multilinear subspace analysis with missing values. IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) 41, 3 (2011), 881--892. Google ScholarDigital Library
- Navid Ghadermarzy, Yaniv Plan, and Özgür Yılmaz. 2017. Near-optimal sample complexity for convex tensor completion. arXiv:1711.04965.Google Scholar
- Donald Goldfarb and Zhiwei Qin. 2014. Robust low-rank tensor recovery: Models and algorithms. SIAM Journal on Matrix Analysis and Applications 35, 1 (2014), 225--253.Google ScholarCross Ref
- Lars Grasedyck, Melanie Kluge, and Sebastian Krämer. 2015. Alternating least squares tensor completion in the TT-format. arXiv:1509.00311.Google Scholar
- Lars Grasedyck, Daniel Kressner, and Christine Tobler. 2013. A literature survey of low-rank tensor approximation techniques. GAMM-Mitteilungen 36, 1 (2013), 53--78.Google ScholarCross Ref
- David Gross. 2011. Recovering low-rank matrices from few coefficients in any basis. IEEE Transactions on Information Theory 57, 3 (2011), 1548--1566. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- Wolfgang Hackbusch. 2012. Tensor Spaces and Numerical Tensor Calculus. Springer Science 8 Business Media.Google Scholar
- Zaid Harchaoui, Anatoli Juditsky, and Arkadi Nemirovski. 2015. Conditional gradient algorithms for norm-regularized smooth convex optimization. Mathematical Programming 152, 1--2 (2015), 75--112. Google ScholarDigital Library
- Richard A. Harshman. 1970. Foundations of the PARAFAC Procedure: Models and Conditions for an “Explanatory” Multi-Modal Factor Analysis. University of California at Los Angeles, Los Angeles, CA.Google Scholar
- Johan Håstad. 1990. Tensor rank is NP-complete. Journal of Algorithms 11, 4 (1990), 644--654. Google ScholarDigital Library
- René Henrion. 1994. N-way principal component analysis theory, algorithms and applications. Chemometrics and Intelligent Laboratory Systems 25, 1 (1994), 1--23.Google ScholarCross Ref
- David Hernandez. 2010. Simple tensor products. Inventiones Mathematicae 181, 3 (2010), 649--675.Google ScholarCross Ref
- Frank L. Hitchcock. 1928. Multiple invariants and generalized rank of a p-way matrix or tensor. Journal of Mathematics and Physics 7, 1--4 (1928), 39--79.Google ScholarCross Ref
- Frank L. Hitchcock. 1927. The expression of a tensor or a polyadic as a sum of products. Journal of Mathematics and Physics 6, 1--4 (1927), 164--189.Google ScholarCross Ref
- Joyce C. Ho, Joydeep Ghosh, Steve R. Steinhubl, Walter F. Stewart, Joshua C. Denny, Bradley A. Malin, and Jimeng Sun. 2014. Limestone: High-throughput candidate phenotype generation via tensor factorization. Journal of Biomedical Informatics 52 (2014), 199--211. Google ScholarDigital Library
- Weiming Hu, Xi Li, Xiaoqin Zhang, Xinchu Shi, Stephen Maybank, and Zhongfei Zhang. 2011. Incremental tensor subspace learning and its applications to foreground segmentation and tracking. International Journal of Computer Vision 91, 3 (2011), 303--327. Google ScholarDigital Library
- Bo Huang, Cun Mu, Donald Goldfarb, and John Wright. 2014. Provable low-rank tensor recovery. Optimization-Online.Google Scholar
- Furong Huang, U. N. Niranjan, M. Hakeem, and Animashree Anandkumar. 2013. Fast detection of overlapping communities via online tensor methods. arXiv:1309.0787.Google Scholar
- Masaaki Imaizumi, Takanori Maehara, and Kohei Hayashi. 2017. On tensor train rank minimization: Statistical efficiency and scalable algorithm. In Proceedings of NIPS. Google ScholarDigital Library
- Prateek Jain and Sewoong Oh. 2014. Provable tensor factorization with missing data. In Proceedings of NIPS. Google ScholarDigital Library
- Swayambhoo Jain, Alexander Gutierrez, and Jarvis Haupt. 2017. Noisy tensor completion for tensors with a sparse canonical polyadic factor. In Proceedings of the 2017 IEEE International Symposium on Information Theory (ISIT'17). IEEE, 2153--2157.Google ScholarCross Ref
- Sajid Javed, Thierry Bouwmans, and Soon Ki Jung. 2015. Stochastic decomposition into low rank and sparse tensor for robust background subtraction. In Proceedings of IET.Google ScholarCross Ref
- Inah Jeon, Evangelos E. Papalexakis, U. Kang, and Christos Faloutsos. 2015. Haten2: Billion-scale tensor decompositions. In Proceedings of IEEE ICDE.Google ScholarCross Ref
- Teng-Yu Ji, Ting-Zhu Huang, Xi-Le Zhao, Tian-Hui Ma, and Gang Liu. 2016. Tensor completion using total variation and low-rank matrix factorization. Information Sciences 326 (2016), 243--257. Google ScholarDigital Library
- Charles R. Johnson. 1990. Matrix completion problems: A survey. Symposia in Applied Mathematics 40 (1990), 171--198.Google ScholarCross Ref
- U. Kang, Evangelos Papalexakis, Abhay Harpale, and Christos Faloutsos. 2012. Gigatensor: Scaling tensor analysis up by 100 times-algorithms and discoveries. In Proceedings of SIGKDD. Google ScholarDigital Library
- Alexandros Karatzoglou, Xavier Amatriain, Linas Baltrunas, and Nuria Oliver. 2010. Multiverse recommendation: N-dimensional tensor factorization for context-aware collaborative filtering. In Proceedings of the 4th ACM Conference on Recommender Systems. Google ScholarDigital Library
- Lars Karlsson, Daniel Kressner, and André Uschmajew. 2016. Parallel algorithms for tensor completion in the CP format. Parallel Computing 57 (2016), 222--234. Google ScholarDigital Library
- Hiroyuki Kasai. 2016. Online low-rank tensor subspace tracking from incomplete data by CP decomposition using recursive least squares. In Proceedings of ICASSP.Google ScholarCross Ref
- Hiroyuki Kasai and Bamdev Mishra. 2015. Riemannian preconditioning for tensor completion. In Proceedings of the NeurIPS Workshop on Optimization for Machine Learning (OPT'15).Google Scholar
- 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. Google ScholarDigital Library
- Hisashi Kashima, Tsuyoshi Kato, Yoshihiro Yamanishi, Masashi Sugiyama, and Koji Tsuda. 2009. Link propagation: A fast semi-supervised learning algorithm for link prediction. In Proceedings of ICDM.Google ScholarCross Ref
- Oguz Kaya and Bora Uçar. 2016. Parallel CP decomposition of sparse tensors using dimension trees. Ph.D. dissertation. Inria-Research Centre Grenoble--Rhône-Alpes.Google Scholar
- Suleiman A. Khan and Muhammad Ammad-ud-din. 2016. tensorBF: An R package for Bayesian tensor factorization. bioRxiv.Google Scholar
- Henk A. L. Kiers. 1997. Weighted least squares fitting using ordinary least squares algorithms. Psychometrika 62, 2 (1997), 251--266.Google ScholarCross Ref
- Henk A. L. Kiers. 2000. Towards a standardized notation and terminology in multiway analysis. Journal of Chemometrics 14,3 (2000), 105--122.Google ScholarCross Ref
- Henk A. L. Kiers and Iven Van Mechelen. 2001. Three-way component analysis: Principles and illustrative application. Psychological Methods 6, 1 (2001), 84--110.Google ScholarCross Ref
- Henk A. L. Kiers, Jos M.F. Ten Berge, and Rasmus Bro. 1999. PARAFAC2-Part I. A direct fitting algorithm for the PARAFAC2 model. Journal of Chemometrics 13 (1999), 275--294.Google ScholarCross Ref
- Misha E. Kilmer, Karen Braman, Ning Hao, and Randy C. Hoover. 2013. Third-order tensors as operators on matrices: A theoretical and computational framework with applications in imaging. SIAM Journal on Matrix Analysis and Applications 34, 1 (2013), 148--172.Google ScholarCross Ref
- Morris Kline. 1990. Mathematical Thought From Ancient to Modern Times: Volume 3. OUP.Google Scholar
- Tamara G. Kolda and Brett W. Bader. 2009. Tensor decompositions and applications. SIAM Review 51, 3 (2009), 455--500. Google ScholarDigital Library
- Tamara G. Kolda and Jimeng Sun. 2008. Scalable tensor decompositions for multi-aspect data mining. In Proceedings of IEEE ICDM. Google ScholarDigital Library
- Yehuda Koren. 2008. Factorization meets the neighborhood: A multifaceted collaborative filtering model. In Proceedings of ACM SIGKDD . Google ScholarDigital Library
- Yehuda Koren, Robert Bell, and Chris Volinsky. 2009. Matrix factorization techniques for recommender systems. Computer 42, 8 (2009), 30--37. Google ScholarDigital Library
- Daniel Kressner, Michael Steinlechner, and Bart Vandereycken. 2014. Low-rank tensor completion by riemannian optimization. BIT Numerical Mathematics 54, 2 (2014), 447--468.Google ScholarCross Ref
- Akshay Krishnamurthy and Aarti Singh. 2013. Low-rank matrix and tensor completion via adaptive sampling. In Proceedings of NIPS. Google ScholarDigital Library
- Pieter M. Kroonenberg. 1983. Three-Mode Principal Component Analysis: Theory and Applications. DSWO Press.Google Scholar
- Pieter M. Kroonenberg. 2008. Applied Multiway Data Analysis, Vol. 702. John Wiley and Sons.Google Scholar
- Pieter M. Kroonenberg and Jan De Leeuw. 1980. Principal component analysis of three-mode data by means of alternating least squares algorithms. Psychometrika 45, 1(1980), 69--97.Google ScholarCross Ref
- 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.Google Scholar
- 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. Google ScholarDigital Library
- Hemank Lamba, Vaishnavh Nagarajan, Kijung Shin, and Naji Shajarisales. 2016. Incorporating side information in tensor completion. In Proceedings of WWW. Google ScholarDigital Library
- Monique Laurent. 2009. Matrix completion problems. In Encyclopedia of Optimization. Springer.Google Scholar
- John Lee. 2012. Introduction to Smooth Manifolds. Springer Science and Business Media.Google Scholar
- Didier G. Leibovici. 2010. Spatio-temporal multiway decompositions using principal tensor analysis on k-modes: The R package PTAk. Journal of Statistical Software 34, 10 (2010), 1--34.Google ScholarCross Ref
- James Li, Jacob Bien, Martin Wells, and Maintainer James Li. 2015. Tools for Tensor Analysis and Decomposition. Package ‘rTensor’ .Google Scholar
- Jiajia Li, Jee Choi, Ioakeim Perros, Jimeng Sun, and Richard Vuduc. 2017. Model-driven sparse CP decomposition for higher-order tensors. In Proceedings of the IEEE International IPDPS.Google ScholarCross Ref
- Qun Li, Dan Schonfeld, and Shmuel Friedland. 2013. Generalized tensor compressive sensing. In Proceedings of the IEEE ICME.Google ScholarCross Ref
- Wu-Jun Li and Dit Yan Yeung. 2009. Relation regularized matrix factorization. In Proceedings of IJCAI. Google ScholarDigital Library
- Yong Li, Wenrui Dai, and Hongkai Xiong. 2016. Compressive tensor sampling with structured sparsity. In Proceedings of the IEEE DCC.Google ScholarCross Ref
- Yin Li, Junchi Yan, Yue Zhou, and Jie Yang. 2010. Optimum subspace learning and error correction for tensors. In Proceedings of Computer Vision--ECCV. Google ScholarDigital Library
- Yu-Ru Lin, Jimeng Sun, Paul Castro, Ravi Konuru, Hari Sundaram, and Aisling Kelliher. 2009. Metafac: Community discovery via relational hypergraph factorization. In Proceedings of KDD. Google ScholarDigital Library
- Zhouchen Lin, Minming Chen, and Yi Ma. 2010. The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices. arXiv:1009.5055.Google Scholar
- Ji Liu, Przemyslaw Musialski, Peter Wonka, and Jieping Ye. 2009. Tensor completion for estimating missing values in visual data. In Proceedings of ICCV.Google Scholar
- Ji Liu, Przemyslaw Musialski, Peter Wonka, and Jieping Ye. 2013. Tensor completion for estimating missing values in visual data. In Proceedings of TPAMI.Google ScholarDigital Library
- Yuanyuan Liu and Fanhua Shang. 2013. An efficient matrix factorization method for tensor completion. IEEE Signal Processing Letters 20,4 (2013), 307--310.Google ScholarCross Ref
- Yuanyuan Liu, Fanhua Shang, Hong Cheng, James Cheng, and Hanghang Tong. 2014. Factor matrix trace norm minimization for low-rank tensor completion. In Proceedings of ICDM.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- Yuanyuan Liu, Fanhua Shang, Licheng Jiao, James Cheng, and Hong Cheng. 2015. Trace norm regularized CANDECOMP/PARAFAC decomposition with missing data. IEEE Transactions on Cybernetics 45, 11 (2015), 2437--2448.Google ScholarCross Ref
- Haiping Lu, Konstantinos N. Plataniotis, and Anastasios N. Venetsanopoulos. 2011. A survey of multilinear subspace learning for tensor data. Pattern Recognition 44, 7 (2011), 1540--1551. Google ScholarDigital Library
- Xiang Ma, Dan Schonfeld, and Ashfaq Khokhar. 2009. Dynamic updating and downdating matrix SVD and tensor HOSVD for adaptive indexing and retrieval of motion trajectories. In Proceedings of ICASSP. Google ScholarDigital Library
- Morteza Mardani, Gonzalo Mateos, and Georgios B. Giannakis. 2014. Imputation of streaming low-rank tensor data. In Proceedings of IEEE SAM.Google Scholar
- 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.Google Scholar
- Yasuko Matsubara, Yasushi Sakurai, Christos Faloutsos, Tomoharu Iwata, and Masatoshi Yoshikawa. 2012. Fast mining and forecasting of complex time-stamped events. In Proceedings of KDD. Google ScholarDigital Library
- X. Meng, A. J. Morris, and E. B. Martin. 2003. On-line monitoring of batch processes using a PARAFAC representation. Journal of Chemometrics 17, 1 (2003), 65--81.Google ScholarCross Ref
- Bamdev Mishra and Rodolphe Sepulchre. 2014. R3MC: A Riemannian three-factor algorithm for low-rank matrix completion. In Proceedings of CDC.Google ScholarCross Ref
- Andrea Montanari and Nike Sun. 2018. Spectral algorithms for tensor completion. Communications on Pure and Applied Mathematics 71, 11 (2018), 2381--2425.Google ScholarCross Ref
- Cun Mu, Bo Huang, John Wright, and Donald Goldfarb. 2014. Square deal: Lower bounds and improved relaxations for tensor recovery. InProceedings of ICML. Google ScholarDigital Library
- Atsuhiro Narita, Kohei Hayashi, Ryota Tomioka, and Hisashi Kashima. 2011. Tensor factorization using auxiliary information. In Proceedings of ECML PKDD. Google ScholarDigital Library
- Nagarajan Natarajan and Inderjit S. Dhillon. 2014. Inductive matrix completion for predicting gene--disease associations. Bioinformatics 30, 12 (2014), i60--68.Google ScholarCross Ref
- Maximilian Nickel. [n. d.]. Scikit-tensor: Python library for multilinear algebra and tensor factorizations.Google Scholar
- Madhav Nimishakavi, Bamdev Mishra, Manish Gupta, and Partha Talukdar. 2018. Inductive framework for multi-aspect streaming tensor completion with side information. In Proceedings of the Conference on Information and Knowledge Management. Google ScholarDigital Library
- Dimitri Nion and Nicholas D. Sidiropoulos. 2009. Adaptive algorithms to track the PARAFAC decomposition of a third-order tensor. IEEE Transactions on Signal Processing 57, 6 (2009), 2299--2310. Google ScholarDigital Library
- Yasunori Nishimori and Shotaro Akaho. 2005. Learning algorithms utilizing quasi-geodesic flows on the Stiefel manifold. Neurocomputing 67 (2005), 106--135. Google ScholarDigital Library
- 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.Google Scholar
- Ivan V. Oseledets. 2011. Tensor-train decomposition. SIAM Journal on Scientific Computing 33, 5 (2011), 2295--2317. Google ScholarDigital Library
- Pentti Paatero. 1997. A weighted non-negative least squares algorithm for three-way ‘PARAFAC’ factor analysis. Chemometrics and Intelligent Laboratory Systems 38, 2 (1997), 223--242.Google ScholarCross Ref
- Evangelia Pantraki and Constantine Kotropoulos. 2015. Automatic image tagging and recommendation via PARAFAC2. In Proceedings IEEE 25th International Workshop on Machine Learning for Signal Processing (MLSP’15).Google ScholarCross Ref
- 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.Google Scholar
- 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’17).Google Scholar
- Jing Peng, Daniel Dajun Zeng, Huimin Zhao, and Fei-yue Wang. 2010. Collaborative filtering in social tagging systems based on joint item-tag recommendations. In Proceedings of ACM CIKM. Google ScholarDigital Library
- M. G. Peterson and D. M. Dunlavy. 2014. Tensor toolbox: Wrapping to PYTHON using SWIG. CCR.Google Scholar
- Anh Huy Phan and Andrzej Cichocki. 2011. PARAFAC algorithms for large-scale problems. Neurocomputing 74, 11 (2011), 1970--1984. Google ScholarDigital Library
- Ho N. Phien, Hoang D. Tuan, Johann A. Bengua, and Minh N. Do. 2016. Efficient tensor completion: Low-rank tensor train. arXiv:1601.01083.Google Scholar
- 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. Google ScholarDigital Library
- Holger Rauhut, Reinhold Schneider, and Željka Stojanac. 2015. Tensor completion in hierarchical tensor representations. In Compressed Sensing and its Applications. Birkhäuser Verlag.Google Scholar
- Holger Rauhut, Reinhold Schneider, and Željka Stojanac. 2017. Low rank tensor recovery via iterative hard thresholding. Linear Algebra and Its Applications 523 (2017), 220--262.Google ScholarCross Ref
- Holger Rauhut and Željka Stojanac. 2015. Tensor theta norms and low rank recovery. arXiv:1505.05175.Google Scholar
- Benjamin Recht. 2011. A simpler approach to matrix completion. Journal of Machine Learning Research 12, (2011), 3413--3430. Google ScholarDigital Library
- Benjamin Recht, Maryam Fazel, and Pablo A. Parrilo. 2010. Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Review 52, 3 (2010), 471--501. Google ScholarDigital Library
- Steffen Rendle. 2010. Factorization machines. In Proceedings of ICDM. Google ScholarDigital Library
- Steffen Rendle, Leandro Balby Marinho, Alexandros Nanopoulos, and Lars Schmidt-Thieme. 2009. Learning optimal ranking with tensor factorization for tag recommendation. In Proceedings of KDD. Google ScholarDigital Library
- Steffen Rendle and Lars Schmidt-Thieme. 2010. Pairwise interaction tensor factorization for personalized tag recommendation. In Proceedings of WSDM. Google ScholarDigital Library
- Bernardino Romera-Paredes and Massimiliano Pontil. 2013. A new convex relaxation for tensor completion. In Proceedings of NIPS. Google ScholarDigital Library
- Lee Sael, Inah Jeon, and U. Kang. 2015. Scalable tensor mining. Big Data Research 2, 2 (2015), 82--86. Google ScholarDigital Library
- Ruslan Salakhutdinov and Andriy Mnih. 2008. Bayesian probabilistic matrix factorization using Markov chain Monte Carlo. In Proceedings of ICML. Google ScholarDigital Library
- Kijung Shin, Lee Sael, and U. Kang. 2017. Fully scalable methods for distributed tensor factorization. IEEE Transactions on Knowledge and Data Engineering 29, 1 (2017), 100--113. Google ScholarDigital Library
- Si Si, Kai-Yang Chiang, Cho-Jui Hsieh, Nikhil Rao, and Inderjit S. Dhillon. 2016. Goal-directed inductive matrix completion. In Proceedings of SIGKDD. Google ScholarDigital Library
- Nicholas D. Sidiropoulos, Lieven De Lathauwer, Xiao Fu, Kejun Huang, Evangelos E. Papalexakis, and Christos Faloutsos. 2016. Tensor decomposition for signal processing and machine learning. IEEE Transactions on Signal Processing 65, 13 (2017), 3551--3582. Google ScholarDigital Library
- Nicholas D. Sidiropoulos and Anastasios Kyrillidis. 2012. Multi-way compressed sensing for sparse low-rank tensors. IEEE Signal Processing Letters 19, 11 (2012), 757--760.Google ScholarCross Ref
- 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.Google Scholar
- Marco Signoretto, Quoc Tran Dinh, Lieven De Lathauwer, and Johan A. K. Suykens. 2014. Learning with tensors: A framework based on convex optimization and spectral regularization. Machine Learning 94, 3 (2014), 303--351. Google ScholarDigital Library
- Marco Signoretto, Raf Van de Plas, Bart De Moor, and Johan A. K. Suykens. 2011. Tensor versus matrix completion: A comparison with application to spectral data. IEEE Signal Processing Letters 18, 7 (2011), 403--406.Google ScholarCross Ref
- Ajit P. Singh and Geoffrey J. Gordon. 2008. Relational learning via collective matrix factorization. KDD (2008). Google ScholarDigital Library
- Age Smilde, Rasmus Bro, and Paul Geladi. 2005. Multi-Way Analysis: Applications in the Chemical Sciences. John Wiley 8 Sons.Google Scholar
- Age K. Smilde, Johan A. Westerhuis, and Ricard Boque. 2000. Multiway multiblock component and covariates regression models. Journal of Chemometrics 14, 3 (2000), 301--331.Google ScholarCross Ref
- Shaden Smith, Alec Beri, and George Karypis. 2017. Constrained tensor factorization with accelerated AO-ADMM. In Proceedings of 46th International Conference on Parallel Processing (ICPP’17).Google ScholarCross Ref
- Shaden Smith and George Karypis. 2017. Accelerating the tucker decomposition with compressed sparse tensors. In Proceedings of European Conference on Parallel Processing.Google ScholarCross Ref
- Andrews Sobral, Christopher G. Baker, Thierry Bouwmans, and El-hadi Zahzah. 2014. Incremental and multi-feature tensor subspace learning applied for background modeling and subtraction. In Proceedings of ICIAR.Google ScholarDigital Library
- Victor Solo and Xuan Kong. 1994. Adaptive Signal Processing Algorithms: Stability and Performance. Prentice-Hall, Inc. Google ScholarDigital Library
- Qingquan Song, Xiao Huang, Hancheng Ge, James Caverlee, and Xia Hu. 2017. Multi-aspect streaming tensor completion. In Proceedings of KDD. Google ScholarDigital Library
- Nathan Srebro and Adi Shraibman. 2005. Rank, trace-norm and max-norm. In Proceedings of International Conference on Computational Learning Theory. Google ScholarDigital Library
- Xiaoyuan Su and Taghi M. Khoshgoftaar. 2009. A survey of collaborative filtering techniques. Advances in Artificial Intelligence 2009 (2009), Article 4. Google ScholarDigital Library
- Jimeng Sun, Dacheng Tao, and Christos Faloutsos. 2006. Beyond streams and graphs: Dynamic tensor analysis. In Proceedings of KDD. Google ScholarDigital Library
- Jimeng Sun, Dacheng Tao, Spiros Papadimitriou, Philip S. Yu, and Christos Faloutsos. 2008. Incremental tensor analysis: Theory and applications. In Proceedings of TKDD.Google ScholarDigital Library
- Panagiotis Symeonidis. 2016. Matrix and tensor decomposition in recommender systems. In Proceedings of the 10th ACM Conference on Recommender Systems. Google ScholarDigital Library
- Panagiotis Symeonidis, Alexandros Nanopoulos, and Yannis Manolopoulos. 2008. Tag recommendations based on tensor dimensionality reduction. In Proceedings RecSys. Google ScholarDigital Library
- Koh Takeuchi and Naonori Ueda. 2016. Graph regularized non-negative tensor completion for spatio-temporal data analysis. In Proceedings of the 2nd International Workshop on Smart. Google ScholarDigital Library
- Huachun Tan, Bin Cheng, Jianshuai Feng, Guangdong Feng, Wuhong Wang, and Yu-Jin Zhang. 2013. Low-n-rank tensor recovery based on multi-linear augmented Lagrange multiplier method. Neurocomputing 119 (2013), 144--152. Google ScholarDigital Library
- Huachun Tan, Bin Cheng, Wuhong Wang, Yu-Jin Zhang, and Bin Ran. 2014. Tensor completion via a multi-linear low-n-rank factorization model. Neurocomputing 133 (2014), 161--169. Google ScholarDigital Library
- 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.Google Scholar
- Huachun Tan, Yuankai Wu, Guangdong Feng, Wuhong Wang, and Bin Ran. 2013. A new traffic prediction method based on dynamic tensor completion. Procedia-Social and Behavioral Sciences 96 (2013), 2431--2442.Google ScholarCross Ref
- Jinhui Tang, Xiangbo Shu, Guo-Jun Qi, Zechao Li, Meng Wang, Shuicheng Yan, and Ramesh Jain. 2017. Tri-clustered tensor completion for social-aware image tag refinement. IEEE Transactions on Pattern Analysis and Machine Intelligence 39, 8 (2017), 1662--1674.Google ScholarDigital Library
- Giorgio Tomasi and Rasmus Bro. 2005. PARAFAC and missing values. Chemometrics and Intelligent Laboratory Systems 75, 2 (2005), 163--180.Google ScholarCross Ref
- Ryota Tomioka, Kohei Hayashi, and Hisashi Kashima. 2010. Estimation of low-rank tensors via convex optimization. arXiv:1010.0789.Google Scholar
- Ryota Tomioka, Taiji Suzuki, Kohei Hayashi, and Hisashi Kashima. 2011. Statistical performance of convex tensor decomposition. In Proceedings of NIPS. Google ScholarDigital Library
- Joel A. Tropp and Anna C. Gilbert. 2007. Signal recovery from random measurements via orthogonal matching pursuit. IEEE Transactions on Information Theory 53, 12 (2007), 4655--4666. Google ScholarDigital Library
- Ledyard R. Tucker. 1966. Some mathematical notes on three-mode factor analysis. Psychometrika 31, 3 (1966), 279--311.Google ScholarCross Ref
- M. Vasilescu and Demetri Terzopoulos. 2002. Multilinear analysis of image ensembles: TensorFaces. In Proceedings of the 7th European Conference on Computer Vision-Part I (ECCV’02). Google ScholarDigital Library
- Nico Vervliet, Otto Debals, and Lieven De Lathauwer. 2017. Canonical Polyadic Decomposition of Incomplete Tensors with Linearly Constrained Factors. Technical Report. Technical Report 16--172, ESAT--STADIUS, KU Leuven, Belgium.Google Scholar
- B. Walczak and D. L. Massart. 2001. Dealing with missing data: Part I. Chemometrics and Intelligent Laboratory Systems 58, 1 (2001), 15--27.Google ScholarCross Ref
- Hua Wang, Feiping Nie, and Heng Huang. 2014. Low-rank tensor completion with spatio-temporal consistency. In Proceedings of AAAI. Google ScholarDigital Library
- Yichen Wang, Robert Chen, Joydeep Ghosh, Joshua C. Denny, Abel Kho, You Chen, Bradley A. Malin, and Jimeng Sun. 2015. Rubik: Knowledge guided tensor factorization and completion for health data analytics. In Proceedings of KDD. Google ScholarDigital Library
- Yilun Wang, Yu Zheng, and Yexiang Xue. 2014. Travel time estimation of a path using sparse trajectories. In Proceedings of KDD. Google ScholarDigital Library
- Kishan Wimalawarne, Makoto Yamada, and Hiroshi Mamitsuka. 2017. Convex coupled matrix and tensor completion. arXiv:1705.05197.Google Scholar
- Dong Xia and Ming Yuan. 2017. On polynomial time methods for exact low rank tensor completion. Foundations of Computational Mathematics (2017), to be appear.Google Scholar
- 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.Google Scholar
- Biao Xiong, Qiegen Liu, Jiaojiao Xiong, Sanqian Li, Shanshan Wang, and Dong Liang. 2018. Field-of-experts filters guided tensor completion. IEEE Transactions on Multimedia 20, 9 (2018), 2316--2329. Google ScholarDigital Library
- 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.Google Scholar
- Yangyang Xu, Ruru Hao, Wotao Yin, and Zhixun Su. 2013. Parallel matrix factorization for low-rank tensor completion. arXiv:1312.1254.Google Scholar
- Yangyang Xu and Wotao Yin. 2013. A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion. SIAM Journal on Imaging Sciences 6, 3 (2013), 1758--1789.Google ScholarDigital Library
- Yangyang Xu, Wotao Yin, Zaiwen Wen, and Yin Zhang. 2012. An alternating direction algorithm for matrix completion with nonnegative factors. Frontiers of Mathematics in China 7, 2 (2012), 365--384.Google ScholarCross Ref
- Yuning Yang, Yunlong Feng, and Johan AK Suykens. 2015. A rank-one tensor updating algorithm for tensor completion. IEEE Signal Processing Letters 22, 10 (2015), 1633--1637.Google ScholarCross Ref
- Kenan Y. Yılmaz, Ali T. Cemgil, and Umut Simsekli. 2011. Generalised coupled tensor factorisation. In Proceedings of NIPS. Google ScholarDigital Library
- Shen Yin and Okyay Kaynak. 2015. Big data for modern industry: Challenges and trends [point of view]. Proc. IEEE 103, 2 (2015), 143--146.Google ScholarCross Ref
- Jiaxi Ying, Hengfa Lu, Qingtao Wei, Jian-Feng Cai, Di Guo, Jihui Wu, Zhong Chen, and Xiaobo Qu. 2017. Hankel matrix nuclear norm regularized tensor completion for N-dimensional exponential signals. IEEE Transactions on Signal Processing 65, 14 (2017), 3702--3717. Google ScholarDigital Library
- Tatsuya Yokota, Burak Erem, Seyhmus Guler, Simon K. Warfield, and Hidekata Hontani. 2018. Missing slice recovery for tensors using a low-rank model in embedded space. In Proceedings of CVPR.Google ScholarCross Ref
- Tatsuya Yokota and Hidekata Hontani. 2017. Simultaneous visual data completion and denoising based on tensor rank and total variation minimization and its primal-dual splitting algorithm. In Proceedings of CVPR.Google ScholarCross Ref
- Tatsuya Yokota and Hidekata Hontani. 2018. Simultaneous tensor completion and denoising by noise inequality constrained convex optimization. arXiv:1801.03299.Google Scholar
- Tatsuya Yokota, Qibin Zhao, and Andrzej Cichocki. 2016. Smooth PARAFAC decomposition for tensor completion. IEEE Transactions on Signal Processing 64, 20 (2016), 5423--5436.Google ScholarCross Ref
- Ji Oh Yoo, Arvind Ramanathan, and Christopher J. Langmead. 2010. Pytensor: A Python Based Tensor Library. Technical Report. Technical Report CMU-CS-10-102, Carnegie Mellon University.Google Scholar
- Hsiang-Fu Yu, Cho-Jui Hsieh, Si Si, and Inderjit Dhillon. 2012. Scalable coordinate descent approaches to parallel matrix factorization for recommender systems. In Proceedings of the 12th International Conference on Data Mining (ICDM’12). IEEE, 765--774. Google ScholarDigital Library
- Rose Yu, Dehua Cheng, and Yan Liu. 2015. Accelerated online low-rank tensor learning for multivariate spatio-temporal streams. In Proceedings of ICML. Google ScholarDigital Library
- 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.Google Scholar
- Ming Yuan and Cun-Hui Zhang. 2017. Incoherent tensor norms and their applications in higher order tensor completion. IEEE Transactions on Information Theory 63, 10 (2017), 6753--6766.Google ScholarCross Ref
- Ming Yuan and Cun-Hui Zhang. 2016. On tensor completion via nuclear norm minimization. Foundations of Computational Mathematics 16, 4 (2016), 1031--1068. Google ScholarDigital Library
- Reza Zafarani, Mohammad Ali Abbasi, and Huan Liu. 2014. Social Media Mining: An Introduction. Cambridge University Press. Google ScholarDigital Library
- Zemin Zhang and Shuchin Aeron. 2017. Exact tensor completion using t-SVD. IEEE Transactions on Signal Processing 65, 6 (2017), 1511--1526. Google ScholarDigital Library
- Zemin Zhang, Gregory Ely, Shuchin Aeron, Ning Hao, and Misha Kilmer. 2014. Novel methods for multilinear data completion and de-noising based on tensor-SVD. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. Google ScholarDigital Library
- Longhao Yuan Zhao, Jianting Cao, et al. 2018. High-dimension tensor completion via gradient-based optimization under tensor-train format. arXiv:1804.01983.Google Scholar
- Qibin Zhao, Liqing Zhang, and Andrzej Cichocki. 2015. Bayesian CP factorization of incomplete tensors with automatic rank determination. IEEE Transactions on Pattern Analysis and Machine Intelligence 37, 9 (2015), 1751--1763.Google ScholarDigital Library
- Qibin Zhao, Liqing Zhang, and Andrzej Cichocki. 2015. Bayesian sparse tucker models for dimension reduction and tensor completion. arXiv:1505.02343.Google Scholar
- Qibin Zhao, Guoxu Zhou, Liqing Zhang, Andrzej Cichocki, and Shun-ichi Amari. 2016. Robust Bayesian tensor factorization for incomplete multiway data. IEEE Transactions on Neural Networks and Learning Systems 27, 4 (2016), 736--748.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- Shuo Zhou, Nguyen Xuan Vinh, James Bailey, Yunzhe Jia, and Ian Davidson. 2016. Accelerating online CP decompositions for higher order tensors. In Proceedings of KDD. Google ScholarDigital Library
- Tengfei Zhou, Hui Qian, Zebang Shen, Chao Zhang, and Congfu Xu. 2017. Tensor completion with side information: A riemannian manifold approach. In Proceedings of IJCAI. Google ScholarDigital Library
- Yunhong Zhou, Dennis Wilkinson, Robert Schreiber, and Rong Pan. 2008. Large-scale parallel collaborative filtering for the netflix prize. In International Conference on Algorithmic Applications in Management. Springer, 337--348. Google ScholarDigital Library
- Martin Zinkevich, Markus Weimer, Lihong Li, and Alex J. Smola. 2010. Parallelized stochastic gradient descent. In Proceedings of NIPS. Google ScholarDigital Library
Index Terms
- Tensor Completion Algorithms in Big Data Analytics
Recommendations
Unifying tensor factorization and tensor nuclear norm approaches for low-rank tensor completion
AbstractLow-rank tensor completion (LRTC) has gained significant attention due to its powerful capability of recovering missing entries. However, it has to repeatedly calculate the time-consuming singular value decomposition (SVD). To address ...
Tensor Factorization with Total Variation and Tikhonov Regularization for Low-Rank Tensor Completion in Imaging Data
AbstractThe main aim of this paper is to study tensor factorization for low-rank tensor completion in imaging data. Due to the underlying redundancy of real-world imaging data, the low-tubal-rank tensor factorization (the tensor–tensor product of two ...
A general multi-factor norm based low-rank tensor completion framework
AbstractLow-rank tensor completion aims to recover the missing entries of the tensor from its partially observed data by using the low-rank property of the tensor. Since rank minimization is an NP-hard problem, the convex surrogate nuclear norm is usually ...
Comments