A small library to compute fairness of recommender systems.
Project description
Recsyslearn
A small library to compute fairness of recommender systems.
Free software: GNU General Public License v3
Documentation: https://recsyslearn.readthedocs.io.
Features
Compute Novelty of a recommender system based on its recommendations list.
Compute Coverage of a recommender system based on its recommendations list.
Compute Entropy of a recommender system based on its recommendations list.
Compute Kullback-Leibler divergence of a recommender system based on its recommendations list and the wanted target representation.
Compute Mutual Information of a recommender system based on its recommendations list.
Segment an implicit or explicit dataset in groups based on the activity of the users or on the popularity of the items.
Known Issues
In this version of the library, the computation of the metrics for cross groups (user and item groups together) has not been implemented yet.
Credits
This package was created with Cookiecutter and the audreyr/cookiecutter-pypackage project template.
History
0.4.0-alpha (2022-06-24)
First release on PyPI.
0.4.1 (2022-06-27)
Fixed novelty formula.
0.5.0 (2022-07-19)
Added a new item segmentation method, which gives a percentage score to the items based on their popularity.
More accurate docs, with a beautiful theme.
0.5.1 (2022-07-27)
Fixed mantissa problem with the sum of proportion in the segmentation part.
Improved code readability and tests coverage.
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Hashes for recsyslearn-0.5.1-py2.py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 9a05121b79fc40ceac8a910402f43a5c307604537b6a58b1c6154a5993b6055b |
|
MD5 | 6ff4c030476091067467bcf06cbe1fe9 |
|
BLAKE2b-256 | ddcdd0ea99475372889b8d34938e4c51fa9539da74e5ece682abe572bbe54abe |