Coupling techniques for nonlinear hyperbolic equations. Ⅱ. resonant interfaces with internal structure

Benjamin Boutin; Frédéric Coquel; Philippe G. LeFloch; Benjamin Boutin; Frédéric Coquel; Philippe G. LeFloch

doi:10.3934/nhm.2021007

Networks and Heterogeneous Media

2021, Volume 16, Issue 2: 283-315. doi: 10.3934/nhm.2021007

Previous Article Next Article

Coupling techniques for nonlinear hyperbolic equations. Ⅱ. resonant interfaces with internal structure

1.
Univ. Rennes, CNRS, IRMAR - UMR 6625, F-35000 Rennes, France
2.
Centre de Mathématique Appliquées, Ecole Polytechnique, Route de Saclay, 91128 Palaiseau Cedex, France
3.
Laboratoire Jacques-Louis Lions & Centre National de la Recherche Scientifique, Sorbonne Université, 75258 Paris, France

Received: 01 October 2020 Revised: 01 January 2021 Published: 07 February 2021
Primary: 35L65, 35D40

In the first part of this series, an augmented PDE system was introduced in order to couple two nonlinear hyperbolic equations together. This formulation allowed the authors, based on Dafermos's self-similar viscosity method, to establish the existence of self-similar solutions to the coupled Riemann problem. We continue here this analysis in the restricted case of one-dimensional scalar equations and investigate the internal structure of the interface in order to derive a selection criterion associated with the underlying regularization mechanism and, in turn, to characterize the nonconservative interface layer. In addition, we identify a new criterion that selects double-waved solutions that are also continuous at the interface. We conclude by providing some evidence that such solutions can be non-unique when dealing with non-convex flux-functions.

Keywords:

Citation: Benjamin Boutin, Frédéric Coquel, Philippe G. LeFloch. Coupling techniques for nonlinear hyperbolic equations. Ⅱ. resonant interfaces with internal structure[J]. Networks and Heterogeneous Media, 2021, 16(2): 283-315. doi: 10.3934/nhm.2021007

Related Papers:

[1]	Kawkab Al Amri, Qamar J. A Khan, David Greenhalgh . Combined impact of fear and Allee effect in predator-prey interaction models on their growth. Mathematical Biosciences and Engineering, 2024, 21(10): 7211-7252. doi: 10.3934/mbe.2024319
[2]	Saheb Pal, Nikhil Pal, Sudip Samanta, Joydev Chattopadhyay . Fear effect in prey and hunting cooperation among predators in a Leslie-Gower model. Mathematical Biosciences and Engineering, 2019, 16(5): 5146-5179. doi: 10.3934/mbe.2019258
[3]	Dirk Stiefs, Ezio Venturino, Ulrike Feudel . Evidence of chaos in eco-epidemic models. Mathematical Biosciences and Engineering, 2009, 6(4): 855-871. doi: 10.3934/mbe.2009.6.855
[4]	Yuhong Huo, Gourav Mandal, Lakshmi Narayan Guin, Santabrata Chakravarty, Renji Han . Allee effect-driven complexity in a spatiotemporal predator-prey system with fear factor. Mathematical Biosciences and Engineering, 2023, 20(10): 18820-18860. doi: 10.3934/mbe.2023834
[5]	Yuanfu Shao . Bifurcations of a delayed predator-prey system with fear, refuge for prey and additional food for predator. Mathematical Biosciences and Engineering, 2023, 20(4): 7429-7452. doi: 10.3934/mbe.2023322
[6]	Hongqiuxue Wu, Zhong Li, Mengxin He . Dynamic analysis of a Leslie-Gower predator-prey model with the fear effect and nonlinear harvesting. Mathematical Biosciences and Engineering, 2023, 20(10): 18592-18629. doi: 10.3934/mbe.2023825
[7]	Ranjit Kumar Upadhyay, Swati Mishra . Population dynamic consequences of fearful prey in a spatiotemporal predator-prey system. Mathematical Biosciences and Engineering, 2019, 16(1): 338-372. doi: 10.3934/mbe.2019017
[8]	Shunyi Li . Hopf bifurcation, stability switches and chaos in a prey-predator system with three stage structure and two time delays. Mathematical Biosciences and Engineering, 2019, 16(6): 6934-6961. doi: 10.3934/mbe.2019348
[9]	Rongjie Yu, Hengguo Yu, Chuanjun Dai, Zengling Ma, Qi Wang, Min Zhao . Bifurcation analysis of Leslie-Gower predator-prey system with harvesting and fear effect. Mathematical Biosciences and Engineering, 2023, 20(10): 18267-18300. doi: 10.3934/mbe.2023812
[10]	Wanxiao Xu, Ping Jiang, Hongying Shu, Shanshan Tong . Modeling the fear effect in the predator-prey dynamics with an age structure in the predators. Mathematical Biosciences and Engineering, 2023, 20(7): 12625-12648. doi: 10.3934/mbe.2023562

Abstract

1. Introduction

The class imbalance problem refers to the hot potato that the quantity of one class presents abnormal characteristic, which is much larger or less than the other classes of samples and the cost of misclassification between this classes of samples is different, leading to failure for standard classifiers. Thus, characteristics of class imbalanced datasets are shown as follows: the quantity imbalanced of different classes of samples and the cost imbalanced of miscalculation (Li et al., 2019). Usually, class imbalanced learning methods are considered as the technologies that can solve the above problem, which are widely used in several files such as bioinformatics (Blagus and Lusa, 2013), software defect monitoring (Lin and Lu, 2021), text classification (Ogura et al., 2011), and computer vision (Pouyanfar and Chen, 2015) etc. Therefore, these broad applications reveal tremendous value to research class imbalanced learning methods.

Standard classifiers such as logistic regression (LR), Support Vector Machine (SVM) and decision tree (DT) are suitable for balanced training sets. When facing imbalanced scenarios, these models often provide suboptimal classification results (Ye et al., 2019). For example, when facing imbalanced datasets, it is possible that unsatisfactory classification result was produced by Bayesian classifier, and the unsatisfactory classification result was influenced by the overlapping range of different class in the sample space (Domingos and Pazzani, 1997). Similarly, when the SVM classifier is employed to handle class imbalanced datasets, the optimal hyperplane will move to the core range of the majority class. Particularly, when data sets present the characteristic of highly imbalanced (Jiang et al., 2019) or interclass aggregation (Zhai et al., 2010), we obtained outcome that all sub-cluster samples of the minority class will be misclassified.

Therefore, the class imbalanced influenced the result of standard classifiers (Yu et al., 2019). Generally speaking, the class imbalance ratio (IR) is defined as the ratio of majority class size to minority class size, which can measure the degree of class imbalance in data sets. According to literature analysis, the result of standard classifiers influenced by class imbalanced was generally positive proportion that the greater IR was, the greater the impact has (Cmv and Jie, 2018). However, we should realize that class imbalance does not always lead poor results to the classifier. In addition, the following are also some factors that affect the results of standard classifiers:

● The scale of the overlapping space, which refers to the feature that different classes of samples have no clear boundary in the sample space.

● The number of noise samples, which refers to a few examples of one class far away from the core area of the class (López et al., 2015).

● The number of training samples, which refers to the model training samples (Yu et al., 2016).

● The degree of interclass aggregation, which refers to this feature that one class samples present two or more clusters in the sample space, and these clusters can distinguish major and minor (Japkowicz et al., 2002).

● The dimension of dataset, which refers to the number of features.

The above factors lead a suboptimal result. It is worth noting that when the above factors appear in the imbalanced datasets, worse results will emerge than of in the balanced scenario. Here, we generated a series of data sets to verify the influence of these factors on standard classifiers. Detailed results are shown in the appendix.

In this research, we aim to provide an overview of class imbalanced learning methods. The rest of this research is organized as follows. Section 2 introduces approaches to addressing class imbalanced dataset both data driven and algorithm driven. Section 3 provides a review of measurement of classifier performance to class imbalanced classifiers. In Section 4, we discuss our opinions for the challenges and directions of future from to analysis of relevant literature. Finally, Section 5 presents the conclusions of this study.

2. Data driven methods and algorithm driven methods

The research of class imbalance learning originated in the late 1990s. Since then, numerous methods have been developed. Thus, this study discusses the key methods to handle class imbalanced problems from data driven (Liu et al., 2019) and algorithm driven (Wu et al., 2019).

2.1. Data driven methods

Methods from the data drive, also known as data-level methods or resampling methods. These methods reverse the property of the imbalance characteristics of classes' quantity by randomly generating cases of the minority class (ROS) or removing cases of the majority class (RUS). It can be regarded as one of data preprocessing processes, therefore, resampling and the classifier training processes are independent on each other, and it was compatible with standard classifiers (Maurya and Toshniwal, 2018; Wang and Minku, 2015).

About methods of data driven can be described as follows.

Firstly, researchers pointed out that the random resampling can be used to deal with class imbalanced datasets, which was the simplest data-driven method to improve the classification accuracy of the minority class. But the uncomplicated data driven methods present some shortcomings, for instance, longer learning time, more running memory and poor generalization ability were presented by Oversampling due to the repeatability of samples. In addition, Undersampling will reduce the performance of classification owing to the lack of information resulted from the elimination of samples. Secondly, as the disadvantages of simple random sampling technology were exposed, some better methods were developed such as the synthetic minority oversampling techniques (SMOTE) (Chawla et al., 2011) and Borderline-SMOTE (Hui et al., 2005). The former method was proposed by Chawla et al. (2002). It was an oversampling algorithm that based on k-nearest neighbor (KNN) to synthesize a new virtual sample of the minority classes randomly among the minority class. Compared with ROS, SMOTE had a stronger ability of generalization and overcame overfitting in a certain extent. Borderline-SMOTE was an oversampling strategy based on SMOTE. Borderline-SMOTE synthesizes mainly the minority class samples at the class boundary, therefore, the method's classification result was better than SMOTE when one dataset with a few noise samples. In recent years, with the continuous progress of computer technology, some more superior methods have been proposed such as the cleaning resampling method (Koziarski et al., 2020), and based-radial undersampling method (Krawczyk et al., 2020), etc. Analyzing data driven methods, Yu deemed that the data driven methods underwent three stages random sampling technology stage, manual sampling technology stage and complex algorithm stage (Yu, 2016), shown in Figure 1.

Figure 1. The three stages of methods from data driven.

DownLoad: Full-Size Img PowerPoint

Table 1 provides a summary of data driven method and its analysis. We can draw that the overlapping was important factor affecting the impact of standard classifiers, and that different cases were have different impacts on classification in the sample space, and that some concepts were defined by researchers such as "energy (Li L et al., 2020)" to provide some information for resampling.

Table 1. The summary of some methods from data driven.

	Methods and illustrations
Over-sampling	ROS: generated the cases of the minority class randomly
Over-sampling	SMOTE: generated the cases of the minority class with KNN randomly
Under-sampling	Borderline-SMOTE: generated the cases of the minority with SMOTE in overlapping range
	EOS: generated the cases of the minority class randomly with "entropy" information
	RBO: generated the cases of the minority class randomly with "radial" information
	RUS: removed the cases of the majority class randomly
	SMOTE + ENN (Tao et al., 2019): removed the cases of the majority class with KNN randomly
	SMOTE + Tomek (Wang et al., 2019): removed the cases of the majority with deleting Tomek cases
	OSS (Rodriguez et al., 2013): removed the cases of the majority with just deleting the case of the majority in Tomek cases
	SBC (Xiao and Gao, 2019): removed the cases of the majority class with the clustering theory randomly
Hybrid sampling	EUS: removed the cases of the majority class randomly with "entropy" information
	EHS: hybrid resampling that entropy based
	CCR: hybrid resampling that synthesizing and cleaning based

| Show Table

DownLoad: CSV

2.2. Algorithm driven methods

Data driven methods are regarded as independent of classifiers methods. Yet algorithm driven methods are regarded as dependent classifiers methods. These methods are improving standard classifiers that include cost-sensitive learning based and threshold moved based mainly. For methods of algorithm driven, the main core algorithm was cost sensitive learning, and the supported learning algorithms include four learning technologies: active learning, decision compensation learning, feature extraction learning and emblems learning.

2.2.1. Cost-sensitive learning

Cost sensitive learning was one of the frequently used technologies to solve the problem of class imbalanced (Wan and Yang, 2020), and its goal is to minimize the cost of overall misclassification. In the process of model learning, according to the practical problems, different factors of penalty cost were given to different classes. Cost sensitive learning's core is the design of cost matrix which could combine with the standard classifiers model to improve classification result (Zhou and Liu, 2010). For instance, we could obtain a posteriori probability which was more suitable for dealing with class imbalance problems, though the original Bayesian classifier posterior probability was fused with cost matrix (Kuang et al., 2019). And DT classifier integrated cost matrix into the process of attribute selection and pruning for the purpose of optimizing the classification result (Ping et al., 2020).

What the above analysis shows is that the technology was strongly dependent on cost matrix. Main design methods are as follows:

● Empirical weighted design, which shows that the cost coefficients of the samples of the same class are the same (Zong et al., 2013).

● Fuzzy weighted design, which shows that the cost coefficients of the same class are different in different position of sample spaces (Dai, 2015).

● Adaptive weighted design, which is iterative and dynamic, converging to the global optimum in an adaptive way (Sun et al., 2007).

2.2.2. Active learning

Active learning's core idea refers to obtain cases that are difficult to mark out class to train one model. For active learning: firstly, the experts manually labelled the sample labels served as the initial training set, and then put it to use to learn the classifier. Secondly, some query algorithms were used to select samples that samples of one class are indistinguishable from other classes. And these samples are labeled by experts to expand the training dataset. Thirdly, the label samples are added to train a new classifier. After repeating step two and step three, qualified classifier is obtained. Merit of active learning is decreasing size of train samples, keeping main information, and reducing manual (Attenberg and Ertekin, 2013).

2.2.3. Decision adjustment learning

Decision Adjustment learning modifies the decision threshold, which is directly making positive compensation for the decision to correct the original unsatisfactory decision. In essence, it is an adjustment strategy, which makes the classification results tend to core range of the minority (Gao et al., 2020).

2.2.4. Feature extraction learning

Class imbalanced learning from feature selection driven refers to which the key features are preserved, which can increase the discrimination degree between the minority class and the majority classes, and improve the accuracy of the minority class and even any class. Feature extraction skills mainly include convolution neural network (CNN) and recurrent neural network (RNN) (Hua and Xiang, 2018). According to whether or not the evaluation criteria selected by feature selection are related to classifiers, three models have been developed: filter, wrapper and embedded (Bibi and Banu, 2015). These above ideas were noticed by researchers, and then series features of driven based algorithms were proposed (Shen et al., 2017; Xu et al., 2020). These algorithms have been applied to high dimensional data processing such as software defect (He et al., 2019), bioinformatics (Sunny et al., 2020), natural language processing (Wang et al., 2020) and network public opinion analysis (Luo and Wu, 2020).

2.2.5. Ensemble learning

Ensemble learning can first review the idea of cascade multi classification integration system written by Sebestyen. Ensemble learning is also one of the important technologies of machine learning. It can solve the limitations of some single algorithms by strategically building multiple base algorithms and combing them to complete classification task. One weak classifier that is slightly better than random conjecture can be promoted to a strong classifier by ensemble learning (Witten et al., 2017; Schapire, 1990).There are two leading frameworks for ensemble learning: one is Bagging framework (Breiman, 1996), and the representative algorithm is random forest algorithm (Verikas et al., 2011), and the other is Boosting framework (Ling and Wang, 2014; Li et al., 2013), and the representative algorithm is AdaBoost algorithm (Schapire, 2013).

Resampling-based ensemble learning, which is defined as an ingenious combination of resampling and ensemble learning. The simplicity of bagging paradigm firstly was noticed by researchers, and then multifarious algorithms have been developed, such as AsBagging algorithm (Tao et al., 2006) and UnderOverBagging algorithms (Wang and Yao, 2009). The former perfectly combines RUS with Bagging, and its merit is that it could reserve all cases of the majority class and reduce overfitting degree of the minority class. Meanwhile, AsBagging algorithm makes the classification result more stable because of the random resampling method and ensemble learning. Nevertheless, the result of the algorithm may is swinging with handing multi-noise datasets, and the reason is that the algorithm uses Bootstrap technology to create the train datasets of the basic algorithm. Thus, AsBagging_FSS algorithm (Yu and Ni, 2014) was proposed, which combined with the random feature subspace generation strategy (FSS). Because FSS can reduce the impact of noise samples on the basic classification algorithm, the classification results of the basic classification of the algorithm can get a better result. Therefore, AsBagging_FSS algorithm is better than AsBagging_FSS in dealing with the imbalanced data sets with noise samples. Except for combination of the resampling methods and Bagging ensemble learning framework, researchers also research the combination of the Booting framework and then develop some algorithms, such as SMOTEBoost algorithm (Chawla et al., 2003) and RUSBoost algorithm (Seiffert, 2010). Besides, the Hybrid framework (Galar, 2012) that was fusion of the Bagging and the Boosting was also noticed by researchers. Based on this idea, EasyEnsemble algorithm and BalanceCascade algorithm were proposed by Liu et al (Liu et al., 2009).EasyEnsemble algorithm is Bagging-based AdaBoost ensemble learning algorithm, which used Adaboost algorithm as basic classifier and first uses RUS algorithm to generate balanced train datasets of basic algorithm. EasyEnsemble algorithm can lower the variance and deviation of classification result, which makes the classification result become stable and presents stronger generalization ability. The BalanceCascade algorithm is improved EasyEnsemble algorithm. This algorithm's ingenious idea is that the correctly classified samples are constantly removed in the basic classifier train datasets, so that the classifier can repeatedly learn misclassified samples. Therefore, the generation of base classifier in the former algorithm is a parallel relationship, while the generation of base classifier in the latter algorithm is a serial relationship. Some representative algorithms are shown in Table 2.

Table 2. Representatives of ensemble learning methods.

	Algorithms	Ensemble frameworks	Combined strategies
Data driven	AsBagging	Bagging	Bootstrap
	UnderBagging	Bagging	Undersampling
	OverBagging	Bagging	Oversampling
	SMOTEBagging	Bagging	SMOTE
	SMOTEBoost	Boost	SMOTE
	RUSBoost	Boost	Undersampling
	EasyEnsemble	Hybrid	Undersampling
	BalanceCascade	Hybrid	Undersampling
Cost-sensitive	CS-SemiBagging	Bagging	Fuzzy cost matrix
	AdaCX	Boost	Empirical cost matrix
	AdaCost	Boost	Fuzzy cost matrix
	DE-CStacking	Stacking	Adaptive cost matrix

| Show Table

DownLoad: CSV

Ensemble algorithm is based on cost sensitive learning, which combines cost sensitive learning with ensemble learning. For example, AdaCX algorithm (Sun et al., 2007), which combines cost sensitive learning and AdaBoost algorithm, aiming to giving a larger weight to the minority class. The core of this algorithm is that update weights are different from different classes, which can be able to amplify effect of the cost sensitive, and AdaC1, AdaC2 and AdaC3 algorithm are developed based on different update weights. In addition, similar algorithms include AdaCost algorithm (Zhang, 1999), CBS1 algorithm and CBS2 algorithm (Ling, 2007). In addition, algorithms based on other frames are developed, such as the CS-SemiBagging algorithm of based Bagging ensemble framework (Ren et al., 2018), and the DE-CStacking algorithm (Gao et al., 2019) of based Stacking ensemble framework (Wolpert, 1992).

Ensemble learning algorithm is based on decision adjustment learning, among these algorithms, the classical algorithm is EnSVM-OTHR algorithm (Yu et al., 2015), which is the SVM-OTHR algorithm as the basic classifier and Bagging frameworks as the learning framework. EnSVM-OTHR algorithm uses bootstrap sampling and random interference to enhance the diversity of basic classifiers.

From the above analysis, we can draw a conclusion that ensemble learning can be applied to deal with the problem of class imbalance, especially for linear indivisible data, the ensemble learning presents better classification results. In the future, the ensemble-based class imbalanced learning methods will be one of the main research directions (Tsai and Liu, 2021). However, ensemble learning presents disadvantages of long training time and high computational complexity. Especially, it is also a bottleneck to deal with high dimensional and large scale data. Therefore, ensemble learning based on algorithms are facing with new challenges and opportunities in the era of big data. To solve this problem, ensemble learning can combine with feature extraction to reduce the data dimension. Or we deal with the problem of computational complexity by using the distributed Computing (Yang, 1997; Guo et al., 2018).

To sum up, the class imbalanced learning methods were analyzed from two different motivations. Although methods are from different ideas, the pursuit of the goal is consistent. Both data-driven methods and algorithm driven methods pursue the maximum accuracy of all classes. Therefore, methods from the data driven are essentially the same as the cost sensitive technology of some methods from algorithm driven. For example, in the random oversampling, in generating cases of the minority classes to balance quantity, it is also equivalent to giving the classifier a cost of IR times to the minority for some classifiers. The methods of manual resampling are similar to the idea of fuzzy cost sensitive algorithms, both of which use the prior information of samples to generate cases of the minority class or obtain the cost matrix.

Based on the above analysis, related experiments were designed:

● Experimental environment: Python 3.8.5 (64x), sklearn module, decision tree classifier (DT), default parameters.

● Dataset from keel website, shown in the Table 3, and the ratio of train set to test set is set to 7:3, which designates "Tra: Tes".

Table 3. Summary of data sets used in the experiment.

Data sets	Variates	Size	IR	Tra: Tes
yeast	8	514	9.08	7:3
glass	9	314	3.20	7:3
cleveland	13	177	16.62	7:3
vehicle	18	846	3.25	7:3

| Show Table

DownLoad: CSV

We designed 10 oversampling experiments for that dataset, and randomly recorded the experimental results of four of them and calculated that average, numbered as "1", "2", "3", "4", and "average". We also designed an empirical weighted cost sensitive experiment as a contrast, and the result of the experiment is numbered "cost-sen". This conclusion has been obtained that cost sensitive experiment may catch similar classification results in oversampling experiments. Above analysis is shown in the Table 4.

Table 4. Results from DT classifier of oversampling-based and cost sensitive based.

Dataset	Item	Precision	Recall	F1-Score	Accuracy
yeast	1	0.9231	0.5714	0.7059	0.9355
	2	0.8462	0.6471	0.7333	0.9484
	3	0.9231	0.5714	0.7059	0.9355
	4	0.8462	0.5500	0.6667	0.9290
	average	0.8847	0.5850	0.7030	0.9371
	cost-sen	0.92310	0.5714	0.7059	0.9355
glass	1	0.8125	1.0000	0.8966	0.9538
	2	0.8750	1.0000	0.9333	0.8769
	3	0.9375	1.0000	0.9677	0.9846
	4	0.9375	1.0000	0.9677	0.9846
	average	0.8906	1.0000	0.9413	0.9500
	cost-sen	0.8750	1.0000	0.9333	0.8769
cleveland	1	0.6667	0.3333	0.4444	0.9038
	2	0.3333	0.2500	0.2857	0.9038
	3	0.3333	0.2000	0.2500	0.8846
	4	0.3333	0.2500	0.2857	0.9038
	average	0.4167	0.2583	0.3165	0.8990
	cost-sen	0.3333	0.2500	0.2857	0.9038
vehicle	1	0.8788	0.9062	0.8923	0.9449
	2	0.8333	0.9016	0.8661	0.9331
	3	0.8636	0.9194	0.8906	0.9449
	4	0.8485	0.918	0.8819	0.9409
	average	0.8561	0.9113	0.8827	0.94095
	cost-sen	0.8182	0.9153	0.8640	0.93310

| Show Table

DownLoad: CSV

After analyzing, we can acquire the general processing to imbalanced datasets, shown in Figure 2.

Figure 2. Flowchart of the handle to class imbalanced data.

DownLoad: Full-Size Img PowerPoint

Thus, we can draw the following conclusions. If one dataset is class imbalanced and non-overlapping, it is possible that standard classifiers are not affected. When it is overlapping in sample space to the dataset, it is difficult to categorize the sample of overlapping range; decision result is affected by the inverse probability theory which makes the decision results prefer the majority class. In this case, class imbalanced learning methods such as the data driven or algorithm driven method mentioned above can be employed. Or when the dataset has the phenomenon of interclass aggregation, it is difficult for a single classifier to distinguish the samples of the sub-aggregation range of the minority class. So, we can use ensemble-based class imbalanced learning to solve this data. In this way, it may improve the accuracy of all classes of the single classifier. In addition, when we get one classifier, we also can adjust the decision threshold by the decision adjustment learning according to experience, which may achieve better results. The whole process is illustrated in Figure 2.

3. Evaluation indexes

For result evaluation indexes of the different classifiers, a series of indexes such as threshold based, probability based and grade based can be found in some scientific literature (Luque et al., 2019). But some indexes of standard classifiers are unsuitable for the study file of the class imbalanced classifiers. Usually, we use robustness indexes such as F-measure, G-means metric, MCC and AUC. These based on confusion matrix indexes are creative.

An explanation of the Table 5: TP (TN) is the number of samples that originally belong to the positive (negative) class and belong to the positive (negative) class after classification, which represents the number that is correctly classified; FP (FN) is the number of samples that originally belong to the negative (positive) class and belong to the positive (negative) class after classification, which represents the number of misclassifications.

Table 5. Confusion matrix of classification results.

	Prediction positive	Prediction negative
Positive class	True positive (TP)	False negatives (FN)
Negative class	False positive (FP)	True negatives (TN)

| Show Table

DownLoad: CSV

A series of concepts such as Precision, Recall and TNP etc. are constructed by researchers:

$A\mathrm{c}\mathrm{c}\mathrm{u}\mathrm{r}\mathrm{a}\mathrm{c}\mathrm{y}\mathrm{ } = \frac{\mathrm{T}\mathrm{P}\mathrm{ }+\mathrm{ }\mathrm{T}\mathrm{N}}{\mathrm{T}\mathrm{P}\mathrm{ }+\mathrm{ }\mathrm{T}\mathrm{N}\mathrm{ }+\mathrm{ }\mathrm{F}\mathrm{P}\mathrm{ }+\mathrm{ }\mathrm{F}\mathrm{N}}$

(1)

$Precision = \frac{TP}{TP + FP}$

(2)

$Recall = \frac{TP}{TP + FN}$

(3)

$TNR = \frac{TN}{TN+FP}$

(4)

$G-Mean = \sqrt{TPR\times TNR}$

(5)

$F-Measure = Precision\times Recall$

(6)

$\mathrm{F}1\mathrm{ }-\mathrm{ }\mathrm{s}\mathrm{c}\mathrm{o}\mathrm{r}\mathrm{e} = 2\mathrm{ }\times \frac{Precision\times Recall}{Precision+Recall}$

(7)

$\mathrm{M}\mathrm{C}\mathrm{C}\mathrm{ } = \frac{TP\times TN-FP\times FN}{\sqrt{\left(TP+FP\right)\left(TP+FN\right)\left(TN+FN\right)\left(TN+FN\right)}}$

(8)

Equation (3)'s "Recall" also can be called TPR.

G-mean is the geometric mean that is the accuracy of the positive class and the negative class. When the accuracy of the two classes is robustness, the G-Mean value becomes the optimal value. F-Measure is some similarity in the principle G-Mean. When the value of the Precision and Recall is roughly the same, the F-Measure value also becomes the optimal value. MCC represents the correlation degree between the real result and the predicted result, which is not affected by the class imbalance data. As one of correlation coefficients, the MCC value range is between −1 and 1. AUC is the area under ROC, and ROC is an important plane curve by FPR as the horizontal coordinate and TPR as the vertical coordinate.

4. Challenges and prospects

At present, class imbalanced learning methods have developed many mature methods in binary data, and a lot of algorithms and tools are used in various applications. In this era of big data, class imbalanced learning methods are facing some new challenges (Leevy et al., 2018; Chandresh et al., 2016):

● Large scale data processing problems: overcoming the increasing computational complexity and memory consumption.

● High dimensional data processing problems: sparse data processing.

● Data stream processing problems: the development of scalable online algorithms.

● Missing label data processing problems: semi supervised algorithm development.

● Multi class imbalance processing problems: the new definition of class imbalanced degree.

● Highly imbalanced processing problems: the development of accurate discriminant algorithms for the minority samples.

Nowadays, the processing of the class imbalanced problem is still research hotspot. The future research prospects are as follows:

● Strengthen theoretical research and enhance the interpretability of the algorithms. So far, there is a lack of theoretical research on class imbalanced model classification. It is difficult to interpret some the methods and evaluation is empirical.

● Adapt to the current research and be fit to the topical development. The complex data lead to the failure result of many traditional methods. Therefore, auxiliary technologies such as feature creation, feature extraction and active learning will be further applied in the study of the complex data.

5. Conclusions

In this research, we attempted to provide a review of methods in class imbalance problem. Different from other researches that have been published in imbalanced learning field, research are reviewed from both core technologies which are including the resampling methods and the cost sensitivity learning, and supporting technologies which include the active leaning and others. Through our analysis, we found some interesting conclusions flowingly:

● Data resampling based on classifiers are generally used in biomedical field due to the fact that biomedical data generally are fixed with structure and have multifarious similarity measurement between samples. Cost-sensitive learning technology is generally used in the operational research field, because its goal is to minimize the cost. With the improvement of data technology, data with high dimensionality and large scale are aroused by sensors. Feature extraction learning is used to reduce the complexity of some algorithms by reducing the dimension in high dimensional data. Distributed computing technology will be used to relieve the problem of insufficient memory in the single machine model in large scale data.

● The class imbalance rate is not an absolute condition that affects the result of the standard classifier. The standard classification model, in which the class of data is non-overlapping in the sample space, can also train outstanding result. When facing various datasets, researchers will choose the appropriate processing method according to the different data characteristics. For instance, when facing datasets with interclass aggregation factor, researchers often choose ensemble learning and complex classifiers that enable to distinguish examples of the secondary features of in interclass. When facing datasets with fewer labels, researchers will choose semi-supervised, active learning and other supporting technologies to fit to the imbalanced dataset.

● The main challenge to fit to valid classifiers for class imbalanced datasets is the increasing complexity of data. For example, the processing of unstructured data such as language, text and web pages often needs data cleaning and feature representation. In addition, the handing of stream data generated by sensors requires developing dynamic learning algorithm with strong scalability and non-traditional memory.

At the end of this study, the future research directions are put forward from reviewing, which is also our focus in the future research.

Acknowledgements

This work was supported by NSSF of China (18BTJ029).

Conflict of interest

All authors declare no conflicts of interest in this paper.

References

[1]	Optimal entropy solutions for conservation laws with discontinuous flux-functions. J. Hyperbolic Differ. Equ. (2005) 2: 783-837.
[2]	Existence and stability of entropy solutions for a conservation law with discontinuous non-convex fluxes. Netw. Heterog. Media (2007) 2: 127-157.
[3]	Conservation law with the flux function discontinuous in the space variable. Ⅱ. Convex-concave type fluxes and generalized entropy solutions. J. Comput. Appl. Math. (2007) 203: 310-344.
[4]	Interface model coupling via prescribed local flux balance. ESAIM Math. Model. Numer. Anal. (2014) 48: 895-918.
[5]	B. Andreianov, Dissipative coupling of scalar conservation laws across an interface: theory and applications, in Hyperbolic Problems: Theory, Numerics and Applications, Vol. 17 of Ser. Contemp. Appl. Math. CAM, World Sci. Publishing, Singapore, 1 (2012), 123–135. doi: 10.1142/9789814417099_0009
[6]	B. Andreianov, The semigroup approach to conservation laws with discontinuous flux, in Hyperbolic Conservation Laws and Related Analysis with Applications, Vol. 49 of Springer Proc. Math. Stat., Springer, Berlin, Heidelberg, (2014), 1–22. doi: 10.1007/978-3-642-39007-4_1
[7]	B. Andreianov, New approaches to describing admissibility of solutions of scalar conservation laws with discontinuous flux, in CANUM 2014 - 42e Congrès National d'Analyse Numérique Vol. 50 of ESAIM Proc. Surveys, EDP Sci., Les Ulis, (2015), 40–65. doi: 10.1051/proc/201550003
[8]	On interface transmission conditions for conservation laws with discontinuous flux of general shape. J. Hyperbolic Differ. Equ. (2015) 12: 343-384.
[9]	On vanishing viscosity approximation of conservation laws with discontinuous flux. Netw. Heterog. Media (2010) 5: 617-633.
[10]	A theory of $L^1$ -dissipative solvers for scalar conservation laws with discontinuous flux. Arch. Ration. Mech. Anal. (2011) 201: 27-86.
[11]	B. Andreianov and D. Mitrović, Entropy conditions for scalar conservation laws with discontinuous flux revisited, Ann. Inst. H. Poincaré Anal. Non Linéaire, 32 (2015), 1307–1335. doi: 10.1016/j.anihpc.2014.08.002
[12]	Analysis of a Burgers equation with singular resonant source term and convergence of well-balanced schemes. Discrete Contin. Dyn. Syst. (2012) 32: 1939-1964.
[13]	Uniqueness for scalar conservation laws with discontinuous flux via adapted entropies. Proc. Roy. Soc. Edinburgh Sect. A (2005) 135: 253-265.
[14]	First order quasilinear equations with boundary conditions. Comm. Partial Differential Equations (1979) 4: 1017-1034.
[15]	An existence result for a constrained two-phase transition model with metastable phase for vehicular traffic. NoDEA Nonlinear Differential Equations Appl. (2018) 25: 48-90.
[16]	A Riemann solution approximation based on the zero diffusion-dispersion limit of Dafermos reformulation type problem. Calcolo (2019) 56: 28-60.
[17]	Why many theories of shock waves are necessary: Kinetic relations for non-conservative systems. Proc. Roy. Soc. Edinburgh Sect. A (2012) 142: 1-37.
[18]	Existence result for the coupling problem of two scalar conservation laws with Riemann initial data. Math. Models Methods Appl. Sci. (2010) 20: 1859-1898.
[19]	Coupling techniques for nonlinear hyperbolic equations. Ⅰ: Self-similar diffusion for thin interfaces. Proc. Roy. Soc. Edinburgh Sect. A (2011) 141: 921-956.
[20]	Coupling techniques for nonlinear hyperbolic equations. Ⅲ. The well–balanced approximation of thick interfaces. SIAM J. Numer. Anal. (2013) 51: 1108-1133.
[21]	Coupling techniques for nonlinear hyperbolic equations. Ⅳ. Well-balanced schemes for scalar multidimensional and multi-component laws. Math. Comp. (2015) 84: 1663-1702.
[22]	Conservation laws with discontinuous flux: A short introduction. J. Engrg. Math. (2008) 60: 241-247.
[23]	Why many theories of shock waves are necessary: convergence error in formally path-consistent schemes. J. Comput. Phys. (2008) 227: 8107-8129.
[24]	Theoretical and numerical aspects of the interfacial coupling: the scalar Riemann problem and an application to multiphase flows. Netw. Heterog. Media (2010) 5: 507-524.
[25]	The interface coupling of the gas dynamics equations. Quart. Appl. Math. (2008) 66: 659-705.
[26]	On the physical and the self-similar viscous approximation of a boundary Riemann problem. Riv. Math. Univ. Parma (N.S.) (2012) 3: 41-54.
[27]	Choice of measure source terms in interface coupling for a model problem in gas dynamics. Math. Comp. (2016) 85: 2305-2339.
[28]	Coupling conditions for isothermal gas flow and applications to valves. Nonlinear Anal. Real World Appl. (2018) 40: 403-427.
[29]	Polygonal approximations of solutions of the initial value problem for a conservation law. J. Math. Anal. Appl. (1972) 38: 33-41.
[30]	Solution of the Riemann problem for a class of hyperbolic systems of conservation laws by the viscosity method. Arch. Rational Mech. Anal. (1973) 52: 1-9.
[31]	C. M. Dafermos, Hyperbolic Conservation Laws in Continuum Physics, Volume 325 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], Springer-Verlag, Berlin, fourth edition, 2016. doi: 10.1007/978-3-662-49451-6
[32]	Definition and weak stability of nonconservative products. J. Math. Pures Appl. (1995) 74: 483-548.
[33]	Scalar conservation laws with discontinuous flux function.Ⅰ. The viscous profile condition. Comm. Math. Phys. (1996) 176: 23-44.
[34]	Scalar conservation laws with discontinuous flux function. Ⅱ. On the stability of the viscous profiles. Comm. Math. Phys. (1996) 176: 45-71.
[35]	Boundary conditions for nonlinear hyperbolic systems of conservation laws. J. Differential Equations (1988) 71: 93-122.
[36]	T. Galié, Interface Model Coupling in Fluid Dynamics, Application to Two-Phase Flows, Ph.D thesis, Université Pierre et Marie Curie - Paris VI, available from: https://tel.archives-ouvertes.fr/tel-00395593/, 2009.
[37]	The Aw-Rascle traffic model with locally constrained flow. J. Math. Anal. Appl. (2011) 378: 634-648.
[38]	Traffic flow on a road network using the Aw-Rascle model. Comm. Partial Differential Equations (2006) 31: 243-275.
[39]	P. Goatin and P. G. LeFloch, The Riemann problem for a class of resonant hyperbolic systems of balance laws, Ann. Inst. H. Poincaré Anal. Non Linéaire, 21 (2004), 881–902. doi: 10.1016/j.anihpc.2004.02.002
[40]	The numerical interface coupling of nonlinear hyperbolic systems of conservation laws. Ⅱ. The case of systems. M2AN Math. Model. Numer. Anal. (2005) 39: 649-692.
[41]	E. Godlewski and P.-A. Raviart, Hyperbolic Systems of Conservation Laws, Vol. 3/4 of Mathématiques & Applications, Ellipses, Paris, 1991.
[42]	The numerical interface coupling of nonlinear hyperbolic systems of conservation laws. Ⅰ. The scalar case. Numer. Math. (2004) 97: 81-130.
[43]	Modeling, simulation and optimization of gas networks with compressors. Netw. Heterog. Media (2007) 2: 81-97.
[44]	Why nonconservative schemes converge to wrong solutions. Error analysis. Math. of Comput. (1994) 62: 497-530.
[45]	Nonlinear resonance in systems of conservation laws. SIAM J. Appl. Math. (1992) 52: 1260-1278.
[46]	Boundary layers in weak solutions to hyperbolic conservation laws. Arch. Rational Mech Anal. (1999) 147: 47-88.
[47]	Boundary layers in weak solutions of hyperbolic conservation laws. Ⅱ. Self-similar vanishing diffusion limits. Commun. Pure Appl. Anal. (2002) 1: 51-76.
[48]	K. T. Joseph and P. G. LeFloch, Singular Limits for the Riemann Problem, General diffusion, Relaxation, and Boundary Conditions, in "New analytical approach to multidimensional balance laws", O. Rozanova ed., Nova Press, 2006.
[49]	Construction of generalized solutions of quasi-linear equations of first order without convexity conditions as limits of solutions of parabolic equations with a small parameter. Dokl. Akad. Nauk SSSR (1959) 127: 27-30.
[50]	Convex conservation laws with discontinuous coefficients. Existence, uniqueness and asymptotic behavior. Comm. Partial Differential Equations (1995) 20: 1959-1990.
[51]	First order quasilinear equations with several independent variables. Mat. Sb. (N.S.) (1970) 81: 228-255.
[52]	P. G. LeFloch, Shock waves for nonlinear hyperbolic systems in nonconservative form, Institute for Math. and its Appl., Minneapolis, IMA, 593 (1989).
[53]	Graph solutions of nonlinear hyperbolic systems. J. Hyperbolic Differ. Equ. (2004) 1: 643-689.
[54]	Systems of conservation laws with discontinuous fluxes and applications to traffic. Ann. Univ. Mariae Curie-Sklodowska, Sect. A (2019) 73: 135-173.
[55]	Analysis and approximation of a scalar conservation law with a flux function with discontinuous coefficients. Math. Models Methods Appl. Sci. (2003) 13: 221-257.
[56]	B. K. Shivamoggi, Nonlinear Dynamics and Chaotic Phenomena: An Introduction, Vol. 103 of Fluid Mechanics and Its Applications, Springer, Dordrecht, 2014. doi: 10.1007/978-94-007-7094-2
[57]	The problem of decomposition of an arbitrary discontinuity for a system of quasi-linear equations without the convexity condition. Ž. Vyčisl. Mat. i Mat. Fiz. (1966) 6: 527-547.
[58]	Wave interactions and variation estimates for self-similar zero-viscosity limits in systems of conservation laws. Arch. Rational Mech. Anal. (1996) 135: 1-60.

This article has been cited by:

1.	Vincent Peter C. Magboo, Ma. Sheila A. Magboo, 2022, Chapter 2, 978-3-031-14831-6, 23, 10.1007/978-3-031-14832-3_2
2.	M. Shyamala Devi, J. Arun Pandian, P. S. Ramesh, A. Prem Chand, Anshumam Raj, Ayush Raj, Rahul Kumar Thakur, 2023, Chapter 34, 978-981-19-5291-3, 363, 10.1007/978-981-19-5292-0_34
3.	Yuejun Guo, Qiang Hu, Qiang Tang, Yves Le Traon, 2024, Chapter 19, 978-3-031-51481-4, 371, 10.1007/978-3-031-51482-1_19
4.	Derrick Hoang Danh Nguyen, Arinah Jing Hui Tan, Ronjin Lee, Wei Feng Lim, Jia Yih Wong, Fadhlina Suhaimi, Monitoring of plant diseases caused by Fusarium commune and Rhizoctonia solani in bok choy using hyperspectral remote sensing and machine learning, 2024, 1526-498X, 10.1002/ps.8414
5.	Derrick Nguyen, Arinah Tan, Ronjin Lee, Wei Feng Lim, Tin Fat Hui, Fadhlina Suhaimi, Early detection of infestation by mustard aphid, vegetable thrips and two-spotted spider mite in bok choy with deep neural network (DNN) classification model using hyperspectral imaging data, 2024, 220, 01681699, 108892, 10.1016/j.compag.2024.108892
6.	Ananthajit Ajaya Kumar, Ashwani Assam, Addressing performance improvement of a neural network model for Reynolds-averaged Navier–Stokes solutions with high wake formation, 2024, 41, 0264-4401, 1740, 10.1108/EC-08-2023-0446
7.	Xiaoyan Zhao, Shaopeng Guan, CTCN: a novel credit card fraud detection method based on Conditional Tabular Generative Adversarial Networks and Temporal Convolutional Network, 2023, 9, 2376-5992, e1634, 10.7717/peerj-cs.1634
8.	Yan Peng, Hanzi Chen, Tinghui Li, The Impact of Digital Transformation on ESG: A Case Study of Chinese-Listed Companies, 2023, 15, 2071-1050, 15072, 10.3390/su152015072
9.	Jun Ye, Shoulei Lu, Jiawei Chen, A New Image Oversampling Method Based on Influence Functions and Weights, 2024, 14, 2076-3417, 10553, 10.3390/app142210553
10.	Chun-Chao Huang, Hsin-Fan Chiang, Cheng-Chih Hsieh, Bo-Rui Zhu, Wen-Jie Wu, Jin-Siang Shaw, Impact of Dataset Size on 3D CNN Performance in Intracranial Hemorrhage Classification, 2025, 15, 2075-4418, 216, 10.3390/diagnostics15020216

Reader Comments

Your name:*

Email:*
© 2021 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)