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

Panpan Qi

dblp:203/7456 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
2since 2021 · last 2022
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 2 first-author · 1 since 2021Databases, data management, data science and information retrieval · 2 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author

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
2 papers
Malware analysis · 46% Cyber-physical and IoT security · 30% Systems and software security · 23%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Artificial intelligence
1 paper
Graph learning · 100%

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

TopicWeightPapersLastEvidence papers
Data mining
anomaly detection
0.612022
MAD-SGCN: Multivariate Anomaly Detection with Self-learning Graph Convolutional Networks · ICDE 2022
Data mining › anomaly detection › time series anomaly detection
multivariate time series anomaly detection
0.612022
MAD-SGCN: Multivariate Anomaly Detection with Self-learning Graph Convolutional Networks · ICDE 2022
Systems and software security › binary analysis
API call analysis
0.412020
Dynamic Malware Analysis with Feature Engineering and Feature Learning · AAAI 2020
Malware analysis
dynamic malware analysis
0.412020
Dynamic Malware Analysis with Feature Engineering and Feature Learning · AAAI 2020
Malware analysis
malware detection
0.412020
Dynamic Malware Analysis with Feature Engineering and Feature Learning · AAAI 2020
Machine learning › Graph learning › graph neural network
graph convolutional network
0.212022
MAD-SGCN: Multivariate Anomaly Detection with Self-learning Graph Convolutional Networks · ICDE 2022

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

self-supervised graph structure learning · 1.7graph convolutional network · 1.7LSTM · 1.7gated CNN · 0.4feature hashing · 0.4bidirectional LSTM · 0.4
YearPublicationVenuePosition
2022 MAD-SGCN: Multivariate Anomaly Detection with Self-learning Graph Convolutional Networks
abstract
Today's Cyber Physical Systems (CPSs) are large and complex data-intensive systems. Constant monitoring and analysis of the data generated by a multitude of interconnected sensors and actuators are required in order to detect anomalies due to possible intrusions or faults with high accuracy and timeliness. Recently, unsupervised anomaly detection techniques based on deep learning for multivariate time series have been proposed for detecting CPSs attacks with promising performance. However, the current methods are either limited by their representation learning methods in encoding the temporal and spatial information simultaneously and effectively, or cannot easily scale to other tasks without having explicit knowledge of the internal relationships between the different variables or sensors, which are both important for characterising CPSs data. In this paper, we propose a novel unsupervised anomaly detection method for multivariate time series MAD-SGCN which effectively captures the temporal and spatial correlations of the input sequences simultaneously using Long Short-Term Memory networks (LSTMs) and spectral-based Graph Convolutional Networks (GCNs). We design a self-supervised graph structure learning mechanism to minimize the usage of the prior knowledge about the network structures of the CPSs. Experiments on four CPS datasets demonstrate the superiority of the proposed method.
Panpan Qi, Dan Li 0016, See-Kiong Ng
ICDE1
2021 Unsupervised Domain Adaptation for Static Malware Detection based on Gradient Boosting Trees
abstract
Static malware detection is important for protection against malware by allowing for malicious files to be detected prior to execution. It is also especially suitable for machine learning-based approaches. Recently, gradient boosting decision trees (GBDT) models, e.g., LightGBM (a popular implementation of GBDT), have shown outstanding performance for malware detection. However, as malware programs are known to evolve rapidly, malware classification models trained on the (source) training data often fail to generalize to the target domain, i.e., the deployed environment. To handle the underlying data distribution drifts, unsupervised domain adaptation techniques have been proposed for machine learning models including deep learning models. However, unsupervised domain adaptation for GBDT has remained challenging. In this paper, we adapt the adversarial learning framework for unsupervised domain adaptation to enable GBDT learn domain-invariant features and alleviate performance degradation in the target domain. In addition, to fully exploit the unlabelled target data, we merge them into the training dataset after pseudo-labelling. We propose a new weighting scheme integrated into GBDT for sampling instances in each boosting round to reduce the negative impact of wrongly labelled target instances. Experiments on two large malware datasets demonstrate the superiority of our proposed method.
Panpan Qi, Wei Wang 0059, Lei Zhu 0015, See-Kiong Ng
CIKM1
2020 Dynamic Malware Analysis with Feature Engineering and Feature Learning
abstract
Dynamic malware analysis executes the program in an isolated environment and monitors its run-time behaviour (e.g. system API calls) for malware detection. This technique has been proven to be effective against various code obfuscation techniques and newly released (“zero-day”) malware. However, existing works typically only consider the API name while ignoring the arguments, or require complex feature engineering operations and expert knowledge to process the arguments. In this paper, we propose a novel and low-cost feature extraction approach, and an effective deep neural network architecture for accurate and fast malware detection. Specifically, the feature representation approach utilizes a feature hashing trick to encode the API call arguments associated with the API name. The deep neural network architecture applies multiple Gated-CNNs (convolutional neural networks) to transform the extracted features of each API call. The outputs are further processed through bidirectional LSTM (long-short term memory networks) to learn the sequential correlation among API calls. Experiments show that our solution outperforms baselines significantly on a large real dataset. Valuable insights about feature engineering and architecture design are derived from the ablation study.
Zhaoqi Zhang 0002, Panpan Qi, Wei Wang 0059
AAAI2
2020 Malware Detection by Exploiting Deep Learning over Binary Programs
abstract
Malware evolves rapidly over time, which makes existing solutions being ineffective in detecting newly released malware. Machine learning models that can learn to capture malicious patterns directly from the data play an increasingly important role in malware analysis. However, traditional machine learning models heavily depend on feature engineering. The extracted static features are vulnerable as hackers could create new malware with different feature values to deceive the machine learning models. In this paper, we propose an end-to-end malware detection framework consisting of convolutional neural network, autoencoder and neural decision trees. It learns the features from multiple domains for malware detection without feature engineering. In addition, since anti-virus products should have a very low false alarm rate to avoid annoying users, we propose a special loss function, which optimizes the recall for a fixed low false positive rate (e.g., less than 0.1%). Experiments show that the proposed framework has achieved a better recall than the baseline models, and the derived loss function also makes a difference.
Panpan Qi, Zhaoqi Zhang 0002, Wei Wang 0059, Chang Yao 0001
ICPR1