[PDF] Item-based collaborative filtering recommendation algorithms | Semantic Scholar (2024)

In this paper, completely different item-based recommendation generation algorithms are analyzed and it is recommended that item- based algorithms offer dramatically higher performance then user-based algorithms, whereas at a similar time providing higher quality than the most effective offered user-Based algorithms.

This approach predicts item ratings that users have not rated, and then uses Pearson correlation similarity measurement to find the target items’ neighbors, lastly produces the recommendations.

This paper provides ways to evaluate efficiency, scalability and accuracy of recommender system, and analyzes different algorithms of user based and item based techniques for recommendation generation.

A scalable algorithm for top-k recommendations using item-based CF method, based on abstracting the key computation of a CF algorithm in terms of two operations -- probe and explore, which achieves better scalability compared to solid baseline algorithms.

A model-based approach is employed to provide enhanced recommendation quality supporting incremental updating of a model through the use of explicit user feedback to overcome the sparsity of the data and scalability problems.

Recommendation Engine will analyze huge Data sets of User purchase pattern and recommend items to online users based on Machine Learning Algorithms based on Data Sparsity.

This article presents one class of model-based recommendation algorithms that first determines the similarities between the various items and then uses them to identify the set of items to be recommended, and shows that these item-based algorithms are up to two orders of magnitude faster than the traditional user-neighborhood based recommender systems and provide recommendations with comparable or better quality.

Experimental results show that the proposed hybrid recommendation algorithm effectively solves the scalability issue of recommender systems and provides a comparable recommendation quality when lacking most of the item features.

This work proposes USBFC, a Biclustering-based CF approach that creates user-specific models from strongly coherent and statistically significant rating patterns, corresponding to subspaces of shared preferences across users, and successfully suppresses the main shortcomings of the previously proposed state-of-the-art bic Lustering- based CF by increasing coverage, and coclustering -based CF by strengthening subspace hom*ogeneity.

...

...

The experimental evaluation on five different datasets show that the proposed item-based algorithms are up to 28 times faster than the traditional user-neighborhood based recommender systems and provide recommendations whose quality is up to 27% better.

This paper presents two different experiments where one technology called Singular Value Decomposition (SVD) is explored to reduce the dimensionality of recommender system databases and suggests that SVD has the potential to meet many of the challenges ofRecommender systems, under certain conditions.

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.

An explanation of howRecommender systems help E-commerce sites increase sales, and a taxonomy of recommender systems, including the interfaces they present to customers, the technologies used to create the recommendations, and the inputs they need from customers.

This work proposes a representation for collaborative filtering tasks that allows the application of virtually any machine learning algorithm, and identifies the shortcomings of current collaborative filtering techniques and proposes the use of learning algorithms paired with feature extraction techniques that specifically address the limitations of previous approaches.

The filterbot model allows collaborative filtering systems to address sparsity by tapping the strength of content filtering techniques and is experimentally validated by showing that even simple filterbots such as spell checking can increase the utility for users of sparsely populated collaborative filtering system.

A formal statistical model of collaborative filtering is presented, and different algorithms for estimating the model parameters including variations of K-means clustering and Gibbs Sampling are compared.

Results are presented showing what forms of explanation users find the most compelling, as well as indications that explanations can increase the acceptance of ACF systems, and results from tests of a new algorithm for supporting focused ephemeral user information needs.

This paper shows that a CF framework can be used to combine personal IF agents and the opinions of a community of users to produce better recommendations than either agents or users can produce alone.

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.

...

...