ACM Home Page
Please provide us with feedback. Feedback
A probabilistic topic-based ranking framework for location-sensitive domain information retrieval
Full text PdfPdf (634 KB)
Source
Annual ACM Conference on Research and Development in Information Retrieval archive
Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval table of contents
Boston, MA, USA
SESSION: Vertical search table of contents
Pages 331-338  
Year of Publication: 2009
ISBN:978-1-60558-483-6
Authors
Huajing Li  The Pennsylvania State University, University Park, PA, USA
Zhisheng Li  The Shenzhen Institute of Advanced Technology, Shenzhen, China
Wang-Chien Lee  The Pennsylvania State University, University Park, PA, USA
Dik Lun Lee  Hong Kong University of Science and Technology, Hong Kong, Hong Kong
Sponsors
SIGIR: ACM Special Interest Group on Information Retrieval
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 73,   Downloads (12 Months): 213,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

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

ABSTRACT

It has been observed that many queries submitted to search engines are location-sensitive. Traditional search techniques fail to interpret the significance of such geographical clues and as such are unable to return highly relevant search results. Although there have been efforts in the literature to support location-aware information retrieval, critical challenges still remain in terms of search result quality and data scalability. In this paper, we propose an innovative probabilistic ranking framework for domain information retrieval where users are interested in a set of location-sensitive topics. Our proposed method recognizes the geographical distribution of topic influence in the process of ranking documents and models it accurately using probabilistic Gaussian Process classifiers. Additionally, we demonstrate the effectiveness of the proposed ranking framework by implementing it in a Web search service for NBA news. Extensive performance evaluation is performed on real Web document collections, which confirms that our proposed mechanism works significantly better (around 29.7% averagely using DCG20 measure) than other popular location-aware information retrieval techniques in ranking quality.


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
 
6
O. Buyukkokten, J. Cho, H. Garcia-molina, L. Gravano, and N. Shivakumar. Exploiting geographical location information of web pages. In Proc. of WebDB 1999, pages 91--96, 1999.
7
8
 
9
 
10
 
11
T. Hofmann. Probabilistic latent semantic analysis. In Proc. of UAI 1999, Stockholm, 1999.
 
12
13
 
14
C.B. Jones, A.I. Abdelmoty, D. Finch, G. Fu, and S. Vaid. The spirit spatial search engine: Architecture, ontologies and spatial indexing. In GIScience, pages 125--139, 2004.
 
15
N. Lawrence, M. Seeger, and R. Herbrich. Fast sparse gaussian process methods: The informative vector machine. In Advances in Neural Information Processing Systems 15, pages 609--616, 2003.
16
17
18
 
19
 
20
M. Rosen-Zvi, T. Griffiths, P. Smyth, and M. Steyvers. Learning author topic models from text corpora. Technical report, November 2005.
 
21
M. Seeger and M.I. Jordan. Sparse gaussian process classification with multiple classes. Technical report, 2004.
22

Collaborative Colleagues:
Huajing Li: colleagues
Zhisheng Li: colleagues
Wang-Chien Lee: colleagues
Dik Lun Lee: colleagues