ACM Home Page
Please provide us with feedback. Feedback
Context-aware query classification
Full text PdfPdf (761 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: Classification and clustering table of contents
Pages 3-10  
Year of Publication: 2009
ISBN:978-1-60558-483-6
Authors
Huanhuan Cao  Univesity of Science and Technology of China, Hefei, China
Derek Hao Hu  Hong Kong University of Science and Technology, Hong Kong, China
Dou Shen  Micosoft Coporation, Redmond, USA
Daxin Jiang  Microsoft Research Asia, Beijing, China
Jian-Tao Sun  Microsoft Research Asia, Beijing, China
Enhong Chen  University of Science and Thechnology of China, Hefei, China
Qiang Yang  Hong Kong Univesity of Science and Thechnology , Hong Kong, China
Sponsors
SIGIR: ACM Special Interest Group on Information Retrieval
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 140,   Downloads (12 Months): 417,   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.1571945
What is a DOI?

ABSTRACT

Understanding users'search intent expressed through their search queries is crucial to Web search and online advertisement. Web query classification (QC) has been widely studied for this purpose. Most previous QC algorithms classify individual queries without considering their context information. However, as exemplified by the well-known example on query "jaguar", many Web queries are short and ambiguous, whose real meanings are uncertain without the context information. In this paper, we incorporate context information into the problem of query classification by using conditional random field (CRF) models. In our approach, we use neighboring queries and their corresponding clicked URLs (Web pages) in search sessions as the context information. We perform extensive experiments on real world search logs and validate the effectiveness and effciency of our approach. We show that we can improve the F1 score by 52% as compared to other state-of-the-art baselines.


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
 
7
Broder, A., Z. A taxonomy of web search. In SIGIR Forums pages 3---10, 2002.
8
9
10
11
12
13
14
 
15
He, D., et al. Detecting session boundaries from Web user logs. In Proceedings of BCS-IRSG 22nd Annual Colloquium on Information Retrieval Research, pages 57--66, 2000.
 
16
17
18
 
19
20
21
 
22
Mccallum, A. Efficiently inducing features of conditional random fields. In UAI'03, pages 403--410, 2003.
23
24
25
 
26
27
28
29

Collaborative Colleagues:
Huanhuan Cao: colleagues
Derek Hao Hu: colleagues
Dou Shen: colleagues
Daxin Jiang: colleagues
Jian-Tao Sun: colleagues
Enhong Chen: colleagues
Qiang Yang: colleagues