ACM Home Page
Please provide us with feedback. Feedback
Learning latent semantic relations from clickthrough data for query suggestion
Full text PdfPdf (293 KB)
Source
Conference on Information and Knowledge Management archive
Proceeding of the 17th ACM conference on Information and knowledge management table of contents
Napa Valley, California, USA
SESSION: IR: web search 2 table of contents
Pages 709-718  
Year of Publication: 2008
ISBN:978-1-59593-991-3
Authors
Hao Ma  The Chinese University of Hong Kong, N.T., Hong Kong
Haixuan Yang  The Chinese University of Hong Kong, N.T., Hong Kong
Irwin King  The Chinese University of Hong Kong, N.T., Hong Kong
Michael R. Lyu  The Chinese University of Hong Kong, N.T., Hong Kong
Sponsors
ACM: Association for Computing Machinery
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 23,   Downloads (12 Months): 223,   Citation Count: 3
Additional Information:

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

ABSTRACT

For a given query raised by a specific user, the Query Suggestion technique aims to recommend relevant queries which potentially suit the information needs of that user. Due to the complexity of the Web structure and the ambiguity of users' inputs, most of the suggestion algorithms suffer from the problem of poor recommendation accuracy. In this paper, aiming at providing semantically relevant queries for users, we develop a novel, effective and efficient two-level query suggestion model by mining clickthrough data, in the form of two bipartite graphs (user-query and query-URL bipartite graphs) extracted from the clickthrough data. Based on this, we first propose a joint matrix factorization method which utilizes two bipartite graphs to learn the low-rank query latent feature space, and then build a query similarity graph based on the features. After that, we design an online ranking algorithm to propagate similarities on the query similarity graph, and finally recommend latent semantically relevant queries to users. Experimental analysis on the clickthrough data of a commercial search engine shows the effectiveness and the efficiency of our method.


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
R. A. Baeza-Yates, C. A. Hurtado, and M. Mendoza. Query recommendation using query logs in search engines. In EDBT Workshops, pages 588--596, 2004.
4
 
5
6
 
7
 
8
G. Dupret and M. Mendoza. Automatic query recommendation using click-through data. In IFIP PPAI, pages 303--312, 2006.
9
10
 
11
D. Gleich and L. Zhukov. Svd subspace projections for term suggestion ranking and clustering. In Technical Report of Yahoo! Research Labs, 2004.
12
13
14
15
 
16
17
 
18
19
 
20
 
21
L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. In Technical Report Paper SIDL-WP-1999-0120 (version of 11/11/1999), 1999.
 
22
M. Pasca and B. V. Durme. What you seek is what you get: Extraction of class attributes from query logs. In IJCAI '07: Proceedings of International Joint Conferences on Artificial Intelligence, pages 2832--2837, 2007.
23
 
24
D. Shen, M. Qin, W. Chen, Q. Yang, and Z. Chen. Mining web query hierarchies from clickthrough data. In AAAI '07: Proceedings of the 22th Conference on Artificial Intelligence, pages 341--346, 2007.
25
26
27
28
29
30
31
32
33
34


Collaborative Colleagues:
Hao Ma: colleagues
Haixuan Yang: colleagues
Irwin King: colleagues
Michael R. Lyu: colleagues