2013
DOI: 10.1016/j.ins.2013.04.020
|View full text |Cite
|
Sign up to set email alerts
|

Utility preserving query log anonymization via semantic microaggregation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
19
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 34 publications
(20 citation statements)
references
References 42 publications
1
19
0
Order By: Relevance
“…There are different strategies to achieve this goal in the literature [20,[29][30][31], and we also have found in recent publications very similar approaches to the ones we had presented for the development of DisPA [32,33]. This shows a common interest of the research community towards the development of protocols that strive for a trade-off between utility and privacy in web search.…”
Section: Related Worksupporting
confidence: 67%
“…There are different strategies to achieve this goal in the literature [20,[29][30][31], and we also have found in recent publications very similar approaches to the ones we had presented for the development of DisPA [32,33]. This shows a common interest of the research community towards the development of protocols that strive for a trade-off between utility and privacy in web search.…”
Section: Related Worksupporting
confidence: 67%
“…Batet et al in [8] present a query anonymization method based on semantic micro aggregation which focuses on reducing the risk of query log disclosure while retaining the utility of the query logs at the same time. In this approach, the semantic concepts of the query logs are retrieved from Open Data Project.…”
Section: Related Workmentioning
confidence: 99%
“…Then, the relevance Re(q, e j ) between the concept e j and the query q is defined as the number of the titles of the concept e j that appear in the query q, i.e., Re(q, e j ) = |T (q) ∩ T (e j )|. (5) Let E(p i ) denote a set of concepts which belong to a topic p i , namely, each concept in E(p i ) is reachable to the topic p i along the categorization system of Wikipedia. Let depth(e j , p i ) denote the length of the shortest path from a concept e j to a topic p i in the categorization system of Wikipedia.…”
Section: Identifying User Intentionmentioning
confidence: 99%
“…It has been pointed out in [2,4] that the problem of disclosing user query intentions cannot be solved by using an anonymization scheme (e.g., those in [5,6]) to process a query log. For example, in 2006, AOL released an anonymized query log of around hundreds of thousands of randomly selected users [1,7].…”
Section: Introductionmentioning
confidence: 99%