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

Ruimin Peng

dblp:270/3026 · DBLP profile ↗
← Back
8ranked-venue papers
2as first author
8since 2021 · last 2026
0000-0002-4869-1328ORCID · corroborated

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

Artificial intelligence and machine learning · 6 · 6 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 first-author · 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.

Artificial intelligence
1 paper
Kernel, tree and ensemble methods · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Kernel, tree and ensemble methods
ensemble learning
0.712023
BoostTree and BoostForest for Ensemble Learning · IEEE Trans. Pattern Anal. Mach. Intell. 2023
Machine learning › Kernel, tree and ensemble methods
gradient boosting
0.712023
BoostTree and BoostForest for Ensemble Learning · IEEE Trans. Pattern Anal. Mach. Intell. 2023
Machine learning › Kernel, tree and ensemble methods
decision tree
0.212023
BoostTree and BoostForest for Ensemble Learning · IEEE Trans. Pattern Anal. Mach. Intell. 2023

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

random cut-points · 0.7gradient boosting · 0.7bootstrapping · 0.7
YearPublicationVenuePosition
2026 fastSeizureNet: Accurate and efficient knowledge-data fusion for semi-supervised seizure detection
Jiayu An, Ruimin Peng, Xinyao Yang, Dongrui Wu
Neural Networks2
2024 Knowledge-Data Fusion Based Source-Free Semi-Supervised Domain Adaptation for Seizure Subtype Classification
abstract
Electroencephalogram (EEG)-based seizure sub-type classification enhances clinical diagnosis efficiency. Source-free semi-supervised domain adaptation (SF-SSDA), which transfers a pre-trained model to a new dataset with no source data and limited labeled target data, can be used for privacy-preserving seizure subtype classification. This paper considers two challenges in SF-SSDA for EEG-based seizure subtype classification: 1) How to effectively fuse both raw EEG data and expert knowledge in classifier design? 2) How to align the source and target domain distributions for SF-SSDA? We propose a Knowledge-Data Fusion based SF-SSDA approach, KDF-MutuaISHOT, for EEG-based seizure subtype classification. In source model training, KDF uses Jensen-Shannon Diver-gence to facilitate mutual learning between a feature-driven Decision Tree-based model and a data-driven Transformer-based model. To adapt KDF to a new target dataset, an SF-SSDA algorithm, MutualSHOT, is developed, which features a consistency-based pseudo-label selection strategy. Experiments on the public TUSZ and CHSZ datasets demonstrated that KDF-MutualSHOT outperformed other supervised and source-free domain adaptation approaches in cross-subject seizure subtype classification.
Ruimin Peng, Jiayu An, Dongrui Wu
SMC1
2023 DARC: High-dimensional Diffusing Anomaly Detection and Root Cause Location in Cloud Computing Systems
abstract
The modern cloud computing system has evolved into a highly dynamic and complex ecosystem with thousands of modules. Modifications and updates to these modules occur every day to accommodate customer needs. Unfortunately, these frequent changes may introduce anomalies to the system, whose diffusion can undermine the system performance and even cause system outage. Though very important, it is challenging to detect anomalies at the early stages and locate their root causes, due to the complexity of the cloud ecosystem and the huge number of attribute combinations. This paper proposes DARC for high-dimensional diffusing anomaly detection and root cause location in cloud computing systems. DARC uses first two-stage percentile analysis and Mann-Kendall score thresholding to detect rare anomalies, and then a bottom-up search strategy with three computational complexity reduction techniques to efficiently locate the root causes. Extensive experiments showed that DARC is able to accurately and efficiently locate root causes of diffusing anomalies. It has been successfully used in the daily practice of Alibaba Cloud, one of the world’s largest cloud computing service providers.
Wanning Sun, Xuhua Ma, Ruimin Peng, Yifan Xu 0015, Dongrui Wu
IEEE Big Data3
2023 WAVELET2VEC: A Filter Bank Masked Autoencoder for EEG-Based Seizure Subtype Classification
abstract
Electroencephalogram (EEG) based seizure subtype classification plays an important role in clinical diagnostics. However, existing deep learning approaches face two challenges in such applications: 1) convolutional or recurrent neural network based models have difficulty learning long-term dependencies; and, 2) there are not enough labeled seizure sub-type data for training such models. This paper proposes a Transformer-based self-supervised learning model for EEG-based seizure subtype classification, which copes well with these two challenges. Filter bank analysis is first employed to improve Vision Transformer as a Wavelet Transformer (WaT) encoder, which generates multi-grained feature representations of EEG signals. Then, self-supervised learning is used to pre-train WaT from unlabeled EEG data. Experiments on two public datasets demonstrated that Wavelet2Vec outperformed several other supervised and self-supervised models in cross-subject seizure subtype classification.
Ruimin Peng, Changming Zhao, Yifan Xu 0015, Guangtao Kuang, Jianbo Shao, Dongrui Wu
ICASSP1
2023 Cross-Modal Diversity-Based Active Learning for Multi-Modal Emotion Estimation
abstract
Emotion recognition is an important part of affective computing. Utilizing information from multiple modalities would facilitate more accurate emotion recognition. The performance of data-driven machine learning models usually relies on a large amount of labeled training data. However, labeling emotional data is expensive, because each sample usually requires multiple evaluators to annotate. To alleviate the annotation cost, this paper proposes a cross-modal diversity measure that considers the correlation between different modalities and integrates it with the representativeness for sample selection in unsupervised active learning (AL) for regression. To our knowledge, this challenging multi-modal unsupervised AL scenario has not been explored before: previous research only considered either unsupervised uni-modal AL or supervised multi-modal AL. Experiments on RECOLA and IEMOCAP datasets demonstrated the effectiveness of our proposed AL approach.
Yifan Xu 0015, Lubin Meng, Ruimin Peng, Yingjie Yin, Jingting Ding, Dongrui Wu
IJCNN3
2023 BoostTree and BoostForest for Ensemble Learning
abstract
Bootstrap aggregating (Bagging) and boosting are two popular ensemble learning approaches, which combine multiple base learners to generate a composite model for more accurate and more reliable performance. They have been widely used in biology, engineering, healthcare, etc. This article proposes BoostForest, which is an ensemble learning approach using BoostTree as base learners and can be used for both classification and regression. BoostTree constructs a tree model by gradient boosting. It increases the randomness (diversity) by drawing the cut-points randomly at node splitting. BoostForest further increases the randomness by bootstrapping the training data in constructing different BoostTrees. BoostForest generally outperformed four classical ensemble learning approaches (Random Forest, Extra-Trees, XGBoost and LightGBM) on 35 classification and regression datasets. Remarkably, BoostForest tunes its parameters by simply sampling them randomly from a parameter pool, which can be easily specified, and its ensemble learning framework can also be used to combine many other base learners.
Changming Zhao, Dongrui Wu, Jian Huang 0001, Ye Yuan 0002, Hai-Tao Zhang, Ruimin Peng, Zhenhua Shi
IEEE Trans. Pattern Anal. Mach. Intell.6
2023 Layer Normalization for TSK Fuzzy System Optimization in Regression Problems
abstract
Recently, mini-batch gradient descent (MBGD)-based optimization has become popular in Takagi–Sugeno–Kang (TSK) fuzzy system optimization. However, it suffers from some challenges, including the curse of dimensionality and the sensitivity to the choice of the optimizer. The former has been alleviated by our previously proposed high-dimensional TSK (HTSK) algorithm. In this article, we point out that the latter is caused by the gradient vanishing problem on the rule consequent parameters, which in turn is caused by the small magnitude of the normalized rule firing levels, especially when the number of rules is large. Thus, the rule consequents are easily trapped into a bad local minimum with poor generalization performance. We propose to use first layer normalization (LN) to amplify the small firing levels, and then rectified linear unit (ReLU) to discard rules far away from the current training sample. We evaluated our proposed HTSK-LN and HTSK-LN-ReLU on twelve regression datasets with various sizes and dimensionalities. Experiments demonstrated that they can significantly improve the generalization performance, regardless of the training set size, feature dimensionality, choice of the optimizer, and rulebase size.
Yuqi Cui, Yifan Xu 0015, Ruimin Peng, Dongrui Wu
IEEE Trans. Fuzzy Syst.3
2022 Transfer learning for motor imagery based brain-computer interfaces: A tutorial
Dongrui Wu, Ruimin Peng
Neural Networks3