ACM Home Page
Please provide us with feedback. Feedback
Discovering and using groups to improve personalized search
Full text PdfPdf (848 KB)
Source Web Search and Web Data Mining archive
Proceedings of the Second ACM International Conference on Web Search and Data Mining table of contents
Barcelona, Spain
SESSION: Web search table of contents
Pages 15-24  
Year of Publication: 2009
ISBN:978-1-60558-390-7
Authors
Jaime Teevan  Microsoft Research, Redmond, WA
Meredith Ringel Morris  Microsoft Research, Redmond, WA
Steve Bush  Microsoft Research, Redmond, WA
Sponsors
SIGMOD: ACM Special Interest Group on Management of Data
: Google
SIGIR: ACM Special Interest Group on Information Retrieval
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
: Yahoo! Research
Microsoft : Microsoft
: Nokia
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 55,   Downloads (12 Months): 351,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1498759.1498786
What is a DOI?

ABSTRACT

Personalized Web search takes advantage of information about an individual to identify the most relevant results for that person. A challenge for personalization lies in collecting user profiles that are rich enough to do this successfully. One way an individual's profile can be augmented is by using data from other people. To better understand whether groups of people can be used to benefit personalized search, we explore the similarity of query selection, desktop information, and explicit relevance judgments across people grouped in different ways. The groupings we explore fall along two dimensions: the longevity of the group members' relationship, and how explicitly the group is formed. We find that some groupings provide valuable insight into what members consider relevant to queries related to the group focus, but that it can be difficult to identify valuable groups implicitly. Building on these findings, we explore an algorithm to "groupize" (versus "personalize") Web search results that leads to a significant improvement in result ranking on group-relevant queries.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
3
4
 
5
Freyne, J. and Smyth, B. (2006). Cooperating search communities. In Proc. of AH '06, 101--110.
6
7
 
8
9
10
11
12
 
13
14
15
16
 
17
 
18
Sparck Jones, K., Walker, S., and Robertson, S. A. (1998). Probabilistic model of information retrieval: Development and status. TR-446, Cambridge University Computer Laboratory.
 
19
20
21
22
 
23
Teevan, J., Dumais, S. T., and Horvitz, E. (2005). Beyond the commons: On the value of personalizing Web search. In Proc. of PIA '05 Workshop, 84--92.
 
24
 
25
Voorhees, E. and Harman, D. (Eds.) (2005). TREC: Experimental Evaluation of Information Retrieval. MIT Press.

Collaborative Colleagues:
Jaime Teevan: colleagues
Meredith Ringel Morris: colleagues
Steve Bush: colleagues