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
โฆ 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
- 123621914
- Publisher
- ACM Press
- Year
- 2010
- Weight
- 443 KB
- Category
- Article
- ISBN
- 1605587990
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
[ACM Press the 19th international confer
โ
Zhu, Yun; Xiong, Li; Verdery, Christopher
๐
Article
๐
2010
๐
ACM Press
๐
English
โ 443 KB
[ACM Press the 19th international confer
โ
Li, Lusong; Mei, Tao; Niu, Xiang; Ngo, Chong-Wah
๐
Article
๐
2010
๐
ACM Press
โ 484 KB
[ACM Press the 19th international confer
โ
Balakrishnan, Raju; Kambhampati, Subbarao
๐
Article
๐
2010
๐
ACM Press
โ 365 KB
[ACM Press the 19th international confer
โ
Weninger, Tim; Hsu, William H.; Han, Jiawei
๐
Article
๐
2010
๐
ACM Press
โ 588 KB
[ACM Press the 19th international confer
โ
Sculley, D.
๐
Article
๐
2010
๐
ACM Press
โ 265 KB
[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