Web Search engine is most widely used for
information retrieval from World Wide Web. These Web
Search engines help user to find most useful information.
When different users Searches for same information, search
engine provide same result without understanding who is
submitted that query. Personalized web search it is search
technique for proving useful result. This paper models
preference of users as hierarchical user profiles. a
framework is proposed called UPS. It generalizes profile
and maintaining privacy requirement specified by user at
same time.
Published In:IJCSN Journal Volume 5, Issue 6
Date of Publication : December 2016
Pages : 854-858
Figures :02
Tables : --
Sharyu Utage : Computer Science and Engineering, Dr BAMU
Jawaharlal Nehru Engineering College, Aurangabad.
Vijaya Ahire : Computer Science and Engineering, Dr BAMU
Jawaharlal Nehru Engineering College, Aurangabad.
Profile, Privacy Protection, Personalized Web
Search, UPS, Generalization, Query
This paper presented a client-side privacy protection
framework called UPS for personalized web search. UPS
could potentially be adopted by any PWS that captures
user profiles in a hierarchical taxonomy. In this paper, we provide better efficiency results when compared with
existing system. It provides privacy mechanism when
adversaries retrieve the results by using background
knowledge. In this similarities are calculated based on the
similarity algorithm.
[1] Lidan Shou,He Bai, Ke Chen,and Gang Chen,
“Supporting privacy protection in personalized web
search ” ieee transactions on knowledge and data
engineering vol:26 no:2 year 2014
[2] 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.
[3] J. Teevan, S.T. Dumais, and E. Horvitz,
“Personalizing Search via Automated Analysis of
Interests and Activities,” Proc. 28th Ann. Int’l ACM
SIGIR Conf. Research and Development in
Information Retrieval (SIGIR), pp. 449-456, 2005
[4] M. Spertta and S. Gach, “Personalizing Search Based
on User Search Histories,” Proc. IEEE/WIC/ACM
Int’l Conf. Web Intelligence (WI), 2005
[5] B. Tan, X. Shen, and C. Zhai, “Mining Long-Term
Search History to Improve Search Accuracy,” Proc.
ACM SIGKDD Int’l Conf. Knowledge Discovery and
Data Mining (KDD), 2006
[6] K. Sugiyama, K. Hatano, and M. Yoshikawa,
“Adaptive Web Search Based on User Profile
Constructed without any Effort from Users,” Proc.
13th Int’l Conf. World Wide Web (WWW), 2004
[7] 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.
[8] 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
[9] 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
[10] 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.
[11] K. Hafner, Researchers Yearn to Use AOL Logs, but
They Hesitate, New York Times, Aug. 2006.
[12] A. Krause and E. Horvitz, “A Utility-Theoretic
Approach to Privacy in Online Services,” J. Artificial
Intelligence Research, vol. 39, pp. 633-662, 2010.
[13] J.S. Breese, D. Heckerman, and C.M. Kadie,
“Empirical Analysis of Predictive Algorithms for
Collaborative Filtering,” Proc. 14th Conf. Uncertainty
in Artificial Intelligence (UAI), pp. 43-52, 1998.
[14] 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.
[15] A. Pretschner and S. Gauch, “Ontology-Based
Personalized Search and Browsing,” Proc. IEEE 11th
Int’l Conf. Tools with Artificial Intelligence (ICTAI
’99), 1999.