Factorization Meets the Item Embedding: Regularizing Matrix Factorization with Item Co-occurrence

@article{Liang2016FactorizationMT,
  title={Factorization Meets the Item Embedding: Regularizing Matrix Factorization with Item Co-occurrence},
  author={Dawen Liang and Jaan Altosaar and Laurent Charlin and David M. Blei},
  journal={Proceedings of the 10th ACM Conference on Recommender Systems},
  year={2016}
}
Matrix factorization (MF) models and their extensions are standard in modern recommender systems. [...] Key Method CoFactor is inspired by the recent success of word embedding models (e.g., word2vec) which can be interpreted as factorizing the word co-occurrence matrix. We show that this model significantly improves the performance over MF models on several datasets with little additional computational overhead. We provide qualitative results that explain how CoFactor improves the quality of the inferred…Expand
Exploiting user and item embedding in latent factor models for recommendations
TLDR
This paper proposes mixture models which combine the technology of MF and the embedding, and shows that some of these models significantly improve the performance over the state-of-the-art models on two real-world datasets. Expand
Boosting the Rating Prediction with Click Data and Textual Contents
TLDR
This paper develops TCMF (Textual Co Matrix Factorization) that learns the user and item representations jointly from the user-item matrix, textual contents and item co-click matrix built from click data. Expand
Co-Factorization Model for Collaborative Filtering with Session-based Data
TLDR
This work proposes a method for matrix factorization that can reflect the localized relationships between strong related items into the latent representations of items and is able to exploit item-item relations. Expand
Evaluating and improving the interpretability of item embeddings using item-tag relevance information
TLDR
This paper proposes a tag-informed item embedding (TIE) model that jointly factorizes the user-item interaction matrix, the item-item co-occurrence matrix and theitem-tag relevance matrix with shared item embeddings so that different forms of information can co-operate with each other to learn better item embeddeddings. Expand
Collaborative Item Embedding Model for Implicit Feedback Data
TLDR
This work proposes a method to extract the relationships between items and embed them into the latent vectors of the factorization model, which combines two worlds: matrix factorization for collaborative filtering and item embedding, a similar concept to word embedding in language processing. Expand
On the instability of embeddings for recommender systems: the case of matrix factorization
TLDR
A generalization of MF is presented, called Nearest Neighbors Matrix Factorization (NNMF), which propagates the information about items and users to their neighbors, speeding up the training procedure and extending the amount of information that supports recommendations and representations. Expand
Latent Factor Model with User and Fused Item Embeddings for Recommendation
  • Dahui Zhu, Jianxiong Tang, Qia Li
  • Computer Science
  • 2020 IEEE International Conference on Artificial Intelligence and Computer Applications (ICAICA)
  • 2020
TLDR
Different from the existing embedding based LFMs, the proposed model learns item latent representations from the combination of co-liked item co-occurrence matrix (LICM) and co-disliked itemCo-occurring matrix (DICM), which reduces the trainable parameters and brings a quick convergence. Expand
Embedding Factorization Models for Jointly Recommending Items and User Generated Lists
TLDR
Embedded factorization models are devised, which extend traditional factorization method by incorporating item-item (item-item-list) co-occurrence with embedding-based algorithms and are capable of solving the new-item cold-start problem, where items have been consumed by users but exist in user generated lists. Expand
Regularizing Matrix Factorization with User and Item Embeddings for Recommendation
TLDR
A novel Regularized Multi-Embedding (RME) based recommendation model that simultaneously encapsulates the following ideas via decomposition, which items a user likes, which two users co-like the same items, and which two items users often co-liked. Expand
A Probabilistic Model for the Cold-Start Problem in Rating Prediction Using Click Data
TLDR
A probabilistic item embedding model that learns item representations from click data, and a model named EMB-MF, that connects it with a Probabilistic matrix factorization for rating prediction, which outperforms competing methods, especially when the data is very sparse. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 28 REFERENCES
Hidden factors and hidden topics: understanding rating dimensions with review text
TLDR
This paper aims to combine latent rating dimensions (such as those of latent-factor recommender systems) with latent review topics ( such as those learned by topic models like LDA), which more accurately predicts product ratings by harnessing the information present in review text. Expand
Relational learning via collective matrix factorization
TLDR
This model generalizes several existing matrix factorization methods, and therefore yields new large-scale optimization algorithms for these problems, which can handle any pairwise relational schema and a wide variety of error models. Expand
Neural Word Embedding as Implicit Matrix Factorization
TLDR
It is shown that using a sparse Shifted Positive PMI word-context matrix to represent words improves results on two word similarity tasks and one of two analogy tasks, and conjecture that this stems from the weighted nature of SGNS's factorization. Expand
Factorization Machines
  • Steffen Rendle
  • Mathematics, Computer Science
  • 2010 IEEE International Conference on Data Mining
  • 2010
TLDR
Factorization Machines (FM) are introduced which are a new model class that combines the advantages of Support Vector Machines (SVM) with factorization models and can mimic these models just by specifying the input data (i.e. the feature vectors). Expand
Content-based recommendations with Poisson factorization
We develop collaborative topic Poisson factorization (CTPF), a generative model of articles and reader preferences. CTPF can be used to build recommender systems by learning from reader histories andExpand
Generalized Probabilistic Matrix Factorizations for Collaborative Filtering
TLDR
It is illustrated that simpler models directly capturing correlations among latent factors can outperform existing PMF models, side information can benefit prediction accuracy, and accounting for row/column biases leads to improvements in predictive performance. Expand
Latent Trajectory Modeling: A Light and Efficient Way to Introduce Time in Recommender Systems
TLDR
It is proposed to learn item and user representations such that any timely ordered sequence of items selected by a user will be represented as a trajectory of the user in a representation space to perform rating prediction using a classical matrix factorization scheme. Expand
Regression-based latent factor models
TLDR
A novel latent factor model to accurately predict response for large scale dyadic data in the presence of features is proposed and induces a stochastic process on the dyadic space with kernel given by a polynomial function of features. Expand
BPR: Bayesian Personalized Ranking from Implicit Feedback
TLDR
This paper presents a generic optimization criterion BPR-Opt for personalized ranking that is the maximum posterior estimator derived from a Bayesian analysis of the problem and provides a generic learning algorithm for optimizing models with respect to B PR-Opt. Expand
VBPR: Visual Bayesian Personalized Ranking from Implicit Feedback
TLDR
This paper proposes a scalable factorization model to incorporate visual signals into predictors of people's opinions, which is applied to a selection of large, real-world datasets and makes use of visual features extracted from product images using (pre-trained) deep networks. Expand
...
1
2
3
...