Social relation based search refinement: Let your friends help you!

4Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Ren, X., Zeng, Y., Qin, Y., Zhong, N., Huang, Z., Wang, Y., & Wang, C. (2010). Social relation based search refinement: Let your friends help you! In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6335 LNCS, pp. 475–485). https://doi.org/10.1007/978-3-642-15470-6_48

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free