Propagation of Gevrey regularity for solutions of Landau equations

By using the energy-type inequality, we obtain, in this paper, the result on propagation of Gevrey regularity for the solution of the spatially homogeneous Landau equation in the cases of Maxwellian molecules and hard potential

Gevrey Regularity for Solution of the Spatially Homogeneous Landau Equation

In this paper, we study the Gevrey class regularity for solutions of the spatially homogeneous Landau equations in the hard potential case and the Maxwellian molecules case

Analytic smoothness effect of solutions for spatially homogeneous Landau equation

In this paper, we study the smoothness effect of Cauchy problem for the spatially homogeneous Landau equation in the hard potential case and the Maxwellian molecules case. We obtain the analytic smoothing effect for the solutions under rather weak assumptions on the initial datum.Comment: 16 page

The Gevrey Hypoellipticity for linear and non-linear Fokker-Planck equations

In this paper, we study the Gevrey regularity of weak solution for a class of linear and quasilinear Fokker-Planck equations

Two-Stage Bagging Pruning for Reducing the Ensemble Size and Improving the Classification Performance

Ensemble methods, such as the traditional bagging algorithm, can usually improve the performance of a single classifier. However, they usually require large storage space as well as relatively time-consuming predictions. Many approaches were developed to reduce the ensemble size and improve the classification performance by pruning the traditional bagging algorithms. In this article, we proposed a two-stage strategy to prune the traditional bagging algorithm by combining two simple approaches: accuracy-based pruning (AP) and distance-based pruning (DP). These two methods, as well as their two combinations, “AP+DP” and “DP+AP” as the two-stage pruning strategy, were all examined. Comparing with the single pruning methods, we found that the two-stage pruning methods can furthermore reduce the ensemble size and improve the classification. “AP+DP” method generally performs better than the “DP+AP” method when using four base classifiers: decision tree, Gaussian naive Bayes, K-nearest neighbor, and logistic regression. Moreover, as compared to the traditional bagging, the two-stage method “AP+DP” improved the classification accuracy by 0.88%, 4.06%, 1.26%, and 0.96%, respectively, averaged over 28 datasets under the four base classifiers. It was also observed that “AP+DP” outperformed other three existing algorithms Brag, Nice, and TB assessed on 8 common datasets. In summary, the proposed two-stage pruning methods are simple and promising approaches, which can both reduce the ensemble size and improve the classification accuracy