skip to main content
10.1145/2911451.2914753acmconferencesArticle/Chapter ViewAbstractPublication PagesirConference Proceedingsconference-collections
short-paper

Topic Model based Privacy Protection in Personalized Web Search

Published: 07 July 2016 Publication History

Abstract

Modern search engines utilize users' search history for personalization, which provides more effective, useful and relevant search results. However, it also has the potential risk of revealing users' privacy by identifying their underlying intention from their logged search behaviors. To address this privacy issue, we proposed a Topic-based Privacy Protection solution on client side. In our solution, each user query will be submitted with k additional cover queries, which will act as a proxy to disguise users' intent from a search engine. The set of cover queries are generated in a controlled way so that each query carries similar uncertainty to randomize a user's search history while still providing necessary utility for the search engine to perform personalization. We used statistical topic models to infer topics from the original user query and generated cover queries of similar entropy but from unrelated topics. Extensive experiments are performed on AOL search log and the promising results demonstrated the effectiveness of our solution.

References

[1]
M. Barbaro, T. Zeller, and S. Hansell. A face is exposed for aol searcher no. 4417749. New York Times, 9(2008):8For, 2006.
[2]
D. M. Blei. Probabilistic topic models. Communications of the ACM, 55(4):77--84, 2012.
[3]
G. Chen, H. Bai, L. Shou, K. Chen, and Y. Gao. Ups: efficient privacy protection in personalized web search. In Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval, pages 615--624. ACM, 2011.
[4]
B. Chor, E. Kushilevitz, O. Goldreich, and M. Sudan. Private information retrieval. Journal of the ACM (JACM), 45(6):965--981, 1998.
[5]
D. Greene and P. Cunningham. Practical solutions to the problem of diagonal dominance in kernel document clustering. In Proc. 23rd International Conference on Machine learning (ICML?06), pages 377--384. ACM Press, 2006.
[6]
D. Halse et al. I know what you did last summer. Advocate: Newsletter of the National Tertiary Education Union, 21(1):14, 2014.
[7]
M. Murugesan and C. Clifton. Providing privacy through plausibly deniable search. In SDM, pages 768--779. SIAM, 2009.
[8]
H. Pang, X. Ding, and X. Xiao. Embellishing text search queries to protect user privacy. Proceedings of the VLDB Endowment, 3(1-2):598--607, 2010.
[9]
G. Pass, A. Chowdhury, and C. Torgeson. A picture of search. In InfoScale, volume 152, page 1, 2006.
[10]
D. Sánchez, J. Castellà-Roca, and A. Viejo. Knowledge-based scheme to create privacy-preserving but semantically-related queries for web search engines. Information Sciences, 218:17--30, 2013.
[11]
X. Shen, B. Tan, and C. Zhai. Implicit user modeling for personalized search. In Proceedings of the 14th ACM international conference on Information and knowledge management, pages 824--831. ACM, 2005.
[12]
L. Shou, H. Bai, K. Chen, and G. Chen. Supporting privacy protection in personalized web search. Knowledge and Data Engineering, IEEE Transactions on, 26(2):453--467, 2014.
[13]
Y. Xu, K. Wang, B. Zhang, and Z. Chen. Privacy-enhancing personalized web search. In Proceedings of the 16th international conference on World Wide Web, pages 591--600. ACM, 2007.
[14]
Y. Zhu, L. Xiong, and C. Verdery. Anonymizing user profiles for personalized web search. In Proceedings of the 19th international conference on World wide web, pages 1225--1226. ACM, 2010.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SIGIR '16: Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval
July 2016
1296 pages
ISBN:9781450340694
DOI:10.1145/2911451
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 July 2016

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. information retrieval
  2. personalized search
  3. privacy

Qualifiers

  • Short-paper

Funding Sources

  • Yahoo Academic Career Enhancement Award
  • National Science Foundation

Conference

SIGIR '16
Sponsor:

Acceptance Rates

SIGIR '16 Paper Acceptance Rate 62 of 341 submissions, 18%;
Overall Acceptance Rate 792 of 3,983 submissions, 20%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)17
  • Downloads (Last 6 weeks)2
Reflects downloads up to 28 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2023)Web Privacy: A Formal Adversarial Model for Query ObfuscationIEEE Transactions on Information Forensics and Security10.1109/TIFS.2023.326212318(2132-2143)Online publication date: 1-Jan-2023
  • (2023)Private Web Search Using Proxy-Query Based Query Obfuscation SchemeIEEE Access10.1109/ACCESS.2023.323500011(3607-3625)Online publication date: 2023
  • (2023)Privacy-aware document retrieval with two-level inverted indexingInformation Retrieval10.1007/s10791-023-09428-z26:1-2Online publication date: 17-Nov-2023
  • (2022)Proxy-Terms Based Query Obfuscation Technique for Private Web SearchIEEE Access10.1109/ACCESS.2022.314992910(17845-17863)Online publication date: 2022
  • (2022)City of Disguise: A Query Obfuscation Game on the ClueWebAdvances in Information Retrieval10.1007/978-3-030-99739-7_34(281-287)Online publication date: 10-Apr-2022
  • (2021)Efficient Query Obfuscation with KeyqueriesIEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology10.1145/3486622.3493950(154-161)Online publication date: 14-Dec-2021
  • (2021)FedMatchProceedings of the 30th ACM International Conference on Information & Knowledge Management10.1145/3459637.3482345(181-190)Online publication date: 26-Oct-2021
  • (2021)FedPS: A Privacy Protection Enhanced Personalized Search FrameworkProceedings of the Web Conference 202110.1145/3442381.3449936(3757-3766)Online publication date: 19-Apr-2021
  • (2021)OB-WSPES: A Uniform Evaluation System for Obfuscation-Based Web Search PrivacyIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2019.296244018:6(2719-2735)Online publication date: 1-Nov-2021
  • (2020)Global and Personalized Query Probability for Obfuscation-Based Web Search2020 IEEE International Conference on Knowledge Graph (ICKG)10.1109/ICBK50248.2020.00045(259-266)Online publication date: Aug-2020
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media