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

Zhi Chen 0017

dblp:05/1539-17 · DBLP profile ↗
← Back
12ranked-venue papers
8as first author
5since 2021 · last 2024
0000-0002-4734-368XORCID · verified

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

Artificial intelligence and machine learning · 9 · 5 first-author · 3 since 2021Databases, data management, data science and information retrieval · 2 · 2 first-author · 2 since 2021Human-computer interaction and ubiquitous computing · 1 · 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.

Artificial intelligence
2 papers
Generative modeling · 49% Trustworthy machine learning · 26% Learning paradigms · 13%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling
generative adversarial network
1.422024
Generating Counterfactual Instances for Explainable Class-Imbalance Learning · IEEE Trans. Knowl. Data Eng. 2024
Supervised Anomaly Detection via Conditional Generative Adversarial Network and Ensemble Active Learning · IEEE Trans. Pattern Anal. Mach. Intell. 2023
Machine learning › Learning paradigms
class imbalance
0.812024
Generating Counterfactual Instances for Explainable Class-Imbalance Learning · IEEE Trans. Knowl. Data Eng. 2024
Machine learning › Trustworthy machine learning › interpretability
counterfactual explanation
0.812024
Generating Counterfactual Instances for Explainable Class-Imbalance Learning · IEEE Trans. Knowl. Data Eng. 2024
Machine learning › Trustworthy machine learning
interpretability
0.812024
Generating Counterfactual Instances for Explainable Class-Imbalance Learning · IEEE Trans. Knowl. Data Eng. 2024
Machine learning › Generative modeling › generative adversarial network
interpretable GANs
0.812024
Generating Counterfactual Instances for Explainable Class-Imbalance Learning · IEEE Trans. Knowl. Data Eng. 2024
Machine learning › Time series and sequential data
anomaly detection
0.712023
Supervised Anomaly Detection via Conditional Generative Adversarial Network and Ensemble Active Learning · IEEE Trans. Pattern Anal. Mach. Intell. 2023
Machine learning › Generative modeling › generative adversarial network
conditional GAN
0.712023
Supervised Anomaly Detection via Conditional Generative Adversarial Network and Ensemble Active Learning · IEEE Trans. Pattern Anal. Mach. Intell. 2023

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

ensemble loss function · 0.8ensemble active learning · 0.7class balancing · 0.7
YearPublicationVenuePosition
2024 Generating Counterfactual Instances for Explainable Class-Imbalance Learning
abstract
Existing class imbalance learning paradigms focus on lifting the importance of minority instance, aiming to improve the model in terms of certain evaluation metrics (e.g., AUC and$F_{1}$-measure). One drawback of these methods is that they lack enough transparency, hence, cannot be fully trusted in vital domains. To this end, this paper deal with the class imbalance learning task with counterfactual instances. Given an instance and a classifier, a counterfactual is a fake instance which, while having smallest distance to the original instance, is classified as a different class by the classifier. Therefore, the most important features for a classifier can be identified by inspecting the difference between an instance and its counterfactual. To utilize counterfactuals, a novel Explainable Generative Adversarial Network (EXGAN) is proposed. EXGAN has a unique “two generatorsversusmultiple discriminators” architecture where the generators are used to generate effective counterfactuals and discriminators are trained for the class imbalance learning task. In addition to the architecture, an innovative ensemble loss function ensuring each discriminator complementing each other is designed to overcome the class imbalance issue. Extensive experiments prove that the counterfactuals generated by EXGAN can be used to produce effective local explanation and provide significant better class imbalance learning ability than existing competitors.
Zhi Chen 0017, Jiang Duan, Rui Chen 0003, Guoping Qiu
IEEE Trans. Knowl. Data Eng.1
2023 Supervised Anomaly Detection via Conditional Generative Adversarial Network and Ensemble Active Learning
abstract
Anomaly detection has wide applications in machine intelligence but is still a difficult unsolved problem. Major challenges include the rarity of labeled anomalies and it is a class highly imbalanced problem. Traditional unsupervised anomaly detectors are suboptimal while supervised models can easily make biased predictions towards normal data. In this paper, we present a new supervised anomaly detector through introducing the novel Ensemble Active Learning Generative Adversarial Network (EAL-GAN). EAL-GAN is a conditional GAN having a unique one generator versus multiple discriminators architecture where anomaly detection is implemented by an auxiliary classifier of the discriminator. In addition to using the conditional GAN to generate class balanced supplementary training data, an innovative ensemble learning loss function ensuring each discriminator makes up for the deficiencies of the others is designed to overcome the class imbalanced problem, and an active learning algorithm is introduced to significantly reduce the cost of labeling real-world data. We present extensive experimental results to demonstrate that the new anomaly detector consistently outperforms a variety of SOTA methods by significant margins.
Zhi Chen 0017, Jiang Duan, Guoping Qiu
IEEE Trans. Pattern Anal. Mach. Intell.1
2022 A lightweight ensemble discriminator for Generative Adversarial Networks
Yingtao Xie 0001, Zhi Chen 0017, Weijie Xiong, Qiqi Ran, Chunnan Shang
Knowl. Based Syst.3
2022 Class-Imbalanced Deep Learning via a Class-Balanced Ensemble
abstract
Class imbalance is a prevalent phenomenon in various real-world applications and it presents significant challenges to model learning, including deep learning. In this work, we embed ensemble learning into the deep convolutional neural networks (CNNs) to tackle the class-imbalanced learning problem. An ensemble of auxiliary classifiers branching out from various hidden layers of a CNN is trained together with the CNN in an end-to-end manner. To that end, we designed a new loss function that can rectify the bias toward the majority classes by forcing the CNN's hidden layers and its associated auxiliary classifiers to focus on the samples that have been misclassified by previous layers, thus enabling subsequent layers to develop diverse behavior and fix the errors of previous layers in a batch-wise manner. A unique feature of the new method is that the ensemble of auxiliary classifiers can work together with the main CNN to form a more powerful combined classifier, or can be removed after finished training the CNN and thus only acting the role of assisting class imbalance learning of the CNN to enhance the neural network's capability in dealing with class-imbalanced data. Comprehensive experiments are conducted on four benchmark data sets of increasing complexity (CIFAR-10, CIFAR-100, iNaturalist, and CelebA) and the results demonstrate significant performance improvements over the state-of-the-art deep imbalance learning methods.
Zhi Chen 0017, Jiang Duan, Guoping Qiu
IEEE Trans. Neural Networks Learn. Syst.1
2021 A hybrid data-level ensemble to enable learning from highly imbalanced dataset
Zhi Chen 0017, Jiang Duan, Guoping Qiu
Inf. Sci.1
2020 SMLBoost-adopting a soft-margin like strategy in boosting
Zhi Chen 0017, Jiang Duan, Guoping Qiu
Knowl. Based Syst.1
2018 A synthetic neighborhood generation based ensemble learning for the imbalanced data classification
Zhi Chen 0017, Xin Xia 0006, Sha Ding
Appl. Intell.1
2018 Maximum relevancy maximum complementary based ordered aggregation for ensemble pruning
Xin Xia 0006, Zhi Chen 0017
Appl. Intell.3
2018 Enriching the random subspace method with margin theory - a solution for the high-dimensional classification task
abstract
The random subspace method (RSM) has proved its excellence in numbers of pattern recognition tasks. However, the standard RSM is limited owing to the randomness in its feature selection procedure that is likely to lead to feature subset having poor class separability. In this paper, a proposal for a margin-based criterion has been presented for the evaluation of the true significance of the features, together with the true classification ability of base classifiers, so that both the training phase and integration phase of standard RSM could be enhanced. In the training phase, the random feature selection procedure is enhanced using a weighted random feature selection procedure, in order to improve the classification ability of the base classifier. In the integration phase, the simple majority voting strategy is enhanced using a weighted majority voting strategy for the purpose of assigning the base classifiers with poor classification ability to the lower voting weights. Experimental results on 30 benchmark datasets, together with 6 high-dimensional datasets prove that the recommended approach is capable of better providing classification ability to the usual classification task, in addition to the high-dimensional classification task.
Yingtao Xie 0001, Zhi Chen 0017
Connect. Sci.4
2018 Pruning the Ensemble of ANN Based on Decision Tree Induction
Sha Ding, Zhi Chen 0017, Shi-yuan Zhao
Neural Process. Lett.2
2017 Creating diversity in ensembles using synthetic neighborhoods of training samples
Zhi Chen 0017, Rui Chen 0003, Yingtao Xie 0001
Appl. Intell.1
2017 Automatic personality identification using writing behaviours: an exploratory study
abstract
The ability of automatically identifying users’ personality is an important part of building adaptive systems and providing personalised services. However, there is still a lack of evaluation methods which can not only unobtrusively gather user data without supplement equipment, but also provide accurate and real-time prediction of users’ personality. This paper presents a new approach to identifying personality by combining writing features and machine learning techniques. We conducted an exploratory study where we collected participants’ handwriting information and personality information via questionnaire. From these data, we extracted writing features and created classifiers for seven personality dimensions. Our top results include a unique set of writing features which could be predictive of personality and binary classifiers for the seven personality dimensions, with accuracies ranging from 62.5% to 83.9%. These results show that writing features are useful for personality identification when suitable classifiers are adopted.
Zhi Chen 0017
Behav. Inf. Technol.1