Name
Abstract | ||
|---|---|---|
Trip planning is a useful technique that can find various applications in Location-Based Service systems. Though a lot of trip planning methods have been proposed, few of them have considered the possible constraints of POI sites in required types to be covered for user intended activities. In this paper, we study the problem of multiple-criterion-based trip search on categorical POI sites, to return users the trip that can maximize user satisfaction score within a given distance or travel time threshold. To address this problem, we propose a spatial sketch-based approximate algorithm, which extracts useful global information based on spatial clusters to guide effective trip search. The efficiency of query processing can be fully guaranteed because of the superior pruning effect on larger granularity. Experimental results on real dataset demonstrate the effectiveness of the proposed methods. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-18120-2_16 | DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, PT1 |
Field | DocType | Volume |
Data mining,Trip planning,Categorical variable,Computer science,Global information,Priority queue,Granularity,Travel time,Sketch | Conference | 9049 |
ISSN | Citations | PageRank |
0302-9743 | 1 | 0.37 |
References | Authors | |
17 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chenghao Zhu | 1 | 1 | 0.37 |
| Jiajie Xu | 2 | 58 | 10.08 |
| Chengfei Liu | 3 | 1402 | 127.17 |
| Pengpeng Zhao | 4 | 111 | 30.91 |
| An Liu | 5 | 147 | 21.72 |
| Lei Zhao | 6 | 119 | 11.92 |