A utility-theoretic approach to privacy in online services

Journal of Artificial Intelligence Research

Volumn 39, Issue , 2010, Pages 633-662

  Krause, Andreas ^a   Horvitz, Eric ^b  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AMOUNT OF INFORMATION; E-COMMERCE APPLICATIONS; GOVERNMENT AGENCIES; HETEROGENEOUS USERS; HIGH QUALITY; OBJECTIVE FUNCTIONS; ON-LINE SERVICE; ONLINE OFFERING; PERSONAL DATA; PERSONAL INFORMATION; PERSONALIZATIONS; SEARCH ACTIVITY; SEARCH EFFICIENCY; WEB SEARCH QUERIES; WEB SEARCHES;

COMMUNICATION CHANNELS (INFORMATION THEORY); INFORMATION RETRIEVAL; OPTIMIZATION; WEBSITES;

DATA PRIVACY;

EID: 78651424764     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.3089     Document Type: Article

References (41)

1. Adam, N. R., & Wortmann, J. C. (1989). Security-control methods for statistical databases: A comparative study. ACM Computing Surveys, 21(4), 515-556.
2. Adar, E. (2007). User 4xxxxx9: Anonymizing query logs. In Query Logs Workshop, World Wide Web Conference.
3. Blum, A., Ligett, K., & Roth, A. (2008). A learning theory approach to non-interactive database privacy. In Symposium on the Theory of Computing.
4. Boyd, S., & Vandenberghe, L. (2004). Convex Optimization. Cambridge University Press.
5. Chen, B., LeFevre, K., & Ramakrishnan, R. (2007). Privacy skyline: Privacy with multidimensional adversarial knowledge. In International Conference on Very Large Data Bases (VLDB).
6. Cohn, D. A., Gharamani, Z., & Jordan, M. I. (1996). Active learning with statistical models. Journal of Artificial Intelligence Research, 4, 129-145.
7. Cover, T. M., & Thomas, J. A. (1991). Elements of Information Theory. Wiley Interscience.
8. Dittmer, S., & Jensen, F. (1997). Myopic value of information in influence diagrams. In Conference on Uncertainty in Artificial Intelligence (UAI), pp. 142-149, San Francisco.
9. Dou, Z., Song, R., & Wen, J.-R. (2007). A large-scale evaluation and analysis of personalized search strategies. In World Wide Web Conference (WWW).
10. Downey, D., Dumais, S., & Horvitz, E. (2007). Models of searching and browsing: Languages, studies, and applications. In International Joint Conference on Artificial Intelligence (IJCAI).
11. Dwork, C. (2006). Differential privacy. In International Colloquium on Automata, Languages and Programming (ICALP).
12. Feige, U., Mirrokni, V., & Vondrak, J. (2007). Maximizing non-monotone submodular functions. In IEEE Symposium on Foundations of Computer Science (FOCS).
13. Goldengorin, B., Sierksma, G., Tijssen, G. A., & Tso, M. (1999). The data-correcting algorithm for the minimization of supermodular functions. Management Science, 45(11), 1539-1551.
14. Golovin, D., & Krause, A. (2010). Adaptive submodularity: A new approach to active learning and stochastic optimization. In International Conference on Learning Theory (COLT).
15. Hann, I., Hui, K., Lee, T., & Png, I. (2002). Online-information privacy: Measuring the cost-benefit tradeoff. In International Conference on Information Systems.
16. Heckerman, D., Horvitz, E., & Middleton, B. (1993). An approximate nonmyopic computation for value of information. IEEE Trans. Pattern Analysis and Machine Intelligence, 15, 292-298.
17. Hoeffding, W. (1963). Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301), 13-30.
18. Hore, B., & R. Jammalamadaka, S. M. (2007). Flexible anonymization for privacy preserving data publishing: A systematic search based approach. In SIAM Conference on Data Mining (SDM).
19. Horvitz, E. (2006). Machine learning, reasoning, and intelligence in daily life: Directions and challenges. Tech. rep. TR-2006-185, Microsoft Research.
20. Howard, R. A. (1966). Information value theory. In IEEE Transactions on Systems Science and Cybernetics (SSC-2).
21. Howard, R. A., & Matheson, J. (1984). Readings on the Principles and Applications of Decision Analysis II, chap. Influence Diagrams, pp. 719-762. Strategic Decision Group, Menlo Park. Reprinted 2005 in Decision Analysis 2(3) 127-143.
22. Huberman, B. A., Adar, E., & Fine, L. R. (2005). Valuating privacy. IEEE Security & Privacy, 3(5), 22-25.
23. Kapoor, A., Horvitz, E., & Basu, S. (2007). Selective supervision: Guiding supervised learning with decision-theoretic active learning. In International Joint Conference on Artificial Intelligence (IJCAI).
24. Kleinberg, J., Papadimitriou, C. H., & Raghavan, P. (2001). On the value of private information. TARK: Theoretical Aspects of Reasoning about Knowledge, 8.
25. Krause, A., & Guestrin, C. (2009). Optimal value of information in graphical models. Journal of Artificial Intelligence Research, 35, 557-591.
26. Krause, A., & Horvitz, E. (2008). A utility-theoretic approach to privacy and personalization. In Proc. 23rd Conference on Artificial Intelligence (AAAI), Special Track on AI & the Web.
27. Krause, A., & Guestrin, C. (2005). Near-optimal nonmyopic value of information in graphical models. In Conference on Uncertainty in Artificial Intelligence (UAI).
28. Lebanon, G., Scannapieco, M., Fouad, M. R., & Bertino, E. (2009). Beyond k-anonymity: A decision theoretic framework for assessing privacy risk. Transactions on Data Privacy, 2(3), 153-183.
29. LeFevre, K., DeWitt, D., & Ramakrishnan, R. (2006). Mondrian multidimensional k-anonymity. In IEEE International Conference on Data Engineering (ICDE).
30. Lindley, D. V. (1956). On a measure of the information provided by an experiment. Annals of Mathematical Statistics, 27, 986-1005.
31. Machanavajjhala, A., Kifer, D., Gehrke, J., & Venkitasubramaniam, M. (2006). L-diversity: Privacy beyond k-anonymity. In IEEE International Conference on Data Engineering (ICDE).
32. Nemhauser, G., Wolsey, L., & Fisher, M. (1978). An analysis of the approximations for maximizing submodular set functions. Mathematical Programming, 14, 265-294.
33. Nemhauser, G. L., & Wolsey, L. A. (1981). Studies on Graphs and Discrete Programming, chap. Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms, pp. 279-301. North-Holland.
34. Olson, J. S., Grudin, J., & Horvitz, E. (2005). A study of preferences for sharing and privacy. In ACM Conference on Human Factors in Computing Systems (CHI).
35. Robertazzi, T. G., & Schwartz, S. C. (1989). An accelerated sequential algorithm for producing D-optimal designs. SIAM Journal of Scientific and Statistical Computing, 10(2), 341-358.
36. Sugiyama, K., Hatano, K., & Ikoma, T. (2004). Adaptive web search based on user profile constructed without any effort from users. In World Wide Web Conference (WWW).
37. Sweeney, L. (2002). k-anonymity: a model for protecting privacy. International Journal on Uncertainty, Fuzziness and Knowledge-based Systems, 10(5), 557-570.
38. Teevan, J., Dumais, S. T., & Horvitz, E. (2005). Personalizing search via automated analysis of interests and activities. In International ACM SIGIR Conference.
39. van der Gaag, L., & Wessels, M. (1993). Selective evidence gathering for diagnostic belief networks. AISB Quart., 86, 23-34.
40. Wattal, S., Telang, R., Mukhopadhyay, T., & Boatwright, P. (2005). Examining the personalization-privacy tradeoff an empirical investigation with email advertisements. Management Science.
41. Xu, Y., Zhang, B., & Wang, K. (2007). Privacy-enhancing personalized web search. In World Wide Web Conference (WWW).