Email this article A protection PWS system UPS to sum up profiles as per client security prerequisites
Abstract
Personalized web search 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.
References
Z. Dou, R. Song, and J.-R. Wen, “A Large-Scale Evaluation andAnalysis of Personalized Search Strategies,” Proc. Int’l Conf. WorldWide Web (WWW), pp. 581-590, 2007.
J. Teevan, S.T. Dumais, and E. Horvitz, “Personalizing Search viaAutomated Analysis of Interests and Activities,” Proc. 28th Ann.Int’l ACM SIGIR Conf. Research and Development in InformationRetrieval (SIGIR), pp. 449-456, 2005.
M. Spertta and S. Gach, “Personalizing Search Based on UserSearch Histories,” Proc. IEEE/WIC/ACM Int’l Conf. Web Intelligence(WI), 2005.
B. Tan, X. Shen, and C. Zhai, “Mining Long-Term Search Historyto Improve Search Accuracy,” Proc. ACM SIGKDD Int’l Conf.Knowledge Discovery and Data Mining (KDD), 2006.
K. Sugiyama, K. Hatano, and M. Yoshikawa, “Adaptive WebSearch Based on User Profile Constructed without any Effortfrom Users,” Proc. 13th Int’l Conf. World Wide Web (WWW),2004.
X. Shen, B. Tan, and C. Zhai, “Implicit User Modeling forPersonalized Search,” Proc. 14th ACM Int’l Conf. Information andKnowledge Management (CIKM), 2005.
X. Shen, B. Tan, and C. Zhai, “Context-Sensitive InformationRetrieval Using Implicit Feedback,” Proc. 28th Ann. Int’l ACMSIGIR Conf. Research and Development Information Retrieval (SIGIR),
F. Qiu and J. Cho, “Automatic Identification of User Interest forPersonalized Search,” Proc. 15th Int’l Conf. World Wide Web(WWW), pp. 727-736, 2006.
J. Pitkow, H. Schu¨ tze, T. Cass, R. Cooley, D. Turnbull, A.Edmonds, E. Adar, and T. Breuel, “Personalized Search,” Comm.ACM, vol. 45, no. 9, pp. 50-55, 2002.
Y. Xu, K. Wang, B. Zhang, and Z. Chen, “Privacy-EnhancingPersonalized Web Search,” Proc. 16th Int’l Conf. World Wide Web(WWW), pp. 591-600, 2007.
K. Hafner, Researchers Yearn to Use AOL Logs, but They Hesitate,New York Times, Aug. 2006.
A. Krause and E. Horvitz, “A Utility-Theoretic Approach toPrivacy in Online Services,” J. Artificial Intelligence Research,vol. 39, pp. 633-662, 2010.
Refbacks
- There are currently no refbacks.
Copyright © 2013, All rights reserved.| ijseat.com
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.