| Discovering co-located queries in geographic search logs |
| Full text |
Pdf
(859 KB)
|
Source
|
ACM International Conference Proceeding Series; Vol. 300
archive
Proceedings of the first international workshop on Location and the web
table of contents
Beijing, China
Pages 77-84
Year of Publication: 2008
ISBN:978-1-60558-160-6
|
|
Authors
|
|
Xiangye Xiao
|
Hong Kong University of Science and Technology, Hong Kong
|
|
Longhao Wang
|
Microsoft Research Asia, Beijing, P. R. China
|
|
Xing Xie
|
Microsoft Research Asia, Beijing, P. R. China
|
|
Qiong Luo
|
Hong Kong University of Science and Technology, Hong Kong
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 7, Downloads (12 Months): 88, Citation Count: 0
|
|
|
ABSTRACT
A geographic search request contains a query consisting of one or more keywords, and a search-location that the user searches for. In this paper, we study the problem of discovering co-located queries, which are geographic search requests for nearby search-locations. One example co-located query pattern is {"shopping mall", "parking"}. This pattern indicates that people often search "shopping mall" and "parking" over locations close to one another. Co-located queries have many applications, such as query suggestion, location recommendation, and local advertisement. We formally define co-located query patterns and propose two approaches to mining the patterns. Our basic approach is based on an existing spatial mining algorithm. To find more specific co-located queries that only appear in specific regions, we propose a lattice based approach. It divides the geographic space into regions and mines patterns in each region. We also define a locality measure to categorize patterns into local and global. Experimental results show that the lattice based approach outperforms the basic approach in the number of patterns, the quality of patterns, and the proportion of local patterns.
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
|
N. Cressie. Statistics for Spatial Data. 1991.
|
 |
4
|
|
| |
5
|
B. Davison, D. Deschenes, and D. Lewanda. Finding Relevant Website Queries. Proc. of WWW'2003, 2003.
|
| |
6
|
|
| |
7
|
B. Fonseca, P. Golgher, E. de Moura, B. Possas, and N. Ziviani. Discovering search engine related queries using association rules. Journal of Web Engineering, 2(4):215--227, 2004.
|
 |
8
|
|
| |
9
|
|
| |
10
|
|
 |
11
|
Lee Wang , Chuang Wang , Xing Xie , Josh Forman , Yansheng Lu , Wei-Ying Ma , Ying Li, Detecting dominant locations from search queries, Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval, August 15-19, 2005, Salvador, Brazil
[doi> 10.1145/1076034.1076107]
|
 |
12
|
|
 |
13
|
|
| |
14
|
Y. S. J. D. S. Asadi, J. Xu and X. Zhou. Calculation of Target Locations for Web Resources. Proc. of WISE, pages 277--288, 2006.
|
| |
15
|
M. Sanderson and J. Kohler. Analyzing geographic queries. In Proc. of the ACM SIGIR Workshop on GIR, 2004.
|
 |
16
|
|
 |
17
|
|
 |
18
|
|
 |
19
|
Xin Zhang , Nikos Mamoulis , David W. Cheung , Yutao Shou, Fast mining of spatial collocations, Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, August 22-25, 2004, Seattle, WA, USA
[doi> 10.1145/1014052.1014095]
|
|