Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Tensor Completion Algorithms in Big Data Analytics

Tensor Completion Algorithms in Big Data Analytics 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Knowledge Discovery from Data (TKDD) Association for Computing Machinery

Tensor Completion Algorithms in Big Data Analytics

Download PDF
48 pages

Loading next page...
 
/lp/association-for-computing-machinery/tensor-completion-algorithms-in-big-data-analytics-2ZSvbO0cGs

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 2019 ACM
ISSN
1556-4681
eISSN
1556-472X
DOI
10.1145/3278607
Publisher site
See Article on Publisher Site

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.

Journal

ACM Transactions on Knowledge Discovery from Data (TKDD) – Association for Computing Machinery

Published: Jan 9, 2019

Keywords: Tensor

References

  • Link prediction on evolving data using matrix and tensor factorizations
    Acar, Evrim; Dunlavy, Daniel M.; Kolda, Tamara G.
  • Scalable tensor factorizations for incomplete data
    Acar, Evrim; Dunlavy, Daniel M.; Kolda, Tamara G.; Mørup, Morten
  • All-at-once optimization for coupled matrix and tensor factorizations
    Acar, Evrim; Kolda, Tamara G.; Dunlavy, Daniel M.
  • Unsupervised multiway data analysis: A literature survey
    Acar, Evrim; Yener, Bülent
  • Improving the speed of multi-way algorithms:: Part I
    Andersson, Claus A.; Bro, Rasmus
  • The N-way toolbox for MATLAB
    Andersson, Claus A.; Bro, Rasmus
  • Strategies for analyzing data from video fluorometric monitoring of liquid chromatographic effluents
    Appellof, Carl J.; Davidson, E. R.
  • Fundamental conditions for low-CP-rank tensor completion
    Ashraphijuo, Morteza; Wang, Xiaodong
  • Algorithm 862: MATLAB tensor classes for fast algorithm prototyping
    Bader, Brett W.; Kolda, Tamara G.
  • Matlab tensor toolbox version 2
    Bader, Brett W.; Kolda, Tamara G.
  • Fast multivariate spatio-temporal analysis via low rank tensor learning
    Bahadori, Mohammad Taha; Yu, Qi Rose; Liu, Yan
  • Multi-way clustering on relation graphs
    Banerjee, Arindam; Basu, Sugato; Merugu, Srujana
  • Tensor prediction, rademacher complexity and random 3-xor
    Barak, Boaz; Moitra, Ankur
  • Noisy tensor completion via the sum-of-squares hierarchy
    Barak, Boaz; Moitra, Ankur
  • Rank regularization and Bayesian inference for tensor completion and extrapolation
    Bazerque, Juan Andrés; Mateos, Gonzalo; Giannakis, Georgios B.
  • Flexifact: Scalable flexible factorization of coupled tensors on hadoop
    Beutel, Alex; Talukdar, Partha Pratim; Kumar, Abhimanu; Faloutsos, Christos; Papalexakis, Evangelos E.; Xing, Eric P.
  • Gartner Says Solving ‘Big data’ Challenge Involves More Than Just Managing Volumes of Data
    Beyer, Mark
  • A new sampling technique for tensors
    Bhojanapalli, Srinadh; Sanghavi, Sujay
  • PARAFAC
    Bro, Rasmus
  • Multi-way analysis in the food industry: Models, algorithms, and applications
    Bro, Rasmus
  • Graph regularized nonnegative matrix factorization for data representation
    Cai, Deng; He, Xiaofei; Han, Jiawei; Huang, Thomas S.
  • A singular value thresholding algorithm for matrix completion
    Cai, Jian-Feng; Candès, Emmanuel J.; Shen, Zuowei
  • Block sparse representations of tensors using Kronecker bases
    Caiafa, Cesar F.; Cichocki, Andrzej
  • Computing sparse representations of multidimensional signals using kronecker bases
    Caiafa, Cesar F.; Cichocki, Andrzej
  • Stable, robust, and super fast reconstruction of tensors using multi-way projections
    Caiafa, Cesar F.; Cichocki, Andrzej
  • Exact matrix completion via convex optimization
    Candes, Emmanuel; Recht, Benjamin
  • Robust principal component analysis?Journal of the ACM 58, 3 (2011), Article 11
    Candès, Emmanuel J.; Li, Xiaodong; Ma, Yi; Wright, John
  • Matrix completion with noise
    Candes, Emmanuel J.; Plan, Yaniv
  • Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information
    Candès, Emmanuel J.; Romberg, Justin; Tao, Terence
  • Analysis of individual differences in multidimensional scaling via an N-way generalization of “Eckart-Young” decomposition
    Carroll, J. Douglas; Chang, Jih-Jie
  • CANDELINC: A general approach to multidimensional analysis of many-way arrays with linear constraints on parameters
    Carroll, J. Douglas; Pruzansky, Sandra; Kruskal, Joseph B.
  • Holt-Winters forecasting: Some practical issues
    Chatfield, Chris; Yar, Mohammad
  • Simultaneous tensor decomposition and completion using factor priors
    Chen, Yi-Lei; Hsu, Chiou-Ting; Liao, Hong-Yuan Mark
  • Scalable and sound low-rank tensor learning
    Cheng, Hao; Yu, Yaoliang; Zhang, Xinhua; Xing, Eric; Schuurmans, Dale
  • DFacTo: Distributed factorization of tensors
    Choi, Joon Hee; Vishwanathan, S.
  • Probabilistic models for incomplete multi-dimensional arrays
    Chu, Wei; Ghahramani, Zoubin
  • Nonnegative Matrix and Tensor Factorizations: Applications to Exploratory Multi-Way Data Analysis and Blind Source Separation
    Cichocki, Andrzej; Zdunek, Rafal; Phan, Anh Huy; Amari, Shun-ichi
  • Canonical tensor decompositions
    Comon, Pierre
  • Hierarchical tucker tensor optimization-applications to tensor completion
    Silva, Curt Da; Herrmann, Felix J.
  • Optimization on the hierarchical tucker manifold--applications to tensor completion
    Da, Curt; Herrmann, Felix J.
  • Handling missing data in medical questionnaires using tensor decompositions
    Dauwels, Justin; Garg, Lalit; Earnest, Arul; Pang, Leong Khai
  • A multilinear singular value decomposition
    De Lathauwer, Lieven; De Moor, Bart; Vandewalle, Joos
  • On the best rank-1 and rank-(r 1, r 2,…, rn) approximation of higher-order tensors
    De Lathauwer, Lieven; De Moor, Bart; Vandewalle, Joos
  • Generalized nonnegative matrix approximations with Bregman divergences
    Dhillon, Inderjit S.; Sra, Suvrit
  • Compressed sensing
    Donoho, David L.
  • Kronecker compressive sensing
    Duarte, Marco F.; Baraniuk, Richard G.
  • Temporal link prediction using matrix and tensor factorizations
    Dunlavy, Daniel M.; Kolda, Tamara G.; Acar, Evrim
  • On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operators
    Eckstein, Jonathan; Bertsekas, Dimitri P.
  • Compressed Sensing: Theory and Applications
    Eldar, Yonina C.; Kutyniok, Gitta
  • Uniqueness conditions for low-rank matrix recovery
    Eldar, Yonina C.; Needell, Deanna; Plan, Yaniv
  • Link prediction via generalized coupled tensor factorisation
    Ermiş, Beyza; Acar, Evrim; Cemgil, A. Taylan
  • Link prediction in heterogeneous data via generalized coupled tensor factorization
    Ermiş, Beyza; Acar, Evrim; Cemgil, A. Taylan
  • Recent developments in CANDECOMP/PARAFAC algorithms: A critical review
    Faber, Nicolaas Klaas M.; Bro, Rasmus; Hopke, Philip K.
  • Multi-aspect-streaming tensor analysis
    Fanaee-T., Hadi; Gama, João
  • Online robust PCA via stochastic optimization
    Feng, Jiashi; Xu, Huan; Yan, Shuicheng
  • Tucker factorization with missing data with application to low-n-rank tensor completion
    Filipović, Marko; Jukić, Ante
  • Information limits on neural identification of colored surfaces in natural scenes
    Foster, David H.; Nascimento, Sérgio M. C.; Amano, Kinjiro
  • Compressive sensing of sparse tensors
    Friedland, Shmuel; Li, Qun; Schonfeld, Dan
  • Tensor completion and low-n-rank tensor recovery via convex optimization
    Gandy, Silvia; Recht, Benjamin; Yamada, Isao
  • Taper: A contextual tensor-based approach for personalized expert recommendation
    Ge, Hancheng; Caverlee, James; Lu, Haokai
  • Uncovering the spatio-temporal dynamics of memes in the presence of incomplete information
    Ge, Hancheng; Caverlee, James; Zhang, Nan; Squicciarini, Anna
  • DisTenC: A distributed algorithm for scalable tensor completion on spark
    Ge, Hancheng; Zhang, Kai; Alfifi, Majid; Hu, Xia; Caverlee, James
  • Large-scale matrix factorization with distributed stochastic gradient descent
    Gemulla, Rainer; Nijkamp, Erik; Haas, Peter J.; Sismanis, Yannis
  • Facial age estimation by multilinear subspace analysis
    Geng, Xin; Smith-Miles, Kate
  • Face image modeling by multilinear subspace analysis with missing values
    Geng, Xin; Smith-Miles, Kate; Zhou, Zhi-Hua; Wang, Liang
  • Near-optimal sample complexity for convex tensor completion
    Ghadermarzy, Navid; Plan, Yaniv; Yılmaz, Özgür
  • Robust low-rank tensor recovery: Models and algorithms
    Goldfarb, Donald; Qin, Zhiwei
  • Alternating least squares tensor completion in the TT-format
    Grasedyck, Lars; Kluge, Melanie; Krämer, Sebastian
  • A literature survey of low-rank tensor approximation techniques
    Grasedyck, Lars; Kressner, Daniel; Tobler, Christine
  • Recovering low-rank matrices from few coefficients in any basis
    Gross, David
  • Efficient sparse low-rank tensor completion using the frank-wolfe algorithm
    Guo, Xiawei; Yao, Quanming; Kwok, James Tin-Yau
  • Tensor Spaces and Numerical Tensor Calculus
    Hackbusch, Wolfgang
  • Conditional gradient algorithms for norm-regularized smooth convex optimization
    Harchaoui, Zaid; Juditsky, Anatoli; Nemirovski, Arkadi
  • Foundations of the PARAFAC Procedure: Models and Conditions for an “Explanatory” Multi-Modal Factor Analysis
    Harshman, Richard A.
  • Tensor rank is NP-complete
    Håstad, Johan
  • N-way principal component analysis theory, algorithms and applications
    Henrion, René
  • Simple tensor products
    Hernandez, David
  • Multiple invariants and generalized rank of a p-way matrix or tensor
    Hitchcock, Frank L.
  • The expression of a tensor or a polyadic as a sum of products
    Hitchcock, Frank L.
  • Limestone: High-throughput candidate phenotype generation via tensor factorization
    Ho, Joyce C.; Ghosh, Joydeep; Steinhubl, Steve R.; Stewart, Walter F.; Denny, Joshua C.; Malin, Bradley A.; Sun, Jimeng
  • Incremental tensor subspace learning and its applications to foreground segmentation and tracking
    Hu, Weiming; Li, Xi; Zhang, Xiaoqin; Shi, Xinchu; Maybank, Stephen; Zhang, Zhongfei
  • Provable low-rank tensor recovery
    Huang, Bo; Mu, Cun; Goldfarb, Donald; Wright, John
  • Fast detection of overlapping communities via online tensor methods
    Huang, Furong; Niranjan, U. N.; Hakeem, M.; Anandkumar, Animashree
  • On tensor train rank minimization: Statistical efficiency and scalable algorithm
    Imaizumi, Masaaki; Maehara, Takanori; Hayashi, Kohei
  • Provable tensor factorization with missing data
    Jain, Prateek; Oh, Sewoong
  • Noisy tensor completion for tensors with a sparse canonical polyadic factor
    Jain, Swayambhoo; Gutierrez, Alexander; Haupt, Jarvis
  • Stochastic decomposition into low rank and sparse tensor for robust background subtraction
    Javed, Sajid; Bouwmans, Thierry; Jung, Soon Ki
  • Haten2: Billion-scale tensor decompositions
    Jeon, Inah; Papalexakis, Evangelos E.; Kang, U.; Faloutsos, Christos
  • Tensor completion using total variation and low-rank matrix factorization
    Ji, Teng-Yu; Huang, Ting-Zhu; Zhao, Xi-Le; Ma, Tian-Hui; Liu, Gang
  • Matrix completion problems: A survey
    Johnson, Charles R.
  • Gigatensor: Scaling tensor analysis up by 100 times-algorithms and discoveries
    Kang, U.; Papalexakis, Evangelos; Harpale, Abhay; Faloutsos, Christos
  • Multiverse recommendation: N-dimensional tensor factorization for context-aware collaborative filtering
    Karatzoglou, Alexandros; Amatriain, Xavier; Baltrunas, Linas; Oliver, Nuria
  • Parallel algorithms for tensor completion in the CP format
    Karlsson, Lars; Kressner, Daniel; Uschmajew, André
  • Online low-rank tensor subspace tracking from incomplete data by CP decomposition using recursive least squares
    Kasai, Hiroyuki
  • Riemannian preconditioning for tensor completion
    Kasai, Hiroyuki; Mishra, Bamdev
  • Low-rank tensor completion: A Riemannian manifold preconditioning approach
    Kasai, Hiroyuki; Mishra, Bamdev
  • Link propagation: A fast semi-supervised learning algorithm for link prediction
    Kashima, Hisashi; Kato, Tsuyoshi; Yamanishi, Yoshihiro; Sugiyama, Masashi; Tsuda, Koji
  • Parallel CP decomposition of sparse tensors using dimension trees
    Kaya, Oguz; Uçar, Bora
  • tensorBF: An R package for Bayesian tensor factorization
    Khan, Suleiman A.; Ammad-ud-din, Muhammad
  • Weighted least squares fitting using ordinary least squares algorithms
    Kiers, Henk A. L.
  • Towards a standardized notation and terminology in multiway analysis
    Kiers, Henk A. L.
  • Three-way component analysis: Principles and illustrative application
    Kiers, Henk A. L.; Van Mechelen, Iven
  • PARAFAC2-Part I
    Kiers, Henk A. L.; Berge, Jos M.F. Ten; Bro, Rasmus
  • Third-order tensors as operators on matrices: A theoretical and computational framework with applications in imaging
    Kilmer, Misha E.; Braman, Karen; Hao, Ning; Hoover, Randy C.
  • Mathematical Thought From Ancient to Modern Times: Volume 3
    Kline, Morris
  • Tensor decompositions and applications
    Kolda, Tamara G.; Bader, Brett W.
  • Scalable tensor decompositions for multi-aspect data mining
    Kolda, Tamara G.; Sun, Jimeng
  • Factorization meets the neighborhood: A multifaceted collaborative filtering model
    Koren, Yehuda
  • Matrix factorization techniques for recommender systems
    Koren, Yehuda; Bell, Robert; Volinsky, Chris
  • Low-rank tensor completion by riemannian optimization
    Kressner, Daniel; Steinlechner, Michael; Vandereycken, Bart
  • Low-rank matrix and tensor completion via adaptive sampling
    Krishnamurthy, Akshay; Singh, Aarti
  • Three-Mode Principal Component Analysis: Theory and Applications
    Kroonenberg, Pieter M.
  • Applied Multiway Data Analysis, Vol
    Kroonenberg, Pieter M.
  • Principal component analysis of three-mode data by means of alternating least squares algorithms
    Kroonenberg, Pieter M.; De Leeuw, Jan
  • Three-way arrays: Rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
    Kruskal, Joseph B.
  • Rank, decomposition, and uniqueness for 3-way and n-way arrays
    Kruskal, Joseph B.
  • Incorporating side information in tensor completion
    Lamba, Hemank; Nagarajan, Vaishnavh; Shin, Kijung; Shajarisales, Naji
  • Matrix completion problems
    Laurent, Monique
  • Introduction to Smooth Manifolds
    Lee, John
  • Spatio-temporal multiway decompositions using principal tensor analysis on k-modes: The R package PTAk
    Leibovici, Didier G.
  • Tools for Tensor Analysis and Decomposition
    Li, James; Bien, Jacob; Wells, Martin; Li, Maintainer James
  • Model-driven sparse CP decomposition for higher-order tensors
    Li, Jiajia; Choi, Jee; Perros, Ioakeim; Sun, Jimeng; Vuduc, Richard
  • Generalized tensor compressive sensing
    Li, Qun; Schonfeld, Dan; Friedland, Shmuel
  • Relation regularized matrix factorization
    Li, Wu-Jun; Yeung, Dit Yan
  • Compressive tensor sampling with structured sparsity
    Li, Yong; Dai, Wenrui; Xiong, Hongkai
  • Optimum subspace learning and error correction for tensors
    Li, Yin; Yan, Junchi; Zhou, Yue; Yang, Jie
  • Metafac: Community discovery via relational hypergraph factorization
    Lin, Yu-Ru; Sun, Jimeng; Castro, Paul; Konuru, Ravi; Sundaram, Hari; Kelliher, Aisling
  • The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices
    Lin, Zhouchen; Chen, Minming; Ma, Yi
  • Tensor completion for estimating missing values in visual data
    Liu, Ji; Musialski, Przemyslaw; Wonka, Peter; Ye, Jieping
  • Tensor completion for estimating missing values in visual data
    Liu, Ji; Musialski, Przemyslaw; Wonka, Peter; Ye, Jieping
  • An efficient matrix factorization method for tensor completion
    Liu, Yuanyuan; Shang, Fanhua
  • Factor matrix trace norm minimization for low-rank tensor completion
    Liu, Yuanyuan; Shang, Fanhua; Cheng, Hong; Cheng, James; Tong, Hanghang
  • Generalized higher-order orthogonal iteration for tensor decomposition and completion
    Liu, Yuanyuan; Shang, Fanhua; Fan, Wei; Cheng, James; Cheng, Hong
  • Trace norm regularized CANDECOMP/PARAFAC decomposition with missing data
    Liu, Yuanyuan; Shang, Fanhua; Jiao, Licheng; Cheng, James; Cheng, Hong
  • A survey of multilinear subspace learning for tensor data
    Lu, Haiping; Plataniotis, Konstantinos N.; Venetsanopoulos, Anastasios N.
  • Dynamic updating and downdating matrix SVD and tensor HOSVD for adaptive indexing and retrieval of motion trajectories
    Ma, Xiang; Schonfeld, Dan; Khokhar, Ashfaq
  • Imputation of streaming low-rank tensor data
    Mardani, Morteza; Mateos, Gonzalo; Giannakis, Georgios B.
  • Subspace learning and imputation for streaming big data matrices and tensors
    Mardani, Morteza; Mateos, Gonzalo; Giannakis, Georgios B.
  • Fast mining and forecasting of complex time-stamped events
    Matsubara, Yasuko; Sakurai, Yasushi; Faloutsos, Christos; Iwata, Tomoharu; Yoshikawa, Masatoshi
  • On-line monitoring of batch processes using a PARAFAC representation
    Meng, X.; Morris, A. J.; Martin, E. B.
  • R3MC: A Riemannian three-factor algorithm for low-rank matrix completion
    Mishra, Bamdev; Sepulchre, Rodolphe
  • Spectral algorithms for tensor completion
    Montanari, Andrea; Sun, Nike
  • Square deal: Lower bounds and improved relaxations for tensor recovery
    Mu, Cun; Huang, Bo; Wright, John; Goldfarb, Donald
  • Tensor factorization using auxiliary information
    Narita, Atsuhiro; Hayashi, Kohei; Tomioka, Ryota; Kashima, Hisashi
  • Inductive matrix completion for predicting gene--disease associations
    Natarajan, Nagarajan; Dhillon, Inderjit S.
  • [n
    Nickel, Maximilian
  • Inductive framework for multi-aspect streaming tensor completion with side information
    Nimishakavi, Madhav; Mishra, Bamdev; Gupta, Manish; Talukdar, Partha
  • Adaptive algorithms to track the PARAFAC decomposition of a third-order tensor
    Nion, Dimitri; Sidiropoulos, Nicholas D.
  • Learning algorithms utilizing quasi-geodesic flows on the Stiefel manifold
    Nishimori, Yasunori; Akaho, Shotaro
  • Scalable tucker factorization for sparse tensors-algorithms and discoveries
    Oh, Sejoon; Park, Namyong; Sael, Lee; Kang, U.
  • Tensor-train decomposition
    Oseledets, Ivan V.
  • A weighted non-negative least squares algorithm for three-way ‘PARAFAC’ factor analysis
    Paatero, Pentti
  • Automatic image tagging and recommendation via PARAFAC2
    Pantraki, Evangelia; Kotropoulos, Constantine
  • Tensors for data mining and data fusion: Models, applications, and scalable algorithms
    Papalexakis, Evangelos E.; Faloutsos, Christos; Sidiropoulos, Nicholas D.
  • A distributed proximal gradient descent method for tensor completion
    Papastergiou, T.; Megalooikonomou, V.
  • Collaborative filtering in social tagging systems based on joint item-tag recommendations
    Peng, Jing; Zeng, Daniel Dajun; Zhao, Huimin; Wang, Fei-yue
  • Tensor toolbox: Wrapping to PYTHON using SWIG
    Peterson, M. G.; Dunlavy, D. M.
  • PARAFAC algorithms for large-scale problems
    Phan, Anh Huy; Cichocki, Andrzej
  • Efficient tensor completion: Low-rank tensor train
    Phien, Ho N.; Tuan, Hoang D.; Bengua, Johann A.; Do, Minh N.
  • Scalable Bayesian low-rank decomposition of incomplete multiway tensors
    Rai, Piyush; Wang, Yingjian; Guo, Shengbo; Chen, Gary; Dunson, David; Carin, Lawrence
  • Tensor completion in hierarchical tensor representations
    Rauhut, Holger; Schneider, Reinhold; Stojanac, Željka
  • Low rank tensor recovery via iterative hard thresholding
    Rauhut, Holger; Schneider, Reinhold; Stojanac, Željka
  • Tensor theta norms and low rank recovery
    Rauhut, Holger; Stojanac, Željka
  • A simpler approach to matrix completion
    Recht, Benjamin
  • Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
    Recht, Benjamin; Fazel, Maryam; Parrilo, Pablo A.
  • Factorization machines
    Rendle, Steffen
  • Learning optimal ranking with tensor factorization for tag recommendation
    Rendle, Steffen; Marinho, Leandro Balby; Nanopoulos, Alexandros; Schmidt-Thieme, Lars
  • Pairwise interaction tensor factorization for personalized tag recommendation
    Rendle, Steffen; Schmidt-Thieme, Lars
  • A new convex relaxation for tensor completion
    Romera-Paredes, Bernardino; Pontil, Massimiliano
  • Scalable tensor mining
    Sael, Lee; Jeon, Inah; Kang, U.
  • Bayesian probabilistic matrix factorization using Markov chain Monte Carlo
    Salakhutdinov, Ruslan; Mnih, Andriy
  • Fully scalable methods for distributed tensor factorization
    Shin, Kijung; Sael, Lee; Kang, U.
  • Goal-directed inductive matrix completion
    Si, Si; Chiang, Kai-Yang; Hsieh, Cho-Jui; Rao, Nikhil; Dhillon, Inderjit S.
  • Tensor decomposition for signal processing and machine learning
    Sidiropoulos, Nicholas D.; De Lathauwer, Lieven; Fu, Xiao; Huang, Kejun; Papalexakis, Evangelos E.; Faloutsos, Christos
  • Multi-way compressed sensing for sparse low-rank tensors
    Sidiropoulos, Nicholas D.; Kyrillidis, Anastasios
  • Nuclear norms for tensors and their use for convex multilinear estimation
    Signoretto, Marco; De Lathauwer, Lieven; Suykens, Johan A. K.
  • Learning with tensors: A framework based on convex optimization and spectral regularization
    Signoretto, Marco; Dinh, Quoc Tran; De Lathauwer, Lieven; Suykens, Johan A. K.
  • Tensor versus matrix completion: A comparison with application to spectral data
    Signoretto, Marco; Van de Plas, Raf; De Moor, Bart; Suykens, Johan A. K.
  • Relational learning via collective matrix factorization
    Singh, Ajit P.; Gordon, Geoffrey J.
  • Multi-Way Analysis: Applications in the Chemical Sciences
    Smilde, Age; Bro, Rasmus; Geladi, Paul
  • Multiway multiblock component and covariates regression models
    Smilde, Age K.; Westerhuis, Johan A.; Boque, Ricard
  • Constrained tensor factorization with accelerated AO-ADMM
    Smith, Shaden; Beri, Alec; Karypis, George
  • Accelerating the tucker decomposition with compressed sparse tensors
    Smith, Shaden; Karypis, George
  • Incremental and multi-feature tensor subspace learning applied for background modeling and subtraction
    Sobral, Andrews; Baker, Christopher G.; Bouwmans, Thierry; Zahzah, El-hadi
  • Adaptive Signal Processing Algorithms: Stability and Performance
    Solo, Victor; Kong, Xuan
  • Multi-aspect streaming tensor completion
    Song, Qingquan; Huang, Xiao; Ge, Hancheng; Caverlee, James; Hu, Xia
  • Rank, trace-norm and max-norm
    Srebro, Nathan; Shraibman, Adi
  • A survey of collaborative filtering techniques
    Su, Xiaoyuan; Khoshgoftaar, Taghi M.
  • Beyond streams and graphs: Dynamic tensor analysis
    Sun, Jimeng; Tao, Dacheng; Faloutsos, Christos
  • Incremental tensor analysis: Theory and applications
    Sun, Jimeng; Tao, Dacheng; Papadimitriou, Spiros; Yu, Philip S.; Faloutsos, Christos
  • Matrix and tensor decomposition in recommender systems
    Symeonidis, Panagiotis
  • Tag recommendations based on tensor dimensionality reduction
    Symeonidis, Panagiotis; Nanopoulos, Alexandros; Manolopoulos, Yannis
  • Graph regularized non-negative tensor completion for spatio-temporal data analysis
    Takeuchi, Koh; Ueda, Naonori
  • Low-n-rank tensor recovery based on multi-linear augmented Lagrange multiplier method
    Tan, Huachun; Cheng, Bin; Feng, Jianshuai; Feng, Guangdong; Wang, Wuhong; Zhang, Yu-Jin
  • Tensor completion via a multi-linear low-n-rank factorization model
    Tan, Huachun; Cheng, Bin; Wang, Wuhong; Zhang, Yu-Jin; Ran, Bin
  • Traffic volume data outlier recovery via tensor model
    Tan, Huachun; Feng, Jianshuai; Feng, Guangdong; Wang, Wuhong; Zhang, Yu-Jin
  • A new traffic prediction method based on dynamic tensor completion
    Tan, Huachun; Wu, Yuankai; Feng, Guangdong; Wang, Wuhong; Ran, Bin
  • Tri-clustered tensor completion for social-aware image tag refinement
    Tang, Jinhui; Shu, Xiangbo; Qi, Guo-Jun; Li, Zechao; Wang, Meng; Yan, Shuicheng; Jain, Ramesh
  • PARAFAC and missing values
    Tomasi, Giorgio; Bro, Rasmus
  • Estimation of low-rank tensors via convex optimization
    Tomioka, Ryota; Hayashi, Kohei; Kashima, Hisashi
  • Statistical performance of convex tensor decomposition
    Tomioka, Ryota; Suzuki, Taiji; Hayashi, Kohei; Kashima, Hisashi
  • Signal recovery from random measurements via orthogonal matching pursuit
    Tropp, Joel A.; Gilbert, Anna C.
  • Some mathematical notes on three-mode factor analysis
    Tucker, Ledyard R.
  • Multilinear analysis of image ensembles: TensorFaces
    Vasilescu, M.; Terzopoulos, Demetri
  • Canonical Polyadic Decomposition of Incomplete Tensors with Linearly Constrained Factors
    Vervliet, Nico; Debals, Otto; De Lathauwer, Lieven
  • Dealing with missing data: Part I
    Walczak, B.; Massart, D. L.
  • Low-rank tensor completion with spatio-temporal consistency
    Wang, Hua; Nie, Feiping; Huang, Heng
  • Rubik: Knowledge guided tensor factorization and completion for health data analytics
    Wang, Yichen; Chen, Robert; Ghosh, Joydeep; Denny, Joshua C.; Kho, Abel; Chen, You; Malin, Bradley A.; Sun, Jimeng
  • Travel time estimation of a path using sparse trajectories
    Wang, Yilun; Zheng, Yu; Xue, Yexiang
  • Convex coupled matrix and tensor completion
    Wimalawarne, Kishan; Yamada, Makoto; Mamitsuka, Hiroshi
  • On polynomial time methods for exact low rank tensor completion
    Xia, Dong; Yuan, Ming
  • Believe it today or tomorrow? Detecting untrustworthy information from dynamic multi-source data
    Xiao, Houping; Li, Yaliang; Gao, Jing; Wang, Fei; Ge, Liang; Fan, Wei; Vu, Long H.; Turaga, Deepak S.
  • Field-of-experts filters guided tensor completion
    Xiong, Biao; Liu, Qiegen; Xiong, Jiaojiao; Li, Sanqian; Wang, Shanshan; Liang, Dong
  • Temporal collaborative filtering with bayesian probabilistic tensor factorization
    Xiong, Liang; Chen, Xi; Huang, Tzu-Kuo; Schneider, Jeff; Carbonell, Jaime G.
  • Parallel matrix factorization for low-rank tensor completion
    Xu, Yangyang; Hao, Ruru; Yin, Wotao; Su, Zhixun
  • A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
    Xu, Yangyang; Yin, Wotao
  • An alternating direction algorithm for matrix completion with nonnegative factors
    Xu, Yangyang; Yin, Wotao; Wen, Zaiwen; Zhang, Yin
  • A rank-one tensor updating algorithm for tensor completion
    Yang, Yuning; Feng, Yunlong; Suykens, Johan AK
  • Generalised coupled tensor factorisation
    Yılmaz, Kenan Y.; Cemgil, Ali T.; Simsekli, Umut
  • Big data for modern industry: Challenges and trends [point of view]
    Yin, Shen; Kaynak, Okyay
  • Hankel matrix nuclear norm regularized tensor completion for N-dimensional exponential signals
    Ying, Jiaxi; Lu, Hengfa; Wei, Qingtao; Cai, Jian-Feng; Guo, Di; Wu, Jihui; Chen, Zhong; Qu, Xiaobo
  • Missing slice recovery for tensors using a low-rank model in embedded space
    Yokota, Tatsuya; Erem, Burak; Guler, Seyhmus; Warfield, Simon K.; Hontani, Hidekata
  • Simultaneous visual data completion and denoising based on tensor rank and total variation minimization and its primal-dual splitting algorithm
    Yokota, Tatsuya; Hontani, Hidekata
  • Simultaneous tensor completion and denoising by noise inequality constrained convex optimization
    Yokota, Tatsuya; Hontani, Hidekata
  • Smooth PARAFAC decomposition for tensor completion
    Yokota, Tatsuya; Zhao, Qibin; Cichocki, Andrzej
  • Pytensor: A Python Based Tensor Library
    Yoo, Ji Oh; Ramanathan, Arvind; Langmead, Christopher J.
  • Scalable coordinate descent approaches to parallel matrix factorization for recommender systems
    Yu, Hsiang-Fu; Hsieh, Cho-Jui; Si, Si; Dhillon, Inderjit
  • Accelerated online low-rank tensor learning for multivariate spatio-temporal streams
    Yu, Rose; Cheng, Dehua; Liu, Yan
  • Rank minimization on tensor ring: A new paradigm in scalable tensor decomposition and completion
    Yuan, Longhao; Li, Chao; Mandic, Danilo; Cao, Jianting; Zhao, Qibin
  • Incoherent tensor norms and their applications in higher order tensor completion
    Yuan, Ming; Zhang, Cun-Hui
  • On tensor completion via nuclear norm minimization
    Yuan, Ming; Zhang, Cun-Hui
  • Social Media Mining: An Introduction
    Zafarani, Reza; Abbasi, Mohammad Ali; Liu, Huan
  • Exact tensor completion using t-SVD
    Zhang, Zemin; Aeron, Shuchin
  • Novel methods for multilinear data completion and de-noising based on tensor-SVD
    Zhang, Zemin; Ely, Gregory; Aeron, Shuchin; Hao, Ning; Kilmer, Misha
  • High-dimension tensor completion via gradient-based optimization under tensor-train format
    Zhao, Longhao Yuan; Cao, Jianting
  • Bayesian CP factorization of incomplete tensors with automatic rank determination
    Zhao, Qibin; Zhang, Liqing; Cichocki, Andrzej
  • Bayesian sparse tucker models for dimension reduction and tensor completion
    Zhao, Qibin; Zhang, Liqing; Cichocki, Andrzej
  • Robust Bayesian tensor factorization for incomplete multiway data
    Zhao, Qibin; Zhou, Guoxu; Zhang, Liqing; Cichocki, Andrzej; Amari, Shun-ichi
  • Collaborative filtering meets mobile recommendation: A user-centered approach
    Zheng, Vincent Wenchen; Cao, Bin; Zheng, Yu; Xie, Xing; Yang, Qiang
  • Accelerating online CP decompositions for higher order tensors
    Zhou, Shuo; Vinh, Nguyen Xuan; Bailey, James; Jia, Yunzhe; Davidson, Ian
  • Tensor completion with side information: A riemannian manifold approach
    Zhou, Tengfei; Qian, Hui; Shen, Zebang; Zhang, Chao; Xu, Congfu
  • Large-scale parallel collaborative filtering for the netflix prize
    Zhou, Yunhong; Wilkinson, Dennis; Schreiber, Robert; Pan, Rong
  • Parallelized stochastic gradient descent
    Zinkevich, Martin; Weimer, Markus; Li, Lihong; Smola, Alex J.