%0 Conference Paper %1 Liu:2002:PWS:584792.584884 %A Liu, Fang %A Yu, Clement %A Meng, Weiyi %B Proceedings of the Eleventh International Conference on Information and Knowledge Management %C New York, NY, USA %D 2002 %I ACM %K user_interest %P 558--565 %R 10.1145/584792.584884 %T Personalized Web Search by Mapping User Queries to Categories %U http://doi.acm.org/10.1145/584792.584884 %X Current web search engines are built to serve all users, independent of the needs of any individual user. Personalization of web search is to carry out retrieval for each user incorporating his/her interests. We propose a novel technique to map a user query to a set of categories, which represent the user's search intention. This set of categories can serve as a context to disambiguate the words in the user's query. A user profile and a general profile are learned from the user's search history and a category hierarchy respectively. These two profiles are combined to map a user query into a set of categories. Several learning and combining algorithms are evaluated and found to be effective. Among the algorithms to learn a user profile, we choose the Rocchio-based method for its simplicity, efficiency and its ability to be adaptive. Experimental results indicate that our technique to personalize web search is both effective and efficient. %@ 1-58113-492-4

@inproceedings{Liu:2002:PWS:584792.584884, abstract = {Current web search engines are built to serve all users, independent of the needs of any individual user. Personalization of web search is to carry out retrieval for each user incorporating his/her interests. We propose a novel technique to map a user query to a set of categories, which represent the user's search intention. This set of categories can serve as a context to disambiguate the words in the user's query. A user profile and a general profile are learned from the user's search history and a category hierarchy respectively. These two profiles are combined to map a user query into a set of categories. Several learning and combining algorithms are evaluated and found to be effective. Among the algorithms to learn a user profile, we choose the Rocchio-based method for its simplicity, efficiency and its ability to be adaptive. Experimental results indicate that our technique to personalize web search is both effective and efficient.}, acmid = {584884}, added-at = {2019-08-06T17:11:25.000+0200}, address = {New York, NY, USA}, author = {Liu, Fang and Yu, Clement and Meng, Weiyi}, biburl = {https://www.bibsonomy.org/bibtex/2dfc0b7a5dd50284ce638fd44c0ba3fb7/kerndr}, booktitle = {Proceedings of the Eleventh International Conference on Information and Knowledge Management}, description = {Personalized web search by mapping user queries to categories}, doi = {10.1145/584792.584884}, interhash = {58f9b50b7c99258fc7437363d1ca5e0c}, intrahash = {dfc0b7a5dd50284ce638fd44c0ba3fb7}, isbn = {1-58113-492-4}, keywords = {user_interest}, location = {McLean, Virginia, USA}, numpages = {8}, pages = {558--565}, publisher = {ACM}, series = {CIKM '02}, timestamp = {2019-08-06T17:11:25.000+0200}, title = {Personalized Web Search by Mapping User Queries to Categories}, url = {http://doi.acm.org/10.1145/584792.584884}, year = 2002 }