Multilayer tensor factorization with applications to recommender systems

@article{Bi2017MultilayerTF,
  title={Multilayer tensor factorization with applications to recommender systems},
  author={Xuan Bi and A. Qu and Xiaotong Shen},
  journal={arXiv: Machine Learning},
  year={2017}
}
Recommender systems have been widely adopted by electronic commerce and entertainment industries for individualized prediction and recommendation, which benefit consumers and improve business intelligence. In this article, we propose an innovative method, namely the recommendation engine of multilayers (REM), for tensor recommender systems. The proposed method utilizes the structure of a tensor response to integrate information from multiple modes, and creates an additional layer of nested… Expand
Dynamic Tensor Recommender Systems
TLDR
This article proposes a new recommendation method, namely the dynamic tensor recommender system (DTRS), which aims particularly at forecasting future recommendation and outperforms existing methods in terms of future time forecasting. Expand
Improving Sales Forecasting Accuracy: A Tensor Factorization Approach with Demand Awareness
TLDR
This work proposes a novel approach called the Advanced Temporal Latent-factor Approach to Sales forecasting (ATLAS), which achieves accurate and individualized prediction for sales by building a single tensor-factorization model across multiple stores and products. Expand
A Low-Rank Tensor Factorization Using Implicit Similarity in Trust Relationships
TLDR
A recommendation model that comprehensively considers local information and global information is proposed, combining the similarity between trust users and low-rank tensor factorization, and the conjugate gradient (CG) optimization algorithm for the model is designed. Expand
Regularized and Smooth Double Core Tensor Factorization for Heterogeneous Data
TLDR
A general tensor model suitable for data analytic tasks for heterogeneous data sets, wherein there are joint low-rank structures within groups of observations, but also discriminative structures across different groups, is introduced together with a family of smoothing loss functions. Expand
Dynamic Tensor Clustering
TLDR
A new dynamic Tensor clustering method that works for a general-order dynamic tensor, and enjoys both strong statistical guarantee and high computational efficiency is proposed. Expand
Low-rank Tensor Bandits
TLDR
This work introduces stochastic low-rank tensor bandits, a class of bandits whose mean rewards can be represented as a low- rank tensor, and proposes two learning algorithms, tensor epoch-greedy and tensor elimination, and develops finite-time regret bounds for them. Expand
Covariate-assisted Sparse Tensor Completion
TLDR
Covariate-assisted Sparse Tensor Completion (COSTCO) is proposed to incorporate covariate information for the recovery of the sparse tensor to jointly extract latent components from both the tensor and the covariate matrix to learn a synthetic representation. Expand
Partially Observed Dynamic Tensor Response Regression
TLDR
This article develops a regression model with partially observed dynamic tensor as the response and external covariates as the predictor, and introduces the low-rank, sparsity and fusion structures on the regression coefficient tensor, and considers a loss function projected over the observed entries. Expand
Your Preference or Mine? A Randomized Field Experiment on Recommender Systems in Two-sided Matching Markets
TLDR
It is found that while all three recommendations lead to an increase in message initiation, users choose candidates differently when recommendations include candidates’ preferences, and such differences in candidate selection within recommender systems do not spill over to selection in searching where preference information is not provided. Expand
Provable Convex Co-clustering of Tensors
TLDR
A provable convex formulation of tensor co-clustering is developed and a non-asymptotic error bound is established for the CoCo estimator, which reveals a surprising “blessing of dimensionality” phenomenon that does not exist in vector or matrix-variate cluster analysis. Expand
...
1
2
3
4
...

References

SHOWING 1-10 OF 56 REFERENCES
A Group-Specific Recommender System
TLDR
A group-specific method to use dependency information from users and items which share similar characteristics under the singular value decomposition framework is proposed, which improves prediction accuracy significantly compared to existing competitive recommender system approaches. Expand
Multiverse recommendation: n-dimensional tensor factorization for context-aware collaborative filtering
TLDR
This work introduces a Collaborative Filtering method based on Tensor Factorization, a generalization of Matrix Factorization that allows for a flexible and generic integration of contextual information by modeling the data as a User-Item-Context N-dimensional tensor instead of the traditional 2D User- Item matrix. Expand
Personalized Prediction and Sparsity Pursuit in Latent Factor Models
TLDR
This work factorizes a user-over-item preference matrix into a product of two matrices, each representing a user’s preference and an item preference by users, and proposes a likelihood method to seek a sparsest latent factorization, from a class of overcomplete factorizations, possibly with a high percentage of missing values. Expand
Fast context-aware recommendations with factorization machines
TLDR
This work proposes to apply Factorization Machines (FMs) to model contextual information and to provide context-aware rating predictions and shows empirically that this approach outperforms Multiverse Recommendation in prediction quality and runtime. Expand
Collaborative Filtering beyond the User-Item Matrix
TLDR
A comprehensive introduction to a large body of research, more than 200 key references, is provided, with the aim of supporting the further development of recommender systems exploiting information beyond the U-I matrix. Expand
Gaussian process factorization machines for context-aware recommendations
TLDR
This work develops a novel and powerful non-linear probabilistic algorithm using Gaussian processes which outperforms state-of-the-art context-aware recommendation methods and derives stochastic gradient descent optimization to allow scalability of the model. Expand
Factorization Machines with libFM
Factorization approaches provide high accuracy in several important prediction problems, for example, recommender systems. However, applying factorization approaches to a new prediction problem is aExpand
Context-aware recommender systems
TLDR
This chapter argues that relevant contextual information does matter in recommender systems and that it is important to take this information into account when providing recommendations, and introduces three different algorithmic paradigms for incorporating contextual information into the recommendation process. Expand
Context-Aware Recommender Systems for Learning: A Survey and Future Challenges
TLDR
A context framework that identifies relevant context dimensions for TEL applications is presented and an analysis of existing TEL recommender systems along these dimensions is presented, and topics on which further research is needed are outlined. Expand
Content-boosted matrix factorization techniques for recommender systems
TLDR
This work studies different ways to incorporate content information directly into the matrix factorization approach of collaborative filtering to improve recommendation accuracy and provide useful insights about the contents, as well as make recommendations more easily interpretable. Expand
...
1
2
3
4
5
...