Towards Efficient Selection of Activity Trajectories based on Diversity and Coverage
Chengcheng Yang, Lisi Chen, Hao Wang, Shuo Shang
Abstract
With the prevalence of location based services, activity trajectories are being generated at a rapid pace. The activity trajectory data enriches traditional trajectory data with semantic activities of users, which not only shows where the users have been, but also the preference of users. However, the large volume of data is expensive for people to explore. To address this issue, we study the problem of Diversity-aware Activity Trajectory Selection (DaATS). Given a region of interest for a user, it finds a small number of representative activity trajectories that can provide the user with a broad coverage of different aspects of the region. The problem is challenging in both the efficiency of trajectory similarity computation and subset selection. To tackle the two challenges, we propose a novel solution by: (1) exploiting a deep metric learning method to speedup the similarity computation; and (2) proving that DaATS is an NP-hard problem, and developing an efficient approximation algorithm with performance guarantees. Experiments on two real-world datasets show that our proposal significantly outperforms state-of-the-art baselines. 2019; Chen et al. 2020], which augments traditional trajectory data with "activity" features. In this kind of data, each location point is associated with a keyword that semantically describes the venue of a performed activity, e.g., shop, restaurant, bank. From activity trajectory data, we can know not only where users have been, but also the main preferences of users by looking over the semantic descriptions. However, the availability of such large scale data makes the information prohibitively expensive to explore. In many real-world applications, it is of great significance to provide support for users to perform data exploration on their interested regions. For instance, users would like to browse a small number of representative tourist routes when planning trips to some tourism attractions. Another example is the online map system [Ward, Grinstein, and Keim 2010] . For specified geographical area, users want to get intuitive information on various type of
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 2f7dd2b8-5f09-4ced-bd36-e75c35aeb782Cited by top-tier papers3
- GRLSTM: Trajectory Similarity Computation with Graph-Based Residual LSTMSilin Zhou, Jing Li, Hao Wang, Shuo Shang et al.AAAI 2023 · 48 citations
- RED: Effective Trajectory Representation Learning with Comprehensive InformationSilin Zhou, Shuo Shang, Lisi Chen, Christian S. Jensen et al.VLDB 2025 · 17 citations
- Grid and Road Expressions Are Complementary for Trajectory Representation LearningSilin Zhou, Shuo Shang, Lisi Chen, Peng Han et al.KDD 2025 · 7 citations
Builds on1
Related papers
- Efficient Learning-based Top-k Representative Similar Subtrajectory QueryKunming Wang, Shiyu Yang, Jiabao Jin, Peng Cheng et al.ICDE 2024 · 2 citations
- Efficient and Effective Similar Subtrajectory Search with Deep Reinforcement LearningZheng Wang, Cheng Long, Gao Cong, Yiding LiuVLDB 2020 · 29 citations
- Region-Point Joint Representation for Effective Trajectory Similarity LearningHao Long, Silin Zhou, Lisi Chen, Shuo ShangAAAI 2026
- TrajGAT: A Graph-based Long-term Dependency Modeling Approach for Trajectory Similarity ComputationDi Yao, Haonan Hu, Lun Du, Gao Cong et al.KDD 2022 · 74 citations
- MovSemCL: Movement-Semantics Contrastive Learning for Trajectory SimilarityZhichen Lai, Hua Lu, Huan Li, Jialiang Li et al.AAAI 2026
