Entropy and Confidence-Based Undersampling Boosting Random Forests for Imbalanced Problems

Frame-Level Teacher-Student Learning With Data Privacy for EEG Emotion Recognition

Recently, electroencephalogram (EEG) emotion recognition has gradually attracted a lot of attention. This brief designs a novel frame-level teacher-student framework with data privacy (FLTSDP) for EEG emotion recognition. The framework first proposes a teacher-student network without prior professional information for automated filtering of useful frame-level features by a gated mechanism and extracting high-level features by using knowledge distillation to capture the results of EEG emotion recognition from a teacher network and student networks. Then, the results from subnetworks are integrated by using the novel decision module, which, motivated by the voting mechanism, adjusts the composition of feature vectors and improves the weight of accurate prediction to optimize the integration effect. During training, an innovative data privacy protection mechanism is applied for avoiding data sharing, where each student network only inherits weights from all trained networks and does not inherit the training dataset. Here, the framework can be repeatedly optimized and improved by only training the next student subnetwork on new EEG signals. Experimental results show that our framework improves the accuracy of EEG emotion recognition by more than 5% and gets state-of-the-art performance for EEG emotion recognition in the subject-independent mode.

Graph-Based Class-Imbalance Learning With Label Enhancement

Class imbalance is a common issue in the community of machine learning and data mining. The class-imbalance distribution can make most classical classification algorithms neglect the significance of the minority class and tend toward the majority class. In this article, we propose a label enhancement method to solve the class-imbalance problem in a graph manner, which estimates the numerical label and trains the inductive model simultaneously. It gives a new perspective on the class-imbalance learning based on the numerical label rather than the original logical label. We also present an iterative optimization algorithm and analyze the computation complexity and its convergence. To demonstrate the superiority of the proposed method, several single-label and multilabel datasets are applied in the experiments. The experimental results show that the proposed method achieves a promising performance and outperforms some state-of-the-art single-label and multilabel class-imbalance learning methods.

A DDoS Detection Method Based on Feature Engineering and Machine Learning in Software-Defined Networks

Distributed denial-of-service (DDoS) attacks pose a significant cybersecurity threat to software-defined networks (SDNs). This paper proposes a feature-engineering- and machine-learning-based approach to detect DDoS attacks in SDNs. First, the CSE-CIC-IDS2018 dataset was cleaned and normalized, and the optimal feature subset was found using an improved binary grey wolf optimization algorithm. Next, the optimal feature subset was trained and tested in Random Forest (RF), Support Vector Machine (SVM), K-Nearest Neighbor (k-NN), Decision Tree, and XGBoost machine learning algorithms, from which the best classifier was selected for DDoS attack detection and deployed in the SDN controller. The results show that RF performs best when compared across several performance metrics (e.g., accuracy, precision, recall, F1 and AUC values). We also explore the comparison between different models and algorithms. The results show that our proposed method performed the best and can effectively detect and identify DDoS attacks in SDNs, providing a new idea and solution for the security of SDNs.

Random Space Division Sampling for Label-Noisy Classification or Imbalanced Classification

This article presents a simple sampling method, which is very easy to be implemented, for classification by introducing the idea of random space division, called "random space division sampling" (RSDS). It can extract the boundary points as the sampled result by efficiently distinguishing the label noise points, inner points, and boundary points. This makes it the first general sampling method for classification that not only can reduce the data size but also enhance the classification accuracy of a classifier, especially in the label-noisy classification. The "general" means that it is not restricted to any specific classifiers or datasets (regardless of whether a dataset is linear or not). Furthermore, the RSDS can online accelerate most classifiers because of its lower time complexity than most classifiers. Moreover, the RSDS can be used as an undersampling method for imbalanced classification. The experimental results on benchmark datasets demonstrate its effectiveness and efficiency. The code of the RSDS and comparison algorithms is available at: https://github.com/syxiaa/RSDS.

Explicit Metric-Based Multiconcept Multi-Instance Learning With Triplet and Superbag

Multi-instance learning (MIL) has garnered considerable attention in recent years due to its favorable performance in various scenarios. Nonetheless, most previous studies have implicitly expressed the correlation between instances and bags. Moreover, the importance of negative instances has been largely overlooked. Hence, we seek to present an explicit and intuitively understandable method that can compensate for these deficiencies. In this article, we creatively introduce a metric-based multiconcept MIL approach based on two aspects. First, the triplet-based bag embedding method identifies instance categories and builds attention weights for every instance explicitly. Accordingly, bag embedding is accomplished under the limitation of weak supervision. Second, the developed instance correlation metric approach in the superbag considers the multiconcept issue to boost the model generalization performance. We have designed a rich variety of experiments to demonstrate the performance of our algorithm. The artificial data experiment reveals the interpretability of the proposed network. The results of the comparison experiment confirm that our method shows favorable performance in multiple tasks. Finally, we illustrate the motivation of the presented method by the ablation experiments.

Noise-Tolerant Discrimination Indexes for Fuzzy ɣ Covering and Feature Subset Selection

Fuzzy β covering (FBC) has attracted considerable attention in recent years. Nevertheless, as the basic information granularity of FBC, fuzzy β neighborhood does not satisfy reflexivity, which may lead to instability in classification learning and decision-making. Although a few studies have involved reflexive fuzzy β neighborhoods, they only focus on a single fuzzy covering and cannot effectively deal with the information representation and information fusion of multiple fuzzy coverings. Moreover, there is a lack of investigation on noise-tolerant uncertainty measures for FBC, as well as their application in feature selection. Motivated by these issues, we investigate a noise-tolerant variable precision discrimination index (VPDI) by means of a new reflexive fuzzy covering neighborhood. To this end, fuzzy ɣ neighborhood with reflexivity is introduced to characterize the information fusion of a fuzzy covering family. An uncertainty measure called fuzzy ɣ neighborhood discrimination index is then presented to reflect the discriminatory power of fuzzy covering families. Some variants of the uncertainty measure, such as variable precision joint discrimination index, variable precision conditional discrimination index, and variable precision mutual discrimination index, are then put forth by means of fuzzy decision. These VPDIs can be used as an evaluation metric for a family of fuzzy coverings. Finally, the knowledge reduction of fuzzy covering decision systems is addressed from the point of keeping the discriminatory power, and a heuristic feature selection algorithm is designed by means of the variable precision conditional discrimination index. The experiments on 16 public datasets exhibit that the proposed algorithm can effectively reduce redundant features and achieve competitive results compared with six state-of-the-art feature selection algorithms. Moreover, it demonstrates strong robustness to the interference of random noise.

An Intelligent Fusion Algorithm and Its Application Based on Subgroup Migration and Adaptive Boosting

Imbalanced data and feature redundancies are common problems in many fields, especially in software defect prediction, data mining, machine learning, and industrial big data application. To resolve these problems, we propose an intelligent fusion algorithm, SMPSO-HS-AdaBoost, which combines particle swarm optimization based on subgroup migration and adaptive boosting based on hybrid-sampling. In this paper, we apply the proposed intelligent fusion algorithm to software defect prediction to improve the prediction efficiency and accuracy by solving the issues caused by imbalanced data and feature redundancies. The results show that the proposed algorithm resolves the coexisting problems of imbalanced data and feature redundancies, and ensures the efficiency and accuracy of software defect prediction.