Social Relation Based Search Refinement: Let Your Friends Help You!

One of the major problems for search at Web scale is that the search results on the large scale data might be huge and the users have to browse to find the most relevant ones. Plus, due to the reason for the context, user requirement may diverse although the input query may be the same. In this paper, we try to achieve scalability for Web search through social relation diversity of different users. Namely, we utilize one of the major context for users, social relations, to help refining the search process. Social network based group interest models are developed according to collaborative networks, and is designed to be used in more wider range of Web scale search tasks. The experiments are based on the SwetoDBLP dataset, and we can conclude that proposed method is potentially effective to help users find most relevant search results in the Web environment. Keywords. social relation, retained interest, social network based group interest model, personalized search, search refinement.

• Type: Conference
• Year: 2010
• Where: AMT
• Authors: Xu Ren, Yi Zeng, Yulin Qin, Ning Zhong, Zhisheng Huang, Yan Wang, Cong Wang
• Keywords: AMT 2010, Multimedia, Network Based Group, Social Relation, Web Scale