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

Qingbao Liu

dblp:12/7789 · DBLP profile ↗
← Back
7ranked-venue papers
2as first author
4since 2021 · last 2026
0000-0001-8010-6021ORCID · corroborated

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

Artificial intelligence and machine learning · 5 · 2 first-author · 2 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-author · 1 since 2021Systems, architecture and hardware · 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
2 papers
Data mining · 68% Machine learning and data management · 24% Data stream processing · 7%

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

TopicWeightPapersLastEvidence papers
Data mining › predictive modeling
classification
0.612022
Reinforcement Online Active Learning Ensemble for Drifting Imbalanced Data Streams · IEEE Trans. Knowl. Data Eng. 2022
Data mining › predictive modeling › classification
ensemble learning
0.612022
Reinforcement Online Active Learning Ensemble for Drifting Imbalanced Data Streams · IEEE Trans. Knowl. Data Eng. 2022
Machine learning and data management › online learning
online active learning
0.612022
Reinforcement Online Active Learning Ensemble for Drifting Imbalanced Data Streams · IEEE Trans. Knowl. Data Eng. 2022
Data stream processing › evolving data
concept drift
0.212022
Reinforcement Online Active Learning Ensemble for Drifting Imbalanced Data Streams · IEEE Trans. Knowl. Data Eng. 2022
Data mining
clustering
0.112009
A Contrast Pattern Based Clustering Quality Index for Categorical Data · ICDM 2009
Data mining › clustering
clustering evaluation
0.112009
A Contrast Pattern Based Clustering Quality Index for Categorical Data · ICDM 2009
Data mining › clustering › clustering evaluation
clustering quality measure
0.112009
A Contrast Pattern Based Clustering Quality Index for Categorical Data · ICDM 2009
Data mining › pattern mining › subgroup discovery
contrast set mining
0.112009
A Contrast Pattern Based Clustering Quality Index for Categorical Data · ICDM 2009
Data mining
pattern mining
0.112009
A Contrast Pattern Based Clustering Quality Index for Categorical Data · ICDM 2009

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

reinforcement learning · 0.6ensemble learning · 0.6active learning · 0.6contrast pattern mining · 0.1
YearPublicationVenuePosition
2026 Dynamic demand-aware UAV scheduling for IoT data collection using deep reinforcement learning approach
Xiaoqing Li 0006, Weidong Bao 0001, Qingbao Liu, Ji Wang 0002, Xiaomin Zhu 0001
Future Gener. Comput. Syst.4
2023 Multiclass imbalanced and concept drift network traffic classification framework based on online active learning
abstract
The complex problems of multiclass imbalance, virtual or real concept drift, concept evolution, high-speed traffic streams and limited label cost budgets pose severe challenges in network traffic classification tasks. In this paper, we propose a multiclass imbalanced and concept drift network traffic classification framework based on online active learning (MicFoal), which includes a configurable supervised learner for the initialization of a network traffic classification model, an active learning method with a hybrid label request strategy, a label sliding window group, a sample training weight formula and an adaptive adjustment mechanism for the label cost budget based on a periodic performance evaluation. In addition, a novel uncertain label request strategy based on a variable least confidence threshold vector is designed to address the problems of a variable multiclass imbalance ratio or even the number of classes changing over time. Experiments performed based on eight well-known real-world network traffic datasets demonstrate that MicFoal is more effective and efficient than several state-of-the-art learning algorithms.
Weike Liu, Cheng Zhu 0002, Zhaoyun Ding, Hang Zhang 0008, Qingbao Liu
Eng. Appl. Artif. Intell.5
2022 Reinforcement Online Active Learning Ensemble for Drifting Imbalanced Data Streams
abstract
Applications challenged by the joint problem of concept drift and class imbalance are attracting increasing research interest. This paper proposes a novel Reinforcement Online Active Learning Ensemble for Drifting Imbalanced data stream (ROALE-DI). The ensemble classifier has a long-term stable classifier and a dynamic classifier group which applies a reinforcement mechanism to increase the weight of the dynamic classifiers, which perform better on the minority class, and decreases the weight of the opposite. When the data stream is class imbalanced, the classifiers will lack the training samples of the minority class. To supply training samples, when creating a new classifier, the labeled instances buffer is used to provide instances of the minority class. Then, a hybrid labeling strategy that combines the uncertainty strategy and imbalance strategy is proposed to define whether to obtain the real label of an instance. An experimental evaluation compares the classification performance of the proposed method with semi-supervised and supervised algorithms on both real-world and synthetic data streams. The results show that the ROALE-DI achieves higher Area Under the ROC Curve (AUC) and accuracy values with even fewer real labels, and the labeling cost dynamically adjusts according to the concept drift and class imbalance ratio.
Hang Zhang 0008, Weike Liu, Qingbao Liu
IEEE Trans. Knowl. Data Eng.3
2021 A comprehensive active learning method for multiclass imbalanced data streams with concept drift
abstract
A challenge to many real-world applications is multiclass imbalance with concept drift. In this paper, we propose a comprehensive active learning method for multiclass imbalanced streaming data with concept drift (CALMID). First, we design a comprehensive online active learning framework that includes an ensemble classifier, a drift detector, a label sliding window, sample sliding windows and an initialization training sample sequence. Next, a variable threshold uncertainty strategy based on an asymmetric margin threshold matrix is designed to comprehensively address the problem that a given class can simultaneously be a majority to a given subset of classes while also being a minority to others. Last but not least, we design a novel sample weight formula that comprehensively considers the class imbalance ratio of the sample’s category and the prediction difficulty. On 10 multiclass synthetic streams with different imbalance ratios and concept drifts, and on 5 real-world imbalanced streams with 7 to 55 classes and unknown drifts, the experimental results demonstrate that the proposed CALMID is more effective and efficient than several state-of-the-art learning algorithms.
Weike Liu, Hang Zhang 0008, Zhaoyun Ding, Qingbao Liu, Cheng Zhu 0002
Knowl. Based Syst.4
2019 Online Active Learning Ensemble Framework for Drifted Data Streams
abstract
In practical applications, data stream classification faces significant challenges, such as high cost of labeling instances and potential concept drifting. We present a new online active learning ensemble framework for drifting data streams based on a hybrid labeling strategy that includes the following: 1) an ensemble classifier, which consists of a long-term stable classifier and multiple dynamic classifiers (a multilevel sliding window model is used to create and update the dynamic classifiers to effectively process both the gradual drift type and sudden drift type data stream) and 2) active learning, which takes a nonfixed labeling budget, supports on-demand request labeling, and adopts an uncertainty strategy and random strategy to label instances. The decision threshold of the uncertainty strategy is adjusted dynamically, i.e., when concept drift occurs, the threshold is gradually reduced to query the most uncertain instances in priority to reduce the request expense as much as possible. Experiments on synthetic and real data sets show that precise prediction accuracy can be obtained by the proposed method without increasing the total cost of labeling, and that the labeling cost can be dynamically allocated according to the concept drift.
Jicheng Shan, Hang Zhang 0008, Weike Liu, Qingbao Liu
IEEE Trans. Neural Networks Learn. Syst.4
2012 CPCQ: Contrast pattern based clustering quality index for categorical data
Qingbao Liu, Guozhu Dong
Pattern Recognit.1
2009 A Contrast Pattern Based Clustering Quality Index for Categorical Data
abstract
Since clustering is unsupervised and highly explorative, clustering validation (i.e. assessing the quality of clustering solutions) has been an important and long standing research problem. Existing validity measures have significant shortcomings. This paper proposes a novel contrast pattern based clustering quality index (CPCQ) for categorical data, by utilizing the quality and diversity of the contrast patterns (CPs) which contrast the clusters in clusterings. High quality CPs can characterize clusters and discriminate them against each other. Experiments show that the CPCQ index (1) can recognize that expert-determined classes are the best clusters for many datasets from the UCI repository; (2) does not give inappropriate preference to larger number of clusters; (3) does not require a user to provide a distance function.
Qingbao Liu, Guozhu Dong
ICDM1