schliessen

Filtern

 

Bibliotheken

Trip Oriented Search on Activity Trajectory

Driven by the flourish of location-based services, trajectory search has received significant attentions in recent years. Different from existing studies that focus on searching trajectories with spatio-temporal information and text de-scriptions, we study a novel problem of searching trajectories w... Full description

Journal Title: Journal of Computer Science and Technology 2015, Vol.30(4), pp.745-761
Main Author: Chen, Wei
Other Authors: Zhao, Lei , Xu, Jia-Jie , Liu, Guan-Feng , Zheng, Kai , Zhou, Xiaofang
Format: Electronic Article Electronic Article
Language: English
Subjects:
ID: ISSN: 1000-9000 ; E-ISSN: 1860-4749 ; DOI: 10.1007/s11390-015-1558-6
Link: http://dx.doi.org/10.1007/s11390-015-1558-6
Zum Text:
SendSend as email Add to Book BagAdd to Book Bag
Staff View
recordid: springer_jour10.1007/s11390-015-1558-6
title: Trip Oriented Search on Activity Trajectory
format: Article
creator:
  • Chen, Wei
  • Zhao, Lei
  • Xu, Jia-Jie
  • Liu, Guan-Feng
  • Zheng, Kai
  • Zhou, Xiaofang
subjects:
  • trajectory search
  • rating score
  • activity trajectory
ispartof: Journal of Computer Science and Technology, 2015, Vol.30(4), pp.745-761
description: Driven by the flourish of location-based services, trajectory search has received significant attentions in recent years. Different from existing studies that focus on searching trajectories with spatio-temporal information and text de-scriptions, we study a novel problem of searching trajectories with spatial distance, activities, and rating scores. Given a query q with a threshold of distance, a set of activities, a start point S and a destination E , trip oriented search on activity trajectory (TOSAT) returns k trajectories that can cover the activities with the highest rating scores within the threshold of distance. In addition, we extend the query with an order, i.e., order-sensitive trip oriented search on activity trajectory (OTOSAT), which takes both the order of activities in a query q and the order of trajectories into consideration. It is very challenging to answer TOSAT and OTOSAT efficiently due to the structural complexity of trajectory data with rating information. In order to tackle the problem efficiently, we develop a hybrid index AC-tree to organize trajectories. Moreover, the optimized variant RAC + -tree and novel algorithms are introduced with the goal of achieving higher performance. Extensive experiments based on real trajectory datasets demonstrate that the proposed index structures and algorithms are capable of achieving high efficiency and scalability.
language: eng
source:
identifier: ISSN: 1000-9000 ; E-ISSN: 1860-4749 ; DOI: 10.1007/s11390-015-1558-6
fulltext: fulltext
issn:
  • 1860-4749
  • 18604749
  • 1000-9000
  • 10009000
url: Link


@attributes
ID1280930115
RANK0.07
NO1
SEARCH_ENGINEprimo_central_multiple_fe
SEARCH_ENGINE_TYPEPrimo Central Search Engine
LOCALfalse
PrimoNMBib
record
control
sourcerecordid10.1007/s11390-015-1558-6
sourceidspringer_jour
recordidTN_springer_jour10.1007/s11390-015-1558-6
sourcesystemOther
pqid1694929383
galeid421100654
display
typearticle
titleTrip Oriented Search on Activity Trajectory
creatorChen, Wei ; Zhao, Lei ; Xu, Jia-Jie ; Liu, Guan-Feng ; Zheng, Kai ; Zhou, Xiaofang
ispartofJournal of Computer Science and Technology, 2015, Vol.30(4), pp.745-761
identifier
subjecttrajectory search ; rating score ; activity trajectory
descriptionDriven by the flourish of location-based services, trajectory search has received significant attentions in recent years. Different from existing studies that focus on searching trajectories with spatio-temporal information and text de-scriptions, we study a novel problem of searching trajectories with spatial distance, activities, and rating scores. Given a query q with a threshold of distance, a set of activities, a start point S and a destination E , trip oriented search on activity trajectory (TOSAT) returns k trajectories that can cover the activities with the highest rating scores within the threshold of distance. In addition, we extend the query with an order, i.e., order-sensitive trip oriented search on activity trajectory (OTOSAT), which takes both the order of activities in a query q and the order of trajectories into consideration. It is very challenging to answer TOSAT and OTOSAT efficiently due to the structural complexity of trajectory data with rating information. In order to tackle the problem efficiently, we develop a hybrid index AC-tree to organize trajectories. Moreover, the optimized variant RAC + -tree and novel algorithms are introduced with the goal of achieving higher performance. Extensive experiments based on real trajectory datasets demonstrate that the proposed index structures and algorithms are capable of achieving high efficiency and scalability.
languageeng
source
version6
lds50peer_reviewed
links
openurl$$Topenurl_article
openurlfulltext$$Topenurlfull_article
backlink$$Uhttp://dx.doi.org/10.1007/s11390-015-1558-6$$EView_full_text_in_Springer_(Subscribers_only)
search
creatorcontrib
0Chen, Wei
1Zhao, Lei
2Xu, Jia-Jie
3Liu, Guan-Feng
4Zheng, Kai
5Zhou, Xiaofang
titleTrip Oriented Search on Activity Trajectory
descriptionDriven by the flourish of location-based services, trajectory search has received significant attentions in recent years. Different from existing studies that focus on searching trajectories with spatio-temporal information and text de-scriptions, we study a novel problem of searching trajectories with spatial distance, activities, and rating scores. Given a query q with a threshold of distance, a set of activities, a start point S and a destination E , trip oriented search on activity trajectory (TOSAT) returns k trajectories that can cover the activities with the highest rating scores within the threshold of distance. In addition, we extend the query with an order, i.e., order-sensitive trip oriented search on activity trajectory (OTOSAT), which takes both the order of activities in a query q and the order of trajectories into consideration. It is very challenging to answer TOSAT and OTOSAT efficiently due to the structural complexity of trajectory data with rating information. In order to tackle the problem efficiently, we develop a hybrid index AC-tree to organize trajectories. Moreover, the optimized variant RAC + -tree and novel algorithms are introduced with the goal of achieving higher performance. Extensive experiments based on real trajectory datasets demonstrate that the proposed index structures and algorithms are capable of achieving high efficiency and scalability.
subject
0trajectory search
1rating score
2activity trajectory
general
010.1007/s11390-015-1558-6
1English
2Springer Science & Business Media B.V.
3SpringerLink
sourceidspringer_jour
recordidspringer_jour10.1007/s11390-015-1558-6
issn
01860-4749
118604749
21000-9000
310009000
rsrctypearticle
creationdate2015
addtitle
0Journal of Computer Science and Technology
1J. Comput. Sci. Technol.
searchscopespringer_journals_complete
scopespringer_journals_complete
lsr30VSR-Enriched:[pqid, pages, galeid]
sort
titleTrip Oriented Search on Activity Trajectory
authorChen, Wei ; Zhao, Lei ; Xu, Jia-Jie ; Liu, Guan-Feng ; Zheng, Kai ; Zhou, Xiaofang
creationdate20150700
facets
frbrgroupid4466863469712796292
frbrtype5
languageeng
creationdate2015
topic
0Trajectory Search
1Rating Score
2Activity Trajectory
collectionSpringerLink
prefilterarticles
rsrctypearticles
creatorcontrib
0Chen, Wei
1Zhao, Lei
2Xu, Jia-Jie
3Liu, Guan-Feng
4Zheng, Kai
5Zhou, Xiaofang
jtitleJournal Of Computer Science And Technology
toplevelpeer_reviewed
delivery
delcategoryRemote Search Resource
fulltextfulltext
addata
aulast
0Chen
1Zhao
2Xu
3Liu
4Zheng
5Zhou
aufirst
0Wei
1Lei
2Jia-Jie
3Guan-Feng
4Kai
5Xiaofang
au
0Chen, Wei
1Zhao, Lei
2Xu, Jia-Jie
3Liu, Guan-Feng
4Zheng, Kai
5Zhou, Xiaofang
atitleTrip Oriented Search on Activity Trajectory
jtitleJournal of Computer Science and Technology
stitleJ. Comput. Sci. Technol.
risdate201507
volume30
issue4
spage745
epage761
issn1000-9000
eissn1860-4749
genrearticle
ristypeJOUR
abstractDriven by the flourish of location-based services, trajectory search has received significant attentions in recent years. Different from existing studies that focus on searching trajectories with spatio-temporal information and text de-scriptions, we study a novel problem of searching trajectories with spatial distance, activities, and rating scores. Given a query q with a threshold of distance, a set of activities, a start point S and a destination E , trip oriented search on activity trajectory (TOSAT) returns k trajectories that can cover the activities with the highest rating scores within the threshold of distance. In addition, we extend the query with an order, i.e., order-sensitive trip oriented search on activity trajectory (OTOSAT), which takes both the order of activities in a query q and the order of trajectories into consideration. It is very challenging to answer TOSAT and OTOSAT efficiently due to the structural complexity of trajectory data with rating information. In order to tackle the problem efficiently, we develop a hybrid index AC-tree to organize trajectories. Moreover, the optimized variant RAC + -tree and novel algorithms are introduced with the goal of achieving higher performance. Extensive experiments based on real trajectory datasets demonstrate that the proposed index structures and algorithms are capable of achieving high efficiency and scalability.
copNew York
pubSpringer US
doi10.1007/s11390-015-1558-6
pages745-761
date2015-07