Stochastic Privacy
暂无分享,去创建一个
[1] Andreas Krause,et al. Distributed Submodular Maximization: Identifying Representative Elements in Massive Data , 2013, NIPS.
[2] Andreas Krause,et al. A Utility-Theoretic Approach to Privacy in Online Services , 2010, J. Artif. Intell. Res..
[3] Filip Radlinski,et al. Inferring and using location metadata to personalize web search , 2011, SIGIR.
[4] Susan T. Dumais,et al. Classification-enhanced ranking , 2010, WWW '10.
[5] Carlos Guestrin,et al. A Note on the Budgeted Maximization of Submodular Functions , 2005 .
[6] Ali S. Hadi,et al. Finding Groups in Data: An Introduction to Chster Analysis , 1991 .
[7] Ryen W. White,et al. Sampling high-quality clicks from noisy click data , 2010, WWW '10.
[8] Eric Horvitz. Stochastic Privacy Extended Version , 2014 .
[9] Peter J. Rousseeuw,et al. Finding Groups in Data: An Introduction to Cluster Analysis , 1990 .
[10] Ryen W. White,et al. Personalized models of search satisfaction , 2013, CIKM.
[11] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[12] Alissa Cooper,et al. A survey of query log privacy-enhancing techniques from a policy perspective , 2008, TWEB.
[13] Andreas Krause,et al. Near-optimal Observation Selection using Submodular Functions , 2007, AAAI.
[14] Ke Wang,et al. Privacy-enhancing personalized web search , 2007, WWW '07.
[15] Andreas Krause,et al. A Utility-Theoretic Approach to Privacy and Personalization , 2008, AAAI.
[16] Ryen W. White,et al. Characterizing the influence of domain expertise on web search behavior , 2009, WSDM '09.
[17] Jonathan Grudin,et al. A study of preferences for sharing and privacy , 2005, CHI Extended Abstracts.
[18] Vitaly Shmatikov,et al. Robust De-anonymization of Large Sparse Datasets , 2008, 2008 IEEE Symposium on Security and Privacy (sp 2008).
[19] Eytan Adar,et al. User 4XXXXX9: Anonymizing Query Logs , 2007 .