Code for Private Recommender Systems: How Can Users Build Their Own Fair Recommender Systems without Log Data? (SDM 2022)

Last update: Aug 21, 2022

Related tags

Deep Learning private-recsys

Overview

Private Recommender Systems: How Can Users Build Their Own Fair Recommender Systems without Log Data? (SDM 2022)

We consider how a user of a web service can build their own recommender system. Many recommender systems on the Internet are still unfair/undesirable for some users, in which case the users need to leave the service or unwillingly continue to use the system. Our proposed concept, private recommender systems, provides a way for the users to resolve this dilemma.

Paper: https://arxiv.org/abs/2105.12353

💿 Dependency

$ pip install -r requirements.txt
$ sudo apt install wget unzip

🗃️ Download and Preprocess Datasets

You can download and preprocess data by the following command. It may take time.

$ bash download.sh

hetrec.npy is the Last.fm dataset. home_and_kitchen.npy is the Amazon dataset. adult_*.npy and adult_*.npz are the Adult dataset.

🧪 Evaluation

$ python evaluate.py --data 100k --prov cosine --sensitive popularity
$ python evaluate.py --data 100k --prov bpr --sensitive popularity
$ python evaluate.py --data 100k --prov cosine --sensitive old
$ python evaluate.py --data 100k --prov bpr --sensitive old
$ python evaluate.py --data hetrec --prov bpr --sensitive popularity
$ python evaluate.py --data home --prov bpr --sensitive popularity
$ python evaluate_adult.py

100k is the MovieLens 100k dataset. hetrec is the LastFM dataset. home is the Amazon Home and Kitchen dataset.
--prov specifys the algorithm of the service provider's recommender system.
--sensitive specifyies the sensitive attribute. old is available only for the MovieLens datasets.

These scripts compute the sums of recalls, NDCGs, least ratios, and entropies for all users. Be sure to divide these values by the number of users to obtain the average values.

When your environment supports multi-processing, run, for example, the following commands to speed up the computation (with background executions):

$ python evaluate.py --data 100k --prov cosine --sensitive popularity --split 7 --block 0
$ python evaluate.py --data 100k --prov cosine --sensitive popularity --split 7 --block 1
$ python evaluate.py --data 100k --prov cosine --sensitive popularity --split 7 --block 2
$ python evaluate.py --data 100k --prov cosine --sensitive popularity --split 7 --block 3
$ python evaluate.py --data 100k --prov cosine --sensitive popularity --split 7 --block 4
$ python evaluate.py --data 100k --prov cosine --sensitive popularity --split 7 --block 5
$ python evaluate.py --data 100k --prov cosine --sensitive popularity --split 7 --block 6
$ python summary.py 7

🖋️ Citation

@inproceedings{sato2022retrieving,
  author    = {Ryoma Sato},
  title     = {Private Recommender Systems: How Can Users Build Their Own Fair Recommender Systems without Log Data?},
  booktitle = {Proceedings of the 2022 {SIAM} International Conference on Data Mining, {SDM}},
  year      = {2022},
}

Code for Private Recommender Systems: How Can Users Build Their Own Fair Recommender Systems without Log Data? (SDM 2022)

Related tags

Overview

Private Recommender Systems: How Can Users Build Their Own Fair Recommender Systems without Log Data? (SDM 2022)

💿 Dependency

🗃️ Download and Preprocess Datasets

🧪 Evaluation

🖋️ Citation

Owner

joisino

GPU-accelerated Image Processing library using OpenCL

Fine-grained Control of Image Caption Generation with Abstract Scene Graphs

Pytorch implementation of ProjectedGAN

SAPIEN Manipulation Skill Benchmark

An energy estimator for eyeriss-like DNN hardware accelerator

A PyTorch implementation of "TokenLearner: What Can 8 Learned Tokens Do for Images and Videos?"

Implementation of SwinTransformerV2 in TensorFlow.

Supplemental Code for "ImpressionNet :A Multi view Approach to Predict Socio Facial Impressions"

Authors implementation of LieTransformer: Equivariant Self-Attention for Lie Groups

Source code for our paper "Learning to Break Deep Perceptual Hashing: The Use Case NeuralHash"

This is the code of "Multi-view Contrastive Graph Clustering" in NeurlPS 2021.

QICK: Quantum Instrumentation Control Kit

This repository is an official implementation of the paper MOTR: End-to-End Multiple-Object Tracking with TRansformer.

Source code for GNN-LSPE (Graph Neural Networks with Learnable Structural and Positional Representations)

Some tentative models that incorporate label propagation to graph neural networks for graph representation learning in nodes, links or graphs.

This repository contains the code used in the paper "Prompt-Based Multi-Modal Image Segmentation".

[ICCV 2021] Self-supervised Monocular Depth Estimation for All Day Images using Domain Separation

This is the official released code for our paper, The Emergence of Objectness: Learning Zero-Shot Segmentation from Videos

Deployment of PyTorch chatbot with Flask

Repository for benchmarking graph neural networks