Personalized web search (PWS) has verified its
usefulness in refining the quality of various search
amenities on the Internet. On the other hand, testimonies
show that users’ unwillingness to reveal their private facts
during search has turn out to be a major barrier for the
wide proliferation of PWS, which makes search result
based on the individual data of user provided to the search
provider. Conversely, users’ unwillingness to share their
private information for the period of search has become
the major barrier for personalized web search. This paper
replicas preference of users as hierarchical user profiles. It
proposes a background called UPS which overgeneralizes
profile at the same time preserving privacy obligation
specified by user. Two greedy algorithms specifically
GreedyDP and GreedyIL are used for runtime
generalization.
Published In : IJCAT Journal Volume 2, Issue 7
Date of Publication : July 2015
Pages : 269 - 272
Figures :03
Tables : --
Publication Link :Overgeneralizing User Profile and Preserving
Privacy in PWS
Neeratti Sandhya Rani : M.Tech, SE, Ganapati Engineering College, Warangal, Telengana, India
Ranjith Khana : Asst. Professor, CSE, Ganapati Engineering College, Warangal, Telengana, India
Utility
Risk
Profile
Personalized Web
Search
Privacy Protection
A client side privacy protection framework named UPS
i.e User customizable Privacy preserving Search is
presented in the paper. Any PWS can become
accustomed UPS for creating user profile in hierarchical
taxonomy. UPS lets user to specify the privacy
requirement and thus the personal information of user
profile is kept private without conceding the search
quality. UPS framework implements two greedy
algorithms for this purpose, namely GreedyDP and
GreedyIL.
[1] Z. Dou, R. Song, and J.-R. Wen, “A Large-Scale
Evaluation and Analysis of Personalized Search
Strategies,” Proc. Int’l Conf. World Wide Web
(WWW), pp. 581-590, 2007.
[2] M. Spertta and S. Gach, “Personalizing Search Based
on User Search Histories,” Proc. IEEE/WIC/ACM
Int’l Conf. Web Intelligence (WI), 2005.
[3] Y. Xu, K. Wang, B. Zhang, and Z. Chen, “Privacy-
Enhancing Personalized Web Search,” Proc. 16th
Int’l Conf. World Wide Web (WWW), pp. 591-600,
2007.
[4] P.A. Chirita, W. Nejdl, R. Paiu, and C. Kohlschu ¨
tter, “Using ODP Metadata to Personalize Search,”
Proc. 28th Ann. Int’l ACM SIGIR Conf. Research
and Development Information Retrieval (SIGIR),
2005.
[5] A. Pretschner and S. Gauch, “Ontology-Based
Personalized Search and Browsing,” Proc. IEEE 11th
Int’l Conf. Tools with Artificial Intelligence (ICTAI
’99), 1999.
[6] X. Shen, B. Tan, and C. Zhai, “Implicit User
Modeling for Personalized Search,” Proc. 14th ACM
Int’l Conf. Information and Knowledge Management
(CIKM), 2005.
[7] X. Shen, B. Tan, and C. Zhai, “Context-Sensitive
Information Retrieval Using Implicit Feedback,”
Proc. 28th Ann. Int’l ACM SIGIR Conf. Research
and Development Information Retrieval (SIGIR),
2005.
[8] F. Qiu and J. Cho, “Automatic Identification of User
Interest for Personalized Search,” Proc. 15th Int’l
Conf. World Wide Web (WWW), pp. 727-736,
2006.
