A Group-Specific Recommender System

@article{Bi2017AGR,
  title={A Group-Specific Recommender System},
  author={Xuan Bi and Annie Qu and Junhui Wang and Xiaotong Shen},
  journal={Journal of the American Statistical Association},
  year={2017},
  volume={112},
  pages={1344 - 1353}
}
ABSTRACT In recent years, there has been a growing demand to develop efficient recommender systems which track users’ preferences and recommend potential items of interest to users. In this article, we propose a group-specific method to use dependency information from users and items which share similar characteristics under the singular value decomposition framework. The new approach is effective for the “cold-start” problem, where, in the testing set, majority responses are obtained from new… 

Smooth neighborhood recommender systems

This article proposes a smooth neighborhood recommender in the framework of the latent factor models, and utilizes a “divide-and-conquer” version of the alternating least squares algorithm to achieve scalable computation, and establishes asymptotic results for the proposed method, demonstrating that it achieves superior prediction accuracy.

Smooth neighborhood recommender systems

This article proposes a smooth neighborhood recommender in the framework of the latent factor models, and utilizes a “divide-and-conquer” version of the alternating least squares algorithm to achieve scalable computation, and establishes asymptotic results for the proposed method, demonstrating that it achieves superior prediction accuracy.

A Personalized Recommender System with Correlation Estimation

This work proposes a new personalized recommender system method that takes into account the correlation structure of ratings by a user, and shows theoretically that incorporating the correlations structure gives higher asymptotic efficiency of the estimators compared to ignoring it.

Weighted AutoEncoding recommender system

The proposed weighted AutoEncoding model provides an effective strategy for borrowing strength from user or item‐specific clustering structure as well as pairwise similarity in the training data, while achieving high computational efficiency and dimension reduction, and preserving nonlinear relationships between user preferences and item features.

Multilayer tensor factorization with applications to recommender systems

An innovative method, namely the recommendation engine of multilayers (REM), for tensor recommender systems, which utilizes the structure of a tensor response to integrate information from multiple modes, and creates an additional layer of nested latent factors to accommodate between-subjects dependency.

A Logistic Factorization Model for Recommender Systems With Multinomial Responses

This article treats the possible ratings as mutually exclusive events, whose probability is determined by the latent factor of the users and the items through a two-way multinomial logistic function, which has a compatibility with categorical ratings and the advantage of incorporating both the covariate information and the latent factors of the Users and items uniformly.

Tensor factorization recommender systems with dependency

An innovative tensor-based recommender system, namely, the Ten- sor Factorization with Dependency (TFD), which utilizes shared factors to characterize the dependency between different modes, in addition to pairwise additive tensor factorization to integrate information among multiple modes.

Cluster Developing 1-Bit Matrix Completion

Group-Specific 1- bit Matrix Completion (GS1MC) is introduced by first-time consolidating cluster effects in 1-bit matrix completion tasks to provide a new insight to incorporate and evaluate the efficacy of different clustering methods.

ROBUST RECOMMENDATION VIA SOCIAL NETWORK ENHANCED MATRIX COMPLETION

This work develops a novel approach, called MCNet, that combines the random dot product graph model and low-rank matrix completion to recover missing entries in a user–product rating matrix, and shows that it gives the smallest testing errors among the comparative methods.

Geometric Inductive Matrix Completion: A Hyperbolic Approach with Unified Message Passing

This paper proposes Geometric Inductive Matrix Completion (GIMC) by introducing hyperbolic geometry and a unified message passing scheme into this generic task and is the first work defining continuous explicit feedback prediction within non-Euclidean space.

References

SHOWING 1-10 OF 51 REFERENCES

Content-based Recommender Systems: State of the Art and Trends

The role of User Generated Content is described as a way for taking into account evolving vocabularies, and the challenge of feeding users with serendipitous recommendations, that is to say surprisingly interesting items that they might not have otherwise discovered.

Factor in the neighbors: Scalable and accurate collaborative filtering

A new neighborhood model with an improved prediction accuracy is introduced, which model neighborhood relations by minimizing a global cost function and makes both item-item and user-user implementations scale linearly with the size of the data.

Naïve filterbots for robust cold-start recommendations

This work improves the scalability and performance of a previous approach to handling cold-start situations that uses filterbots, or surrogate users that rate items based only on user or item attributes, and shows that introducing a very small number of simple filterbots helps make CF algorithms more robust.

Improving new user recommendations with rule-based induction on cold user data

With recommender systems, users receive items recommended on the basis of their profile. New users experience the cold start problem: as their profile is very poor, the system performs very poorly.

Personalized Prediction and Sparsity Pursuit in Latent Factor Models

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.

Scalable Collaborative Filtering with Jointly Derived Neighborhood Interpolation Weights

This work enhances the neighborhood-based approach leading to substantial improvement of prediction accuracy, without a meaningful increase in running time, and suggests a novel scheme for low dimensional embedding of the users.

Content-based book recommending using learning for text categorization

This work describes a content-based book recommending system that utilizes information extraction and a machine-learning algorithm for text categorization and shows initial experimental results demonstrate that this approach can produce accurate recommendations.

Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions

This paper presents an overview of the field of recommender systems and describes the current generation of recommendation methods that are usually classified into the following three main

Content-boosted collaborative filtering for improved recommendations

This paper presents an elegant and effective framework for combining content and collaboration, which uses a content-based predictor to enhance existing user data, and then provides personalized suggestions through collaborative filtering.

Content-Based Recommendation Systems

This chapter discusses content-based recommendation systems, i.e., systems that recommend an item to a user based upon a description of the item and a profile of the user's interests, which are used in a variety of domains ranging from recommending web pages, news articles, restaurants, television programs, and items for sale.
...