ACM Home Page
Please provide us with feedback. Feedback
Time-dependent semantic similarity measure of queries using historical click-through data
Full text PdfPdf (348 KB)
Source International World Wide Web Conference archive
Proceedings of the 15th international conference on World Wide Web table of contents
Edinburgh, Scotland
SESSION: Data mining table of contents
Pages: 543 - 552  
Year of Publication: 2006
ISBN:1-59593-323-9
Authors
Qiankun Zhao  Nanyang Technological University, Singapore
Steven C. H. Hoi  The Chinese University of HK, Hong Kong, China
Tie-Yan Liu  Microsoft Research Asia, Beijing, China
Sourav S. Bhowmick  Nanyang Technological University, Singapore
Michael R. Lyu  The Chinese University of HK, Hong Kong, China
Wei-Ying Ma  Microsoft Research Asia, Beijing, China
Sponsors
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 17,   Downloads (12 Months): 145,   Citation Count: 2
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/1135777.1135858
What is a DOI?

ABSTRACT

It has become a promising direction to measure similarity of Web search queries by mining the increasing amount of click-through data logged by Web search engines, which record the interactions between users and the search engines. Most existing approaches employ the click-through data for similarity measure of queries with little consideration of the temporal factor, while the click-through data is often dynamic and contains rich temporal information. In this paper we present a new framework of time-dependent query semantic similarity model on exploiting the temporal characteristics of historical click-through data. The intuition is that more accurate semantic similarity values between queries can be obtained by taking into account the timestamps of the log data. With a set of user-defined calendar schema and calendar patterns, our time-dependent query similarity model is constructed using the marginalized kernel technique, which can exploit both explicit similarity and implicit semantics from the click-through data effectively. Experimental results on a large set of click-through data acquired from a commercial search engine show that our time-dependent query similarity model is more accurate than the existing approaches. Moreover, we observe that our time-dependent query similarity model can, to some extent, reflect real-world semantics such as real-world events that are happening over time.


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
S. Deerwester, S. Dumais, G. Furnas, T. Landauer, and R. Harshman. Indexing by latent semantic analysis. Journal of the American Society for Information Science, 41:391--407, 1990.
 
8
T. Heath, E. Motta, and M. Dzbor. Uses of contextual information to support online tasks. In Proceedings of International World Wide Web Conference, pages 1102--1103, 2005.
9
10
 
11
H. Kashima, K. Tsuda, and A. Inokuchi. Marginalized kernels between labeled graphs. In Proceedings of International Conference on Machine Learning, pages 321--328, 2003.
12
13
14
 
15
K. Tsuda, T. Kin, and K. Asai. Marginalized kernels for biological sequences. Bioinformatics, 18(1):268--275, 2002.
16
17
 
18
L. Wang, C. Wang, X. Xie, J. Forman, Y. Lu, W.-Y. Ma, and Y. Li. Detecting dominant locations from search queries. In International Conference on Machine Learning, pages 321--328, 2003.
19
20
21


Collaborative Colleagues:
Qiankun Zhao: colleagues
Steven C. H. Hoi: colleagues
Tie-Yan Liu: colleagues
Sourav S. Bhowmick: colleagues
Michael R. Lyu: colleagues
Wei-Ying Ma: colleagues