ACM Home Page
Please provide us with feedback. Feedback
Exploring social annotations for information retrieval
Full text PdfPdf (236 KB)
Source
International World Wide Web Conference archive
Proceeding of the 17th international conference on World Wide Web table of contents
Beijing, China
SESSION: Social networks: applications and infrastructures table of contents
Pages 715-724  
Year of Publication: 2008
ISBN:978-1-60558-085-2
Authors
Ding Zhou  Facebook Inc., Palo Alto, CA, USA
Jiang Bian  Georgia Institute of Technology, Atlanta, GA, USA
Shuyi Zheng  The Pennsylvania State University, University Park, PA, USA
Hongyuan Zha  Georgia Institute of Technology, Atlanta, GA, USA
C. Lee Giles  The Pennsylvania State University, University Park, PA, USA
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 31,   Downloads (12 Months): 318,   Citation Count: 7
Additional Information:

abstract   references   cited by   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/1367497.1367594
What is a DOI?

ABSTRACT

Social annotation has gained increasing popularity in many Web-based applications, leading to an emerging research area in text analysis and information retrieval. This paper is concerned with developing probabilistic models and computational algorithms for social annotations. We propose a unified framework to combine the modeling of social annotations with the language modeling-based methods for information retrieval. The proposed approach consists of two steps: (1) discovering topics in the contents and annotations of documents while categorizing the users by domains; and (2) enhancing document and query language models by incorporating user domain interests as well as topical background models. In particular, we propose a new general generative model for social annotations, which is then simplified to a computationally tractable hierarchical Bayesian network. Then we apply smoothing techniques in a risk minimization framework to incorporate the topical information to language models. Experiments are carried out on a real-world annotation data set sampled from del.icio.us. Our results demonstrate significant improvements over the traditional approaches.


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
T. Berners-Lee, J. Hendler, and O. Lassila. The semantic web. Scientific American, 284(5):34--43, 2001.
 
2
3
 
4
 
5
T. Griffiths and M. Steyvers. Finding scientific topics. In National Academy of Sciences, 2004.
 
6
A. Hotho, R. Jaschke, C. Schmitz, and G. Stumme. Information retrieval in folksonomies: Search and ranking. In Y. Sure and J. Domingue, editors, The Semantic Web: Research and Applications, volume 4011 of LNAI, pages 411--426, Heidelberg, June 2006. Springer.
 
7
8
 
9
F. Jelinek and R. Mercer. Interpolated estimation of markov source parameters from sparse data. In Pattern recognition in Practice, 1980.
10
11
12
 
13
A. K. McCallum. Multi-label text classification with a mixture model trained by em. In AAAI?09 Workshop on Text Learning, 1999.
14
15
 
16
 
17
18
 
19
20
21
22

CITED BY  7

Collaborative Colleagues:
Ding Zhou: colleagues
Jiang Bian: colleagues
Shuyi Zheng: colleagues
Hongyuan Zha: colleagues
C. Lee Giles: colleagues