Towards Minimal Necessary Data: The Case for Analyzing Training Data Requirements of Recommender Algorithms

Martha Larson, Alessandro Zito, Babak Loni, Paolo Cremonesi

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review

337 Downloads (Pure)

Abstract

This paper states the case for the principle of minimal necessary data: If two recommender algorithms achieve the same effectiveness, the better algorithm is the one that requires less user data. Applying this principle involves carrying out training data requirements analysis, which we argue should be adopted as best practice for the development and evaluation of recommender algorithms. We take
the position that responsible recommendation is recommendation that serves the people whose data it uses. To minimize the imposition on users’ privacy, it is important that a recommender system does not collect or store more user information than it absolutely needs. Further, algorithms using minimal necessary data reduce training time and address the cold start problem. To illustrate the trade-off between training data volume and accuracy, we carry out
a set of classic recommender system experiments. We conclude that
consistently applying training data requirements analysis would represent a relatively small change in researchers’ current practices, but a large step towards more responsible recommender systems.
Original languageEnglish
Title of host publicationFATREC Workshop on Responsible Recommendation Proceedings
Pages1-6
Number of pages6
DOIs
Publication statusPublished - 2017
EventFATREC 2017: Workshop on Responsible Recommendation - Como, Italy
Duration: 31 Aug 201731 Aug 2017
https://piret.gitlab.io/fatrec/

Workshop

WorkshopFATREC 2017
Country/TerritoryItaly
CityComo
Period31/08/1731/08/17
Internet address

Fingerprint

Dive into the research topics of 'Towards Minimal Necessary Data: The Case for Analyzing Training Data Requirements of Recommender Algorithms'. Together they form a unique fingerprint.

Cite this