A Utility-Theoretic Approach to Privacy and Personalization

Proceedings of the 23rd AAAI Conference on Artificial Intelligence, AAAI 2008

Volumn , Issue , 2008, Pages 1181-1188

  Krause, Andreas ^a   Horvitz, Eric ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; INFORMATION RETRIEVAL; WEBSITES;

E-COMMERCE APPLICATIONS; HETEROGENEOUS USERS; HIGH QUALITY; IMPROVE PERFORMANCE; ON-LINE SERVICE; PERSONALIZATIONS; SEARCH HISTORY; SERVICE-BASED; UTILITY THEORETIC APPROACH; WEB SEARCHES;

DATA PRIVACY;

EID: 70349958993     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. Adar, E. 2007. User 4xxxxx9: Anonymizing query logs. In Query Logs Workshop, WWW.
2. Boyd, S., and Vandenberghe, L. 2004. Convex Optimization. Cambridge UP.
3. Chen, B.-C.; LeFevre, K.; and Ramakrishnan, R. 2007. Privacy skyline: Privacy with multidimensional adversarial knowledge. In VLDB.
4. Dou, Z.; Song, R.; and Wen, J.-R. 2007. A large-scale evaluation and analysis of personalized search strategies. In WWW.
5. Downey, D.; Dumais, S.; and Horvitz, E. 2007. Models of searching and browsing: Languages, studies, and applications. In IJCAI.
6. Dwork, C. 2006. Differential privacy. In ICALP.
7. Feige, U.; Mirrokni, V.; and Vondrak, J. 2007. Maximizing non-monotone submodular functions. In FOCS.
8. Goldengorin, B.; Sierksma, G.; Tijssen, G. A.; and Tso, M. 1999. The data-correcting algorithm for the minimization of supermodular functions. Mgmt Sci 45(11):1539–1551.
9. Hann, I.; Hui, K.; Lee, T.; and Png, I. 2002. Online-information privacy: Measuring the cost-benefit tradeoff. In ICIS.
10. Hore, B., and R. Jammalamadaka, S. M. 2007. Flexible anonymization for privacy preserving data publishing: A systematic search based approach. In SDM.
11. Horvitz, E. 2006. Machine learning, reasoning, and intelligence in daily life: Directions and challenges. Technical Report TR-2006-185, Microsoft Research.
12. Huberman, B. A.; Adar, E.; and Fine, L. R. 2005. Valuating privacy. IEEE Security & Privacy 3(5):22–25.
13. Krause, A., and Guestrin, C. 2005. Near-optimal nonmyopic value of information in graphical models. In UAI.
14. Krause, A., and Horvitz, E. 2007. A utility-theoretic approach to handling privacy in online personalization. Technical Report MSR-TR-2007-135, Microsoft Research.
15. Lebanon, G.; Scannapieco, M.; Fouad, M. R.; and Bertino, E. 2006. Beyond k-anonymity: A decision theoretic framework for assessing privacy risk. Springer Lecture Notes in Computer Science 4302:217–232.
16. LeFevre, K.; DeWitt, D.; and Ramakrishnan, R. 2006. Mondrian multidimensional k-anonymity. In ICDE.
17. Machanavajjhala, A.; Kifer, D.; Gehrke, J.; and Venkitasubramaniam, M. 2006. L-diversity: Privacy beyond k-anonymity. In ICDE.
18. Nemhauser, G. L., and Wolsey, L. A. 1981. Studies on Graphs and Discrete Programming. North-Holland. chapter Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms, 279–301.
19. Nemhauser, G.; Wolsey, L.; and Fisher, M. 1978. An analysis of the approximations for maximizing submodular set functions. Math. Prog. 14:265–294.
20. Olson, J. S.; Grudin, J.; and Horvitz, E. 2005. A study of preferences for sharing and privacy. In CHI.
21. Sugiyama, K.; Hatano, K.; and Ikoma, T. 2004. Adaptive web search based on user profile constructed without any effort from users. In WWW.
22. Sweeney, L. 2002. k-anonymity: a model for protecting privacy. Int. Journal on Uncertainty, Fuzziness and Knowledge-based Systems 10(5):557–570.
23. Teevan, J.; Dumais, S. T.; and Horvitz, E. 2005. Personalizing search via automated analysis of interests and activities. In SIGIR.
24. Wattal, S.; Telang, R.; Mukhopadhyay, T.; and Boatwright, P. 2005. Examining the personalization-privacy tradeoff an empirical investigation with email advertisements. Mgmt Sci.
25. Xu, Y.; Zhang, B.; and Wang, K. 2007. Privacy-enhancing personalized web search. In WWW.