ACM Home Page
Please provide us with feedback. Feedback
Improving web search results using affinity graph
Full text PdfPdf (326 KB)
Source Annual ACM Conference on Research and Development in Information Retrieval archive
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval table of contents
Salvador, Brazil
SESSION: Web search 3 table of contents
Pages: 504 - 511  
Year of Publication: 2005
ISBN:1-59593-034-5
Authors
Benyu Zhang  Microsoft Research Asia, Beijing, P. R. China
Hua Li  Peking University, Beijing, P. R. China
Yi Liu  Michigan State University, East Lansing, MI
Lei Ji  Beijing Institute of Technology, Beijing, P. R. China
Wensi Xi  Virginia Polytechnic Institute and State University, Blacksburg, VA
Weiguo Fan  Virginia Polytechnic Institute and State University, Blacksburg, VA
Zheng Chen  Microsoft Research Asia, Beijing, P. R. China
Wei-Ying Ma  Microsoft Research Asia, Beijing, P. R. China
Sponsor
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 17,   Downloads (12 Months): 127,   Citation Count: 7
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1076034.1076120
What is a DOI?

ABSTRACT

In this paper, we propose a novel ranking scheme named Affinity Ranking (AR) to re-rank search results by optimizing two metrics: (1) diversity -- which indicates the variance of topics in a group of documents; (2) information richness -- which measures the coverage of a single document to its topic. Both of the two metrics are calculated from a directed link graph named Affinity Graph (AG). AG models the structure of a group of documents based on the asymmetric content similarities between each pair of documents. Experimental results in Yahoo! Directory, ODP Data, and Newsgroup data demonstrate that our proposed ranking algorithm significantly improves the search performance. Specifically, the algorithm achieves 31% improvement in diversity and 12% improvement in information richness relatively within the top 10 search results.


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
Calvo, R.A., Lee, J.-M. and Li, X. Managing Content with Automatic Document Classification. Journal of Digital Information, 5 (2).
3
 
4
 
5
Croft, W.B., Cronen-Townsend, S. and Larvrenko, V., Relevance feedback and personalization: A language modeling perspective. In Proceedings of the DELOS Network of Excellence Workshop on "Personalisation and Recommender Systems in Digital Libraries", (Dublin City University, Ireland, 2001).
 
6
DirectHit. http://www.directhit.com.
7
8
9
 
10
Lu, Q. and Getoor, L., Link-based Classification. In Proceedings of the International Conference on Machine Learning, (Washington DC, 2003), 496--503.
 
11
ODP. http://dmoz.org/.
 
12
Page, L., Brin, S., Motwani, R. and Windograd, T. The pagerank citation ranking: Bring order to the web, Stanford Digital Library Technologies Project, 1998.
 
13
Porter, M.F. An algorithm for suffix stripping Program, 1980, 130--137.
 
14
Robertson, S.E., Walker, S., Hancock-Beaulieu, M., Gull, A. and Lau, M., Okapi at TREC. In Proceedings of the Text REtrieval Conference, (1992), 21--30.
 
15
16
17
18

CITED BY  7
 
 

Collaborative Colleagues:
Benyu Zhang: colleagues
Hua Li: colleagues
Yi Liu: colleagues
Lei Ji: colleagues
Wensi Xi: colleagues
Weiguo Fan: colleagues
Zheng Chen: colleagues
Wei-Ying Ma: colleagues