Differentiating Regularization Weights -- A Simple Mechanism to Alleviate Cold Start in Recommender Systems

  title={Differentiating Regularization Weights -- A Simple Mechanism to Alleviate Cold Start in Recommender Systems},
  author={Hung-Hsuan Chen and Pu Chen},
  journal={ACM Transactions on Knowledge Discovery from Data (TKDD)},
  pages={1 - 22}
  • Hung-Hsuan ChenPu Chen
  • Published 9 January 2019
  • Computer Science
  • ACM Transactions on Knowledge Discovery from Data (TKDD)
Matrix factorization (MF) and its extended methodologies have been studied extensively in the community of recommender systems in the last decade. Essentially, MF attempts to search for low-ranked matrices that can (1) best approximate the known rating scores, and (2) maintain low Frobenius norm for the low-ranked matrices to prevent overfitting. Since the two objectives conflict with each other, the common practice is to assign the relative importance weights as the hyper-parameters to these… 

Attribute interaction aware matrix factorization method for recommendation

The experimental results on the two classic public datasets MovieLens 1M and MovieLens 100k show that AIMF can not only effectively improve the accuracy of recommendation, but also make full use of parallel computing technology to improve training efficiency without modifying the matrix factorization model.

Personalized Regularization Learning for Fairer Matrix Factorization

The approach, personalized regularization learning (PRL), solves a secondary learning problem of finding the per-user regularization parameters by back-propagating through alternating least squares and outperforms existing methods in improving model performance for disadvantaged groups.

Accelerating Matrix Factorization by Overparameterization

It is found that overparameterization can accelerate the optimization of MF with no change in the expressiveness of the learning model, and modern applications on recommendations based on MF or its variants can largely benefit from this discovery.

A Movie Recommender System: MOVREC using Machine Learning Techniques

A recommender system, or a recommendation system, is a subclass of information filtering system that seeks to predict the "rating" or "preference" a user would give to an item[1]; they are primarily used in commercial applications.

Hierarchical Physician Recommendation via Diversity-enhanced Matrix Factorization

A novel diversity-enhanced hierarchical physician recommendation approach that adopts matrix factorization to estimate physician competency and exploit implicit similarity relationships to improve the competency estimation of physicians that are of little information of is proposed.

Deep Learning Enabled Autoencoder Architecture for Collaborative Filtering Recommendation in IoT Environment

This work introduces a deep-learning-enabled autoencoder architecture to overcome the setbacks of CF recommendations and designs a hybrid architecture with three key networks, namely autoen coder (AE), multi-layered perceptron (MLP), and generalized matrix factorization (GMF).

Experience: Analyzing Missing Web Page Visits and Unintentional Web Page Visits from the Client-side Web Logs

It is found that web logs in Chrome’s browsing history only record 57% of users’ visited websites, and it is shown that sorting popular website categories based on traditional web logs differs from the rankings obtained when including missing visits or excluding unintentional visits.

Evaluating, Understanding, and Mitigating Unfairness in Recommender Systems



Deep Matrix Factorization Models for Recommender Systems

A novel matrix factorization model with neural network architecture is proposed that outperformed other state-of-the-art methods on several benchmark datasets and considers both explicit ratings and implicit feedback for a better optimization.

Weighted-SVD: Matrix Factorization with Weights on the Latent Factors

A new model is proposed, called Weighted-SVD, to integrate the linear regression model with the SVD model such that each latent factor accompanies with a corresponding weight parameter, which allows the latent factors have different weights to influence the final ratings.

Functional matrix factorizations for cold-start recommendation

Functional matrix factorization is presented, a novel cold-start recommendation method that solves the problem of initial interview construction within the context of learning user and item profiles and associate latent profiles for each node of the tree, which allows the profiles to be gradually refined through the interview process based on user responses.

Factorizing personalized Markov chains for next-basket recommendation

This paper introduces an adaption of the Bayesian Personalized Ranking (BPR) framework for sequential basket data and shows that the FPMC model outperforms both the common matrix factorization and the unpersonalized MC model both learned with and without factorization.

Facing the cold start problem in recommender systems

Pairwise preference regression for cold-start recommendation

P predictive feature-based regression models are proposed that leverage all available information of users and items, such as user demographic information and item content features, to tackle cold-start problems and scale efficiently as a linear function of the number of observations.

Methods and metrics for cold-start recommendations

A method for recommending items that combines content and collaborative data under a single probabilistic framework is developed, and it is demonstrated empirically that the various components of the testing strategy combine to obtain deeper understanding of the performance characteristics of recommender systems.

Learning preferences of new users in recommender systems: an information theoretic approach

The work of [23] is extended by incrementally developing a set of information theoretic strategies for the new user problem by proposing an offline simulation framework and evaluating the strategies through extensive offline simulations and an online experiment with real users of a live recommender system.

Learning multiple-question decision trees for cold-start recommendation

A novel algorithm that learns to conduct the interview process guided by a decision tree with multiple questions at each split is proposed, which outperforms state-of-the-art approaches in terms of both the prediction accuracy and user cognitive efforts.

Session-based Recommendations with Recurrent Neural Networks

It is argued that by modeling the whole session, more accurate recommendations can be provided by an RNN-based approach for session-based recommendations, and introduced several modifications to classic RNNs such as a ranking loss function that make it more viable for this specific problem.