๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

[ACM Press the 19th international conference - Raleigh, North Carolina, USA (2010.04.26-2010.04.30)] Proceedings of the 19th international conference on World wide web - WWW '10 - Anonymizing user profiles for personalized web search

โœ Scribed by Zhu, Yun; Xiong, Li; Verdery, Christopher


Book ID
123621915
Publisher
ACM Press
Year
2010
Tongue
English
Weight
443 KB
Category
Article
ISBN
1605587990

No coin nor oath required. For personal study only.

โœฆ Synopsis


We study the problem of anonymizing user profiles so that user privacy is sufficiently protected while the anonymized profiles are still effective in enabling personalized web search. We propose a Bayes-optimal privacy notion to bound the prior and posterior probability of associating a user with an individual term in the anonymized user profile set. We also propose a novel bundling technique that clusters user profiles into groups by taking into account the semantic relationships between the terms while satisfying the privacy constraint. We evaluate our approach through a set of preliminary experiments using real data demonstrating its feasibility and effectiveness.


๐Ÿ“œ SIMILAR VOLUMES


[ACM Press the 19th international confer
โœ Sculley, D. ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› ACM Press ๐ŸŒ English โš– 265 KB

We present two modifications to the popular k-means clustering algorithm to address the extreme requirements for latency, scalability, and sparsity encountered in user-facing web applications. First, we propose the use of mini-batch optimization for k-means clustering. This reduces computation cost