Jian Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jian Chen has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Hong Gao
Zhejiang Normal University
6 shared publications - Donghua Yang
Faculty of Computing, Harbin Institute of Technology, Harbin, China
4 shared publications - Jianzhong Li
School of Computer Science and Technology, Harbin Institute of Technology, Harbin, China
3 shared publications - Kaiqi Zhang
Harbin Institute of Technology
3 shared publications - Junle Chen
Department of Computer Science, Harbin Institute of Technology, Harbin, China
2 shared publications - Yubo Luo
Faculty of Computing, Harbin Institute of Technology, Harbin, China
2 shared publications
Latest Publications
- Open Access
- 25 August 2026
- Published by Springer Nature in Data Science and Engineering
- p. 1-28
Bandwidth Exploration for Spatial-Temporal Kernel Density Visualizations
- 25 August 2026
- Published by Springer Nature in Data Science and Engineering
- p. 1-28
Open AccessBandwidth Exploration for Spatial-Temporal Kernel Density Visualizations
- Open Access
- 11 June 2026
- Published by Springer Nature in Data Science and Engineering
REST: An Efficient Distributed Framework for Real-time Semantic Trajectory Join
- 11 June 2026
- Published by Springer Nature in Data Science and Engineering
Open AccessREST: An Efficient Distributed Framework for Real-time Semantic Trajectory Join
- 9 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 37 (3) , 1294-1310
Maximizing Influence Query Over Indoor Trajectories
Maximizing Influence (Max-Inf) query is a fundamental operation in spatial data management. This query returns an optimal site from a candidate set to maximize its influence . Existing work commonly focuses on outdoor spaces. In practice, however, people spend up to 87% of their daily life inside indoor spaces. The outdoor techniques fall short in indoor spaces due to the complicated topology of indoor spaces. In this paper, we formulate two indoor Max-Inf queries: Top-$k$ Probabilistic Influence Query (T$k$ PI) and Collective-$k$ Probabilistic Influence Query (C$k$ PI) taking probability and mobility factors into consideration. We propose a novel spatial index, IT-tree, which utilizes the properties of indoor venues to facilitate the indoor distance computation, and then applies a trie to further organize the trajectories with similar check-in partitions together, based on their sketch information. This structure is simple but highly effective in pruning the trajectory search space. To process T$k$ PI efficiently, we devise subtree pruning and progressive pruning techniques to delicately filter out unnecessary trajectories based on probability bounds and the monotonicity of influence probability. For C$k$ PI queries, which is a submodular NP-hard problem, three approximation algorithms are provided with different strategies of computing marginal influence value during the search. Through extensive experiments on several real indoor venues, we demonstrate the efficiency and effectiveness of our proposed algorithms.- 9 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 37 (3) , 1294-1310
Maximizing Influence Query Over Indoor Trajectories
Maximizing Influence (Max-Inf) query is a fundamental operation in spatial data management. This query returns an optimal site from a candidate set to maximize its influence . Existing work commonly focuses on outdoor spaces. In practice, however, people spend up to 87% of their daily life inside indoor spaces. The outdoor techniques fall short in indoor spaces due to the complicated topology of indoor spaces. In this paper, we formulate two indoor Max-Inf queries: Top-$k$ Probabilistic Influence Query (T$k$ PI) and Collective-$k$ Probabilistic Influence Query (C$k$ PI) taking probability and mobility factors into consideration. We propose a novel spatial index, IT-tree, which utilizes the properties of indoor venues to facilitate the indoor distance computation, and then applies a trie to further organize the trajectories with similar check-in partitions together, based on their sketch information. This structure is simple but highly effective in pruning the trajectory search space. To process T$k$ PI efficiently, we devise subtree pruning and progressive pruning techniques to delicately filter out unnecessary trajectories based on probability bounds and the monotonicity of influence probability. For C$k$ PI queries, which is a submodular NP-hard problem, three approximation algorithms are provided with different strategies of computing marginal influence value during the search. Through extensive experiments on several real indoor venues, we demonstrate the efficiency and effectiveness of our proposed algorithms.- 26 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (2) , 2219-2232
Efficient Semantic Trajectory Similarity Search
Trajectory similarity search is a basic operation in spatial data analysis for nonterrestrial networks applications, such as asset tracking, maritime transportation, and urban air mobility. In many real-world applications (e.g., Flickr, Bikely, and Foursquare), users are allowed to share comments or experiences along with their trajectories, called semantic trajectories. In this article, we study a new type of similarity search on semantic trajectories, which takes into account spatial and textual information together. Given a query trajectory$t_{q}$ and a similarity threshold$\theta $ , semantic trajectory similarity search retrieves all trajectories whose spatial-textual similarity to$t_{q}$ is no greater than$\theta $ . To address the problem efficiently, we first develop a novel bitmap-based index, called SET-tree, to organize the semantic trajectory hierarchically. It contains two types of bitmaps, global gram bitmap and positional gram bitmap, that enable us to efficiently prune the search space by spatial and textual similarity simultaneously. Besides, we develop some novel upper and lower bounds on textual and spatial similarity for pruning. We provide the spatial-side enhancement and the textual-side enhancement for further improvement. Finally, we report on extensive experiments using real and synthetic trajectory data sets that offer insight into the performance of our algorithm, and show that our algorithm is capable of achieving superior efficiency and good scalability.- 26 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (2) , 2219-2232
Efficient Semantic Trajectory Similarity Search
Trajectory similarity search is a basic operation in spatial data analysis for nonterrestrial networks applications, such as asset tracking, maritime transportation, and urban air mobility. In many real-world applications (e.g., Flickr, Bikely, and Foursquare), users are allowed to share comments or experiences along with their trajectories, called semantic trajectories. In this article, we study a new type of similarity search on semantic trajectories, which takes into account spatial and textual information together. Given a query trajectory$t_{q}$ and a similarity threshold$\theta $ , semantic trajectory similarity search retrieves all trajectories whose spatial-textual similarity to$t_{q}$ is no greater than$\theta $ . To address the problem efficiently, we first develop a novel bitmap-based index, called SET-tree, to organize the semantic trajectory hierarchically. It contains two types of bitmaps, global gram bitmap and positional gram bitmap, that enable us to efficiently prune the search space by spatial and textual similarity simultaneously. Besides, we develop some novel upper and lower bounds on textual and spatial similarity for pruning. We provide the spatial-side enhancement and the textual-side enhancement for further improvement. Finally, we report on extensive experiments using real and synthetic trajectory data sets that offer insight into the performance of our algorithm, and show that our algorithm is capable of achieving superior efficiency and good scalability.- 28 August 2024
- Published by Springer Nature
- p. 483-498
Efficient Coverage Query Over Transition Trajectories
- 28 August 2024
- Published by Springer Nature
- p. 483-498
Efficient Coverage Query Over Transition Trajectories
- 5 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 36 (7) , 3329-3347
On Efficiently Processing MIT Queries in Trajectory Data
Maximizing Influence (Max-Inf) query is a fundamental operation in spatial data management. Given a set of weighted objects, this query aims to find an optimal location from a candidate set to maximize its influence , which is the total weight of its reverse nearest neighbors. Existing work commonly assumes that every object is in a fixed location. In real life, however, there are a wide variety of drive-in services (e.g., food joints, pharmacies, ATMs, etc.) that are widely accessed by mobile users (i.e., trajectories) instead of the fixed ones. In this paper, we first define the Maximizing Influence query over Trajectories, namely, MIT query, which aims to find an optimal location to maximize the total weight of influenced trajectories. We propose a novel index, QB-tree to hierarchically group trajectories with similar activity regions together for subsequent unified processing, and classify trajectories inside the same node into multiple buckets according to their motion patterns. For each bucket, we construct a rectilinear polygon using the trajectories in it to exclude some irrelevant areas in the minimum boundary rectangle. Moreover, we develop a branch-and-bound approach called BBM to efficiently solve the MIT query. The algorithm adaptively partitions the candidates into disjoint regions and prunes the regions without containing optimal results. Then, by exploiting the QB-tree, the upper and lower bounds are efficiently computed with three-level pruning technique. Practically, we also study a variant of the MIT query, called MDT query. We propose novel pruning bounds in cooperation with QB-tree to answer MDT queries efficiently. Finally, extensive experiments on real and synthetic datasets demonstrate that our index and algorithms have high performance in terms of efficiency, scalability, and genericity.
- 5 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 36 (7) , 3329-3347
On Efficiently Processing MIT Queries in Trajectory Data
Maximizing Influence (Max-Inf) query is a fundamental operation in spatial data management. Given a set of weighted objects, this query aims to find an optimal location from a candidate set to maximize its influence , which is the total weight of its reverse nearest neighbors. Existing work commonly assumes that every object is in a fixed location. In real life, however, there are a wide variety of drive-in services (e.g., food joints, pharmacies, ATMs, etc.) that are widely accessed by mobile users (i.e., trajectories) instead of the fixed ones. In this paper, we first define the Maximizing Influence query over Trajectories, namely, MIT query, which aims to find an optimal location to maximize the total weight of influenced trajectories. We propose a novel index, QB-tree to hierarchically group trajectories with similar activity regions together for subsequent unified processing, and classify trajectories inside the same node into multiple buckets according to their motion patterns. For each bucket, we construct a rectilinear polygon using the trajectories in it to exclude some irrelevant areas in the minimum boundary rectangle. Moreover, we develop a branch-and-bound approach called BBM to efficiently solve the MIT query. The algorithm adaptively partitions the candidates into disjoint regions and prunes the regions without containing optimal results. Then, by exploiting the QB-tree, the upper and lower bounds are efficiently computed with three-level pruning technique. Practically, we also study a variant of the MIT query, called MDT query. We propose novel pruning bounds in cooperation with QB-tree to answer MDT queries efficiently. Finally, extensive experiments on real and synthetic datasets demonstrate that our index and algorithms have high performance in terms of efficiency, scalability, and genericity.
- 30 September 2022
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 37 (5) , 1005-1025
GAM: A GPU-Accelerated Algorithm for MaxRS Queries in Road Networks
- 30 September 2022
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 37 (5) , 1005-1025
GAM: A GPU-Accelerated Algorithm for MaxRS Queries in Road Networks