default search action
Yanchuan Chang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [i10]Yanchuan Chang, Xu Cai, Christian S. Jensen, Jianzhong Qi:
K Nearest Neighbor-Guided Trajectory Similarity Learning. CoRR abs/2502.00285 (2025) - [i9]Fengze Sun, Yanchuan Chang, Egemen Tanin, Shanika Karunasekera, Jianzhong Qi:
Urban Region Representation Learning: A Flexible Approach. CoRR abs/2503.09128 (2025) - 2024
- [j3]Yanchuan Chang, Egemen Tanin, Gao Cong, Christian S. Jensen, Jianzhong Qi
:
Trajectory Similarity Measurement: An Efficiency Perspective. Proc. VLDB Endow. 17(9): 2293-2306 (2024) - [c5]Xinyu Su, Jianzhong Qi
Spatial-temporal Forecasting for Regions without Observations. EDBT 2024: 488-500 - [c4]Fengze Sun, Jianzhong Qi
Urban Region Representation Learning with Attentive Fusion. ICDE 2024: 4409-4421 - [i8]Xinyu Su, Jianzhong Qi
Spatial-temporal Forecasting for Regions without Observations. CoRR abs/2401.10518 (2024) - [i7]Wei Chen, Yuxuan Liang, Yuanshao Zhu, Yanchuan Chang, Kang Luo, Haomin Wen, Lei Li, Yanwei Yu, Qingsong Wen
Deep Learning for Trajectory Data Management and Mining: A Survey and Beyond. CoRR abs/2403.14151 (2024) - [i6]Chao Lei, Yanchuan Chang, Nir Lipovetzky, Krista A. Ehinger:
Planning-Driven Programming: A Large Language Model Programming Workflow. CoRR abs/2411.14503 (2024) - [i5]Xinyu Su, Feng Liu, Yanchuan Chang, Egemen Tanin, Majid Sarvi, Jianzhong Qi
DualCast: Disentangling Aperiodic Events from Traffic Series with a Dual-Branch Model. CoRR abs/2411.18286 (2024) - 2023
- [b1]Yanchuan Chang:
Effective, Efficient, and Generalizable Algorithms for Trajectory Similarity Queries. University of Melbourne, Parkville, Victoria, Australia, 2023 - [c3]Yanchuan Chang
Spatial Structure-Aware Road Network Embedding via Graph Contrastive Learning. EDBT 2023: 144-156 - [c2]Yanchuan Chang
Contrastive Trajectory Similarity Learning with Dual-Feature Attention. ICDE 2023: 2933-2945 - [i4]Yanchuan Chang, Egemen Tanin, Gao Cong, Christian S. Jensen, Jianzhong Qi
Trajectory Similarity Measurement: An Efficiency Perspective. CoRR abs/2311.00960 (2023) - [i3]Fengze Sun, Jianzhong Qi
Urban Region Representation Learning with Attentive Fusion. CoRR abs/2312.04606 (2023) - 2022
- [i2]Yanchuan Chang, Jianzhong Qi
Contrastive Trajectory Similarity Learning with Dual-Feature Attention. CoRR abs/2210.05155 (2022) - 2021
- [c1]Yanchuan Chang
Sub-trajectory Similarity Join with Obfuscation. SSDBM 2021: 181-192 - [i1]Yanchuan Chang, Jianzhong Qi, Egemen Tanin, Xingjun Ma, Hanan Samet:
Sub-trajectory Similarity Join with Obfuscation. CoRR abs/2106.03355 (2021) - 2020
- [j2]Jianzhong Qi
Packing R-trees with Space-filling Curves: Theoretical Optimality, Empirical Efficiency, and Bulk-loading Parallelizability. ACM Trans. Database Syst. 45(3): 14:1-14:47 (2020)
2010 – 2019
- 2018
- [j1]Jianzhong Qi
Theoretically Optimal and Empirically Efficient R-trees with Strong Parallelizability. Proc. VLDB Endow. 11(5): 621-634 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-14 21:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: