Statistical analysis of $k$-nearest neighbor collaborative recommendation

@article{Biau2010StatisticalAO,
  title={Statistical analysis of \$k\$-nearest neighbor collaborative recommendation},
  author={G{\'e}rard Biau and Beno{\^i}t Cadre and Laurent Rousset Rouviere},
  journal={arXiv: Statistics Theory},
  year={2010}
}
Collaborative recommendation is an information-filtering technique that attempts to present information items that are likely of interest to an Internet user. Traditionally, collaborative systems deal with situations with two types of variables, users and items. In its most common form, the problem is framed as trying to estimate ratings for items that have not yet been consumed by a user. Despite wide-ranging literature, little is known about the statistical properties of recommendation… 

Tables from this paper

A Latent Source Model for Online Collaborative Filtering

TLDR
A model for online recommendation systems is introduced, cast item recommendation under the model as a learning problem, and the performance of a cosine-similarity collaborative filtering method is analyzed.

2 A Model and Learning Problem for Online Recommendations

TLDR
A model for online recommendation systems is introduced, cast item recommendation under the model as a learning problem, and the performance of a cosine-similarity collaborative filtering method is analyzed.

The Sample Complexity of Online One-Class Collaborative Filtering

TLDR
A simple probabilistic user model is introduced, and the performance of an online user-based CF algorithm is analyzed, proving that after an initial cold start phase, where recommendations are invested in exploring the user's preferences, this algorithm makes perfect recommendations.

Learning User Preferences in Non-Stationary Environments

TLDR
This paper introduces a novel model for online non-stationary recommendation systems which allows for temporal uncertainties in the users’ preferences, and proposes a user-based CF algorithm that outperforms other static algorithms even when preferences do not change over time.

Walking on a User Similarity Network towards Personalized Recommendations

TLDR
This work adopts three strategies to adjust a user similarity network from user similarity scores calculated on historical data, and proposes a random walk with restart model on the constructed network to achieve personalized recommendations that outperforms existing methods in not only recommendation accuracy and diversity, but also retrieval performance.

Collaborative Filtering with Low Regret

TLDR
An item-item collaborative filtering algorithm can achieve fundamentally better performance compared to user-user collaborative filtering and is analyzed to help design and analyze various recommendation algorithms.

Regret Guarantees for Item-Item Collaborative Filtering

TLDR
An item-item collaborative filtering algorithm can achieve fundamentally better performance compared to user-user collaborative filtering and is analyzed to help design and analyze various recommendation algorithms.

TAFFY: incorporating tag information into a diffusion process for personalized recommendations

TLDR
This work proposes a data fusion approach that integrates historical and tag data into complex networks, resorts to a diffusion kernel to measure the strength of associations between users and objects, and adopts Fisher's combined probability test to obtain the statistical significance of such associations for personalized recommendations.

References

SHOWING 1-10 OF 16 REFERENCES

Item-based collaborative filtering recommendation algorithms

TLDR
This paper analyzes item-based collaborative ltering techniques and suggests that item- based algorithms provide dramatically better performance than user-based algorithms, while at the same time providing better quality than the best available userbased algorithms.

Empirical Analysis of Predictive Algorithms for Collaborative Filtering

TLDR
Several algorithms designed for collaborative filtering or recommender systems are described, including techniques based on correlation coefficients, vector-based similarity calculations, and statistical Bayesian methods, to compare the predictive accuracy of the various methods in a set of representative problem domains.

Restricted Boltzmann machines for collaborative filtering

TLDR
This paper shows how a class of two-layer undirected graphical models, called Restricted Boltzmann Machines (RBM's), can be used to model tabular data, such as user's ratings of movies, and demonstrates that RBM's can be successfully applied to the Netflix data set.

A New Approach to Collaborative Filtering: Operator Estimation with Spectral Regularization

TLDR
This work presents a general approach for collaborative filtering using spectral regularization to learn linear operators mapping a set of "users" to aSet of possibly desired " objects", and provides novel representer theorems that are used to develop new estimation methods.

Incorporating contextual information in recommender systems using a multidimensional approach

The article presents a multidimensional (MD) approach to recommender systems that can provide recommendations based on additional contextual information besides the typical information on users and

A Taxonomy of Recommender Agents on the Internet

TLDR
A state-of-the-art taxonomy of intelligent recommender agents on the Internet and a cross-dimensional analysis with the aim of providing a starting point for researchers to construct their own recommender system.

Social information filtering: algorithms for automating “word of mouth”

TLDR
The implementation of a networked system called Ringo, which makes personalized recommendations for music albums and artists, and four different algorithms for making recommendations by using social information filtering were tested and compared.

Personalized recommendation system based on product specification values

Exact Matrix Completion via Convex Optimization

TLDR
It is proved that one can perfectly recover most low-rank matrices from what appears to be an incomplete set of entries, and that objects other than signals and images can be perfectly reconstructed from very limited information.

GroupLens: an open architecture for collaborative filtering of netnews

TLDR
GroupLens is a system for collaborative filtering of netnews, to help people find articles they will like in the huge stream of available articles, and protect their privacy by entering ratings under pseudonyms, without reducing the effectiveness of the score prediction.