Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Zhong-Jun Ding

dblp:97/10755 · also Zhongjun Ding · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
5since 2021 · last 2025
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 3 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 3 · 1 first-author · 3 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Spatial and temporal data management · 67% Data stream processing · 33%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Spatial and temporal data management
trajectory data management
0.912025
Parallel Online Similarity Join over Trajectory Streams · WWW 2025
Spatial and temporal data management › trajectory data management
trajectory similarity join
0.912025
Parallel Online Similarity Join over Trajectory Streams · WWW 2025
Parallel and multicore computing
load balancing
0.312025
Parallel Online Similarity Join over Trajectory Streams · WWW 2025
Parallel and multicore computing
parallel query processing
0.312025
Parallel Online Similarity Join over Trajectory Streams · WWW 2025

Methods — techniques the papers use, named apart from their topics

pruning · 1.7exponential-decaying similarity · 1.7approximation · 1.7
YearPublicationVenuePosition
2025 Parallel Online Similarity Join over Trajectory Streams
abstract
Trajectory Similarity Join (TS-Join), as a fundamental operation in trajectory data analytics, has been extensively investigated by existing studies in data science. However, existing solutions are almost designed for offline static trajectories, which cannot ensure real-time feedback. In addition, the join results retrieved from existing solutions generally contain a large proportion of outdated similar pairs, making them inapplicable to evolving trajectories. In this light, we study a novel problem of online time-aware trajectory similarity join: Given a stream of evolving trajectories, we aim to dynamically discover trajectory pairs whose spatio-temporal similarity is no less than a specified threshold in a real-time manner. We innovatively introduce a time-aware exponential-decaying similarity function to eliminate outdated results. To support real-time querying over large populations of trajectories, we develop a Parallel Online Trajectory Similarity Join (POTSJ) framework with workload balancing techniques. We further enhance join efficiency through pruning strategies and tailored approximation techniques. The POTSJ framework we propose, which incorporates these elements, is capable of processing online TS-Join while simultaneously satisfying three key objectives: real-time result updates, comprehensive trajectory evaluation, and scalability. Extensive experiments on real-world datasets validate the efficiency and scalability of our POTSJ framework in processing online TS-Join.
Zhong-Jun Ding, Ke Li 0019, Lisi Chen 0001, Shuo Shang
WWW1
2024 Active Labeling Aided Semi-Supervised Safety Assessment With Task-Related Unknown Scenarios
abstract
The open environment presents a challenging issue for the online safety assessment of dynamic systems, which means that unknown scenarios may arise unexpectedly. These unknown scenarios can be task-related and result in the within-class distribution mismatch. Addressing this challenge in the semi-supervised safety assessment task, where unlabeled training data contain task-related unknown scenarios, has not been explored. This article investigates this new semi-supervised safety assessment problem. A novel active-labeling-aided semi-supervised learning scheme is proposed to tackle the within-class distribution mismatch between labeled and unlabeled training data. The proposed scheme begins by detecting out-of-distribution unlabeled data through the construction of a deep support vector data description network for each class. Subsequently, an active labeling approach along with its kernel extension is introduced, taking into account both distribution mismatch degree and sample representativeness. The proposed active labeling approach can be seamlessly integrated with any semi-supervised learning algorithm to enhance its performance in handling task-related unknown scenarios. The effectiveness and applicability of the proposed method are demonstrated through case studies based on a bearing dataset and operation data from an actual deep-sea manned submersible.
Chang Liu 0061, Xiao He 0001, Minyue Li, Yi Zhang 0089, Zhong-Jun Ding
IEEE Trans. Reliab.5
2023 Active Incremental Learning for Health State Assessment of Dynamic Systems With Unknown Scenarios
abstract
This article is concerned with the data-driven health state assessment task with unknown scenarios. Unknown scenarios are inaccessible in the stage of model training but they can appear unexpectedly during the running stage. A new problem called the within-class distribution mismatch is raised by assuming that unknown scenarios still belong to known classes. To tackle this challenging problem, a novel active incremental learning scheme with a classifier and an out-of-distribution (OOD) detector is proposed. Ak-fast incremental support vector data description (k-FISVDD) model is put forward as the OOD detector to recognize distribution mismatch samples online for label annotation. Specifically, it integrates the clustering algorithm to build local support vector sets, based on which an active query strategy is developed. An incremental learning mechanism is also designed to reduce the labeling cost. Then, the new labeled data can simultaneously refine the classifier and OOD detector. Two cases, including a bearing benchmark dataset and the operation data of a practical deep-sea manned submersible, are studied to demonstrate the effectiveness of the proposed scheme.
Chang Liu 0061, Yi Zhang 0089, Zhong-Jun Ding, Xiao He 0001
IEEE Trans. Ind. Informatics3
2023 An Online Active Broad Learning Approach for Real-Time Safety Assessment of Dynamic Systems in Nonstationary Environments
abstract
Real-time safety assessment of the complex dynamic systems in nonstationary environments is of great significance for avoiding the potential hazards. In this case, the update procedure with high assessment accuracy and training speed is crucial and meaningful in the dynamic streaming setting. Generally, the performance of most online learning approaches will be negatively affected by limited annotated samples in such a setting. Moreover, the time cost of advanced conventional methods with retaining procedures is relatively high, constraining their practicality. In this article, a novel online active broad learning approach, termed OABL, is proposed. In detail, the effectiveness of the broad learning system in the framework of online active learning is first revealed and verified. A reasonable dynamic asymmetric query strategy is then designed with a limited annotation budget to actively annotate the relatively valuable samples, which is beneficial to mitigating the negative effects of class imbalance. In this context, the advantage of the human-in-the-loop characteristic is also effectively used to control the evolution direction of the learner during the incremental update, which makes it better able to adapt to complex and nonstationary environments. Several related experiments are conducted with the realistic data of JiaoLong deep-sea manned submersible. Results show the effectiveness and practicality of the proposal compared with the existing advanced approaches.
Zeyi Liu 0001, Yi Zhang 0089, Zhong-Jun Ding, Xiao He 0001
IEEE Trans. Neural Networks Learn. Syst.3
2021 An optimal global algorithm for route guidance in advanced traveler information systems
Bokui Chen, Zhong-Jun Ding, Jun Zhou 0014, Yongquan Chen
Inf. Sci.2
2020 A future intelligent traffic system with mixed autonomous vehicles and human-driven vehicles
Bokui Chen, Duo Sun, Jun Zhou 0014, Weng-Fai Wong, Zhong-Jun Ding
Inf. Sci.5