CoBaR: Confidence-Based Recommender

08/21/2018
by   Fernando S. Aguiar Neto, et al.
0

Neighborhood-based collaborative filtering algorithms usually adopt a fixed neighborhood size for every user or item, although groups of users or items may have different lengths depending on users' preferences. In this paper, we propose an extension to a non-personalized recommender based on confidence intervals and hierarchical clustering to generate groups of users with optimal sizes. The evaluation shows that the proposed technique outperformed the traditional recommender algorithms in four publicly available datasets.

READ FULL TEXT

page 1

page 2

research
03/19/2019

Personalized Neural Embeddings for Collaborative Filtering with Text

Collaborative filtering (CF) is a core technique for recommender systems...
research
12/01/2019

Data Poisoning Attacks on Neighborhood-based Recommender Systems

Nowadays, collaborative filtering recommender systems have been widely d...
research
03/08/2023

Kernel-CF: Collaborative filtering done right with social network analysis and kernel smoothing

Collaborative filtering is the simplest but oldest machine learning algo...
research
12/20/2022

Variational Factorization Machines for Preference Elicitation in Large-Scale Recommender Systems

Factorization machines (FMs) are a powerful tool for regression and clas...
research
10/19/2020

A Unified Model for Recommendation with Selective Neighborhood Modeling

Neighborhood-based recommenders are a major class of Collaborative Filte...
research
02/13/2012

Recommender System Based on Algorithm of Bicluster Analysis RecBi

In this paper we propose two new algorithms based on biclustering analys...
research
08/07/2023

POSIT: Promotion of Semantic Item Tail via Adversarial Learning

In many recommender problems, a handful of popular items (e.g. movies/TV...

Please sign up or login with your details

Forgot password? Click here to reset