Proposal of a Personalized Web Search Framework for Query Personalization and User Specified Privacy Requirements

A. Sruthi, Y. Sandeep, G. Manoj Someswar


Personalized web search (PWS) has demonstrated its effectiveness in improving the quality of various search services on the Internet. However, evidences show that users’ reluctance to disclose their private information during search has become a major barrier for the wide proliferation of PWS. We study privacy protection in PWS applications that model user preferences as hierarchical user profiles. We propose a PWS framework called UPS that can adaptively generalize profiles by queries while respecting user-specified privacy requirements. Our runtime generalization aims at striking a balance between two predictive metrics that evaluate the utility of personalization and the privacy risk of exposing the generalized profile. We present two greedy algorithms, namely GreedyDP and GreedyIL, for runtime generalization. We also provide an online prediction mechanism for deciding whether personalizing a query is beneficial. Extensive experiments demonstrate the effectiveness of our framework. The experimental results also reveal that GreedyIL significantly outperforms GreedyDP in terms of efficiency.
KEYWORDS: World Wide Web (WWW); Chi Square Automatic Interaction Detection (CHAID); Nearest Neighbour Method; Rule Induction; Data Visualization; Classification and Regression Trees(CART)

Full Text:


Copyright (c) 2016 A. Sruthi, Y. Sandeep, G. Manoj Someswar

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.


All published Articles are Open Access at 

Paper submission: