Kθ-affinity privacy: Releasing infrequent query refinements safely
作者：
Highlights：
• A new affinity-based k-anonymity model that leverages query refinement patterns.
• A novel notion of generalized graph k-cores.
• A link between k-anonymity and k-cores.
• A novel evaluation test based on sensitive and non-sensitive queries.
• A comparison between k-anonymity under affinity and under WordNet generalization.
摘要
•A new affinity-based k-anonymity model that leverages query refinement patterns.•A novel notion of generalized graph k-cores.•A link between k-anonymity and k-cores.•A novel evaluation test based on sensitive and non-sensitive queries.•A comparison between k-anonymity under affinity and under WordNet generalization.
论文关键词：kΘ-affinity privacy,Search log anonymization,Semantic k-anonymity,n-grams,Graph k-cores,Query expansion
论文评审过程：Received 3 April 2014, Revised 24 October 2014, Accepted 31 October 2014, Available online 28 November 2014.
论文官网地址：https://doi.org/10.1016/j.ipm.2014.10.009
