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.
? Tutorial for this page

Xinbin Zhao

dblp:149/0816 · DBLP profile ↗
← Back
7ranked-venue papers
0as first author
5since 2021 · last 2026
0000-0002-6168-7016ORCID · reported

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

Artificial intelligence and machine learning · 3 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 3 · 2 since 2021Security and privacy · 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.

Network and information security
1 paper
Network security · 75% Digital forensics and information hiding · 25%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 100%

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

TopicWeightPapersLastEvidence papers
Network security › intrusion detection and prevention › intrusion detection › attack detection
advanced persistent threat detection
0.912025
TeRed: Normal Behavior-Based Efficient Provenance Graph Reduction for Large-Scale Attack Forensics · IEEE Trans. Inf. Forensics Secur. 2025
Digital forensics and information hiding › digital forensics
attack forensics
0.912025
TeRed: Normal Behavior-Based Efficient Provenance Graph Reduction for Large-Scale Attack Forensics · IEEE Trans. Inf. Forensics Secur. 2025
Network security › intrusion detection and prevention
intrusion detection
0.912025
TeRed: Normal Behavior-Based Efficient Provenance Graph Reduction for Large-Scale Attack Forensics · IEEE Trans. Inf. Forensics Secur. 2025
Network security › intrusion detection and prevention › intrusion detection › intrusion detection system › host-based intrusion detection
provenance-based intrusion detection
0.912025
TeRed: Normal Behavior-Based Efficient Provenance Graph Reduction for Large-Scale Attack Forensics · IEEE Trans. Inf. Forensics Secur. 2025
Bioinformatics and computational biology
drug discovery
0.312017
A Network Integration Approach for Drug-Target Interaction Prediction and Computational Drug Repositioning from Heterogeneous Information · RECOMB 2017
Bioinformatics and computational biology › drug discovery
drug repositioning
0.312017
A Network Integration Approach for Drug-Target Interaction Prediction and Computational Drug Repositioning from Heterogeneous Information · RECOMB 2017
Bioinformatics and computational biology › drug discovery
drug-target interaction prediction
0.312017
A Network Integration Approach for Drug-Target Interaction Prediction and Computational Drug Repositioning from Heterogeneous Information · RECOMB 2017
Bioinformatics and computational biology › data integration
heterogeneous network integration
0.312017
A Network Integration Approach for Drug-Target Interaction Prediction and Computational Drug Repositioning from Heterogeneous Information · RECOMB 2017
Bioinformatics and computational biology › biological network
network biology
0.312017
A Network Integration Approach for Drug-Target Interaction Prediction and Computational Drug Repositioning from Heterogeneous Information · RECOMB 2017
Storage systems
data reduction
0.312025
TeRed: Normal Behavior-Based Efficient Provenance Graph Reduction for Large-Scale Attack Forensics · IEEE Trans. Inf. Forensics Secur. 2025

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

unit tests · 1.7normal behavior pattern learning · 1.7network integration · 0.3
YearPublicationVenuePosition
2026 Channel Clustering-based Attention Network for interpretable hard landing prediction
Huabo Sun, Xinbin Zhao, Xu Li 0014, Jiaxing Shang, Linjiang Zheng
Eng. Appl. Artif. Intell.4
2026 MultiSafe: Multiple Flight Safety Events Prediction Based on Interpretable Deep Multi-Task Learning
abstract
Flight safety remains a central concern in civil aviation. Recently, increasing attention has been given to leveraging high-dimensional temporal flight data, typically collected by Quick Access Recorders (QAR), to predict safety events. However, most existing studies focus on individual events, overlooking the latent correlations among multiple events. For instance, during landing, a maneuver that reduces the risk of one event may inadvertently increase the risk of another. Predicting multiple events introduces three main challenges: 1)handling parameters recorded at inconsistent sampling rates, 2) learning task-specific parameter importance for interpretability, and 3) modeling complex temporal dependencies for accuracy. To address these, we propose MultiSafe, a deep multi-task learning model for predicting and interpreting multiple flight safety events. First, to process parameters with heterogeneous frequencies, we introduce a Multi-Scale Shared Encoder with adaptive convolutional kernels to unify representations across tasks. Next, a gating-based Parameter Selector learns task-specific parameter importance, enabling interpretable predictions. Finally, a Temporal Decoder with fine-grained attention captures intricate temporal dependencies among parameters. Experiments on a dataset of 37,518 A320 flight records demonstrate that MultiSafe outperforms state-of-the-art baselines in prediction accuracy, while its interpretability offers actionable insights to assist pilots in enhancing flight safety.
Youlin Huang, Jiaxing Shang, Xu Li 0014, Linjiang Zheng, Chengxiang Li, Fan Li 0020, Xinbin Zhao, Huabo Sun, Riquan Zhang
IEEE Trans. Intell. Transp. Syst.7
2025 A Dual Two-Stage Attention-based Model for interpretable hard landing prediction from flight data
Jiaxing Shang, Xiaoquan Li, Ruixiang Zhang, Linjiang Zheng, Xu Li 0014, Riquan Zhang, Xinbin Zhao, Fan Li 0020
Eng. Appl. Artif. Intell.7
2025 TeRed: Normal Behavior-Based Efficient Provenance Graph Reduction for Large-Scale Attack Forensics
abstract
System intrusions, particularly Advanced Persistent Threats (APTs), pose significant threats to enterprises and organizations. Provenance graph-based attack detection and investigation methods are crucial for defending against these intrusions. To detect various attacks, security systems collect comprehensive operating system event data, resulting in massive provenance graphs that increase storage costs and complicate analysis and querying. Efficiently optimizing these provenance graphs has thus become a core issue. However, existing data reduction methods often mistakenly delete critical security information, significantly impacting attack detection and investigation. This paper introduces TeRed, a novel method for reducing provenance graphs based on normal behavior patterns. Our approach employs unit tests to learn the system’s normal behavior patterns, which are then used to streamline the provenance graph. Experiments on five datasets show that our method reduces the provenance graph while preserving all attack-related information. Importantly, it does not compromise attack detection and investigation, showcasing significant advantages over other data reduction techniques.
Xiaoxiang Li, Hai Wan, Xinbin Zhao
IEEE Trans. Inf. Forensics Secur.4
2023 SDTAN: Scalable Deep Time-Aware Attention Network for Interpretable Hard Landing Prediction
abstract
Hard landing, as one of the most frequent flight safety incidents during the landing stage, is highly concerned by the aviation industry. Recently, the popularization of Quick Access Recorder (QAR), a modern flight data recording system, has made it possible to collect large volume of flight parameters and incorporate state-of-the-art AI technologies to improve flight safety. However, due to the complex, multivariate, and highly specialized nature of QAR data, most existing studies either suffer from information loss caused by rough feature extraction methods, or rely solely on black-box models with no interpretations, making themselves difficult to achieve satisfactory performance in terms of prediction and explainability. To address this issue, we propose a novel attention-driven model named SDTAN (Scalable Deep Time-Aware Attention Network), which can accurately predict hard landing events and provide interpretable insights to help reveal the possible reasons leading to the events. Specifically, SDTAN fully captures information to learn the local representations of parameters, and leverages the time-interval attention mechanism to focus on the entire temporal pattern of flight over the relevant time intervals. It further re-encodes the representations of parameters in a global view and learns the global effect of parameters on the predicted output to uncover the ones which strongly indicate the flight safety status, enabling both high prediction accuracy and qualitative interpretability. We conduct experiments on real-world QAR datasets of 37,920 Airbus A320 flight samples. Experimental results demonstrate that SDTAN outperforms other state-of-the-art baselines and provides effective interpretability by visualizing the importance of parameters.
Jiaxing Shang, Linjiang Zheng, Xu Li 0014, Xinbin Zhao, Liling Yu
IEEE Trans. Intell. Transp. Syst.7
2017 A Network Integration Approach for Drug-Target Interaction Prediction and Computational Drug Repositioning from Heterogeneous Information
Yunan Luo, Xinbin Zhao, Jingtian Zhou, Jinling Yang, Yanqing Zhang 0010, Wenhua Kuang, Jian Peng 0001, Ligong Chen, Jianyang Zeng 0001
RECOMB2
2016 Twin Bounded Support Tensor Machine for Classification
abstract
The traditional vector-based classifiers, such as support vector machine (SVM) and twin support vector machine (TSVM), cannot handle tensor data directly and may not utilize the data informations effectively. In this paper, we propose a novel classifier based on tensor data, called twin bounded support tensor machine (TBSTM) which is an extension of twin bounded support vector machine (TBSVM). Similar to TBSVM, TBSTM gets two hyperplanes and obtains the solution by solving two quadratic programming problems (QPPs). The computational complexity of each QPPs is smaller than that of support tensor machine (STM). TBSTM not only retains the advantage of TBSVM, but also has its unique superior characteristics: (1) it makes full use of the structure information of data; (2) it has acceptable or better classification accuracy compared to STM, TBSVM and SVM; (3) the computational cost is basically less than STM; (4) it can deal with large data that TBSVM is not easy to achieve, especially for small-sample-size (S3) problems; (5) it adopts alternating successive over relaxation iteration (ASOR) method to solve optimization problems which accelerates the pace of training. Finally, we demonstrate the effectiveness and superiority by the experiments based on vector and tensor data.
Haifa Shi, Xinbin Zhao, Ling Zhen, Ling Jing
Int. J. Pattern Recognit. Artif. Intell.2