When being Weak is Brave: Privacy in Recommender Systems

Ananth Y. Grama; Batul J. Mirza; Benjamin J. Keller; George Karypis; Naren Ramakrishnan

REVIEW

When being Weak is Brave: Privacy in Recommender Systems

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv cs/0105028 v1 pith:WRXACNEI submitted 2001-05-18 cs.CR cs.DS

When being Weak is Brave: Privacy in Recommender Systems

Naren Ramakrishnan , Benjamin J. Keller , Batul J. Mirza , Ananth Y. Grama , George Karypis This is my paper

classification cs.CR cs.DS

keywords weaktiesinformationotherprivacyarisesarticlebenefit

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original abstract

We explore the conflict between personalization and privacy that arises from the existence of weak ties. A weak tie is an unexpected connection that provides serendipitous recommendations. However, information about weak ties could be used in conjunction with other sources of data to uncover identities and reveal other personal information. In this article, we use a graph-theoretic model to study the benefit and risk from weak ties.

When being Weak is Brave: Privacy in Recommender Systems

discussion (0)