Application of new deep genetic cascade ensemble of SVM classifiers to predict the Australian credit scoring

A Fast Survival Support Vector Regression Approach to Large Scale Credit Scoring via Safe Screening

Survival models have found wider and wider applications in credit scoring recently due to their ability to estimate the dynamics of risk over time. In this research, we propose a Buckley-James safe sample screening support vector regression (BJS4VR) algorithm to model large-scale survival data by combing the Buckley-James transformation and support vector regression. Different from previous support vector regression survival models, censored samples here are imputed using a censoring unbiased Buckley-James estimator. Safe sample screening is then applied to discard samples that guaranteed to be non-active at the final optimal solution from the original data to improve efficiency. Experimental results on the large-scale real lending club loan data have shown that the proposed BJS4VR model outperforms existing popular survival models such as RSFM, CoxRidge and CoxBoost in terms of both prediction accuracy and time efficiency. Important variables highly correlated with credit risk are also identified with the proposed method.

Stacking-based and improved convolutional neural network: a new approach in rice leaf disease identification

Rice leaf diseases are important causes of poor rice yields, and accurately identifying diseases and taking corresponding measures are important ways to improve yields. However, rice leaf diseases are diverse and varied; to address the low efficiency and high cost of manual identification, this study proposes a stacking-based integrated learning model for the efficient and accurate identification of rice leaf diseases. The stacking-based integrated learning model with four convolutional neural networks (namely, an improved AlexNet, an improved GoogLeNet, ResNet50 and MobileNetV3) as the base learners and a support vector machine (SVM) as the sublearner was constructed, and the recognition rate achieved on a rice dataset reached 99.69%. Different improvement methods have different effects on the learning and training processes for different classification tasks. To investigate the effects of different improvement methods on the accuracy of rice leaf disease diagnosis, experiments such as comparison experiments between single models and different stacking-based ensemble model combinations and comparison experiments with different datasets were executed. The model proposed in this study was shown to be more effective than single models and achieved good results on a plant dataset, providing a better method for plant disease identification.

Credit scoring based on a Bagging-cascading boosted decision tree

Establishing precise credit scoring models to predict the potential default probability is vital for credit risk management. Machine learning models, especially ensemble learning approaches, have shown substantial progress in the performance improvement of credit scoring. The Bagging ensemble approach improves the credit scoring performance by optimizing the prediction variance while boosting ensemble algorithms reduce the prediction error by controlling the prediction bias. In this study, we propose a hybrid ensemble method that combines the advantages of the Bagging ensemble strategy and boosting ensemble optimization pattern, which can well balance the tradeoff of variance-bias optimization. The proposed method considers XGBoost as a base learner, which ensures the low-bias prediction. Moreover, the Bagging strategy is introduced to train the base learner to prevent over-fitting in the proposed method. Besides, the Bagging-boosting ensemble algorithm is further assembled in a cascading way, making the proposed new hybrid ensemble algorithm a good solution to balance the tradeoff of variance bias for credit scoring. Experimental results on the Australian, German, Japanese, and Taiwan datasets show the proposed Bagging-cascading boosted decision tree provides a more accurate credit scoring result.

Extreme Learning Machine Enhanced Gradient Boosting for Credit Scoring

Credit scoring is an effective tool for banks and lending companies to manage the potential credit risk of borrowers. Machine learning algorithms have made grand progress in automatic and accurate discrimination of good and bad borrowers. Notably, ensemble approaches are a group of powerful tools to enhance the performance of credit scoring. Random forest (RF) and Gradient Boosting Decision Tree (GBDT) have become the mainstream ensemble methods for precise credit scoring. RF is a Bagging-based ensemble that realizes accurate credit scoring enriches the diversity base learners by modifying the training object. However, the optimization pattern that works on invariant training targets may increase the statistical independence of base learners. GBDT is a boosting-based ensemble approach that reduces the credit scoring error by iteratively changing the training target while keeping the training features unchanged. This may harm the diversity of base learners. In this study, we incorporate the advantages of the Bagging ensemble training strategy and boosting ensemble optimization pattern to enhance the diversity of base learners. An extreme learning machine-based supervised augmented GBDT is proposed to enhance the discriminative ability for credit scoring. Experimental results on 4 public credit datasets show a significant improvement in credit scoring and suggest that the proposed method is a good solution to realize accurate credit scoring.

Default prediction of online credit loans based on mobile application usage behaviors

Credit scoring is widely used by financial institutions for default prediction, however, a significant portion of online credit loan customers have inadequate or unverifiable credit histories, making it difficult for financial institutions to make effective credit decisions. Since the widespread use of smartphones and the popularity of mobile applications, it is worth investigating whether mobile application usage behaviors (App behaviors) of customers can effectively predict online loan defaults. This paper proposes a combined algorithm of CNN and LightGBM, and establishes credit scoring models with App behaviors to evaluate the default risk of online credit loans based on logistic regression, LightGBM, CNN and the combined algorithm, respectively. The experimental results suggest that App behaviors have an obvious effect on the default prediction of customers applying for online credit loans, and the combined model outperforms the other models in terms of the area under the curve (AUC). Furthermore, integrated credit scoring models are developed by combining App behaviors with traditional scoring features. A comparison of the integrated models and the traditional scoring model indicates that the integrated models have achieved a significant improvement in classification performance and App behaviors can be a powerful complement to the traditional credit scoring model.

Boundaries tuned support vector machine (BT-SVM) classifier for cancer prediction from gene selection

In recent days, the identified genes which are detecting cancer-causing diseases are plays a crucial part in the microarray data analysis. Huge volume of data required since the disease changed often. Conventional data mining techniques are lacking in space concern and time complexity. Based on big data the proposed work is executed. Using the ISPCA - Improved Supervised Principal Component Analysis, feature extraction is developed in this study. For gene expression, co-variance matrix is generated and through feature selection cancer classification is performed by IPSCA. Further feature selection process by boundaries tuned support vector machines (BT-SVM) classifier and modified particle swarm optimization with novel wrapper model algorithm are performed. The experimentation is carried out by utilizing different datasets like leukaemia, breast cancer dataset, brain cancer, colon, and lung carcinoma from the UCI repository. The proposed work is executed on six benchmark dataset for DNA microarray data in terms of accuracy, recall, and precision to evaluate the performance of the proposed work. For evaluating the proposed work effectiveness, it is compared with various traditional techniques and resulted in optimum accuracy, recall, precision and training time with and without feature selection effectively.

Product Service System Configuration Based on a PCA-QPSO-SVM Model

To achieve sustainable development and improve market competitiveness, many manufacturers are transforming from traditional product manufacturing to service manufacturing. In this trend, the product service system (PSS) has become the mainstream of supply to satisfy customers with individualized products and service combinations. The diversified customer requirements can be realized by the PSS configuration based on modular design. PSS configuration can be deemed as a multi-classification problem. Customer requirements are input, and specific PSS is output. This paper proposes an improved support vector machine (SVM) model optimized by principal component analysis (PCA) and the quantum particle swarm optimization (QPSO) algorithm, which is defined as a PCA-QPSO-SVM model. The model is used to solve the PSS configuration problem. The PCA method is used to reduce the dimension of the customer requirements, and the QPSO is used to optimize the internal parameters of the SVM to improve the prediction accuracy of the SVM classifier. In the case study, a dataset for central air conditioning PSS configuration is used to construct and test the PCA-QPSO-SVM model, and the optimal PSS configuration can be predicted well for specific customer requirements.

THE ECONOMIC EXPLAINABILITY OF MACHINE LEARNING AND STANDARD ECONOMETRIC MODELS-AN APPLICATION TO THE U.S. MORTGAGE DEFAULT RISK

This study aims to bridge the gap between two perspectives of explainability−machine learning and engineering, and economics and standard econometrics−by applying three marginal measurements. The existing real estate literature has primarily used econometric models to analyze the factors that affect the default risk of mortgage loans. However, in this study, we estimate a default risk model using a machine learning-based approach with the help of a U.S. securitized mortgage loan database. Moreover, we compare the economic explainability of the models by calculating the marginal effect and marginal importance of individual risk factors using both econometric and machine learning approaches. Machine learning-based models are quite effective in terms of predictive power; however, the general perception is that they do not efficiently explain the causal relationships within them. This study utilizes the concepts of marginal effects and marginal importance to compare the explanatory power of individual input variables in various models. This can simultaneously help improve the explainability of machine learning techniques and enhance the performance of standard econometric methods.

Transmission Quality Classification with Use of Fusion of Neural Network and Genetic Algorithm in Pay&Require Multi-Agent Managed Network

Modern computer systems practically cannot function without a computer network. New concepts of data transmission are emerging, e.g., programmable networks. However, the development of computer networks entails the need for development in one more aspect, i.e., the quality of the data transmission through the network. The data transmission quality can be described using parameters, i.e., delay, bandwidth, packet loss ratio and jitter. On the basis of the obtained values, specialists are able to state how measured parameters impact on the overall quality of the provided service. Unfortunately, for a non-expert user, understanding of these parameters can be too complex. Hence, the problem of translation of the parameters describing the transmission quality appears understandable to the user. This article presents the concept of using Machine Learning (ML) to solve the above-mentioned problem, i.e., a dynamic classification of the measured parameters describing the transmission quality in a certain scale. Thanks to this approach, describing the quality will become less complex and more understandable for the user. To date, some studies have been conducted. Therefore, it was decided to use different approaches, i.e., fusion of a neural network (NN) and a genetic algorithm (GA). GA’s were choosen for the selection of weights replacing the classic gradient descent algorithm. For learning purposes, 100 samples were obtained, each of which was described by four features and the label, which describes the quality. In the reasearch carried out so far, single classifiers and ensemble learning have been used. The current result compared to the previous ones is better. A relatively high quality of the classification was obtained when we have used 10-fold stratified cross-validation, i.e., SEN = 95% (overall accuracy). The incorrect classification was 5/100, which is a better result compared to previous studies.

A Two-Stage Hybrid Default Discriminant Model Based on Deep Forest

Background: the credit scoring model is an effective tool for banks and other financial institutions to distinguish potential default borrowers. The credit scoring model represented by machine learning methods such as deep learning performs well in terms of the accuracy of default discrimination, but the model itself also has many shortcomings such as many hyperparameters and large dependence on big data. There is still a lot of room to improve its interpretability and robustness. Methods: the deep forest or multi-Grained Cascade Forest (gcForest) is a decision tree depth model based on the random forest algorithm. Using multidimensional scanning and cascading processing, gcForest can effectively identify and process high-dimensional feature information. At the same time, gcForest has fewer hyperparameters and has strong robustness. So, this paper constructs a two-stage hybrid default discrimination model based on multiple feature selection methods and gcForest algorithm, and at the same time, it optimizes the parameters for the lowest type II error as the first principle, and the highest AUC and accuracy as the second and third principles. GcForest can not only reflect the advantages of traditional statistical models in terms of interpretability and robustness but also take into account the advantages of deep learning models in terms of accuracy. Results: the validity of the hybrid default discrimination model is verified by three real open credit data sets of Australian, Japanese, and German in the UCI database. Conclusions: the performance of the gcForest is better than the current popular single classifiers such as ANN, and the common ensemble classifiers such as LightGBM, and CNNs in type II error, AUC, and accuracy. Besides, in comparison with other similar research results, the robustness and effectiveness of this model are further verified.

A dynamic center and multi threshold point based stable feature extraction network for driver fatigue detection utilizing EEG signals

Driver fatigue is the one of the main reasons of the traffic accidents. The human brain is a complex structure, whose function can be evaluated with electroencephalogram (EEG). Automated driver fatigue detection utilizing EEG decreases the incidence probability of related traffic accidents. Therefore, devising an appropriate feature extraction technique and selecting a competent classification method can be considered as the crucial part of the effective driver fatigue detection. Therefore, in this study, an EEG-based intelligent system was devised for driver fatigue detection. The proposed framework includes a new feature generation network, which is implemented by using texture descriptors, for fatigue detection. The proposed scheme contains pre-processing, feature generation, informative features selection and classification with shallow classifiers phases. In the pre-processing, discrete cosine transform and fast Fourier transform are used together. Moreover, dynamic center based binary pattern and multi threshold ternary pattern are utilized together to create a new feature generation network. To improve the detection performance, we utilized discrete wavelet transform as a pooling method, in which the functional brain network-based feature describing the relationship between fatigue and brain network organization. In the feature selection phase, a hybrid three layered feature selection method is presented, and benchmark classifiers are used in the classification phase to demonstrate the strength of the proposed method. In the experiments, the proposed framework achieved 97.29% classification accuracy for fatigue detection using EEG signals. This result reveals that the proposed framework can be utilized effectively for driver fatigue detection.

Deep sparse graph functional connectivity analysis in AD patients using fMRI data

Functional magnetic resonance imaging (fMRI) is a non-invasive method that helps to analyze brain function based on BOLD signal fluctuations. Functional Connectivity (FC) catches the transient relationship between various brain regions usually measured by correlation analysis. The elements of the correlation matrix are between -1 to 1. Some of them are very small values usually related to weak and spurious correlations due to noises and artifacts. They can not be concluded as real strong correlations between brain regions and their existence could make a misconception and leads to fake results. It is crucial to make a conclusion based on reliable and informative correlations. In order to eliminate weak correlations, thresholding is a common method. In this routine, by adjusting a threshold the values below the threshold turn to zero and the rest remains. In this paper, in addition to thresholding, two other methods including spectral sparsification based on Effective Resistance (ER) and autoencoders are investigated for sparsing the correlation matrices. Autoencoders are based on deep learning neural networks and ER considers the network as a resistive circuit. The fMRI data of the study correspond to Alzheimer's patients and control subjects. Graph global measures are calculated and a non-parametric permutation test is reported. Results show that the autoencoder and spectral sparsification achieved more distinctive brain graphs between healthy and AD subjects. Also, more graph global features were significantly different from these two methods due to better elimination of weak correlations and preserve more informative ones. Regardless of the sparsification method features including average strength, clustering, local efficiency, modularity, and transitivity are significantly different (P-value=0.05). On the other hand, the measures radius, diameter, and eccentricity showed no significant differences in none of the methods. In addition, according to three different methods, the brain regions show fragile and solid FCs are determined.

Fault Diagnosis of Permanent Magnet Synchronous Motor Based on Stacked Denoising Autoencoder

As a complex field-circuit coupling system comprised of electric, magnetic and thermal machines, the permanent magnet synchronous motor of the electric vehicle has various operating conditions and complicated condition environment. There are various forms of failure, and the signs of failure are crossed or overlapped. Randomness, secondary, concurrency and communication characteristics make it difficult to diagnose faults. Meanwhile, the common intelligent diagnosis methods have low accuracy, poor generalization ability and difficulty in processing high-dimensional data. This paper proposes a method of fault feature extraction for motor based on the principle of stacked denoising autoencoder (SDAE) combined with the support vector machine (SVM) classifier. First, the motor signals collected from the experiment were processed, and the input data were randomly damaged by adding noise. Furthermore, according to the experimental results, the network structure of stacked denoising autoencoder was constructed, the optimal learning rate, noise reduction coefficient and the other network parameters were set. Finally, the trained network was used to verify the test samples. Compared with the traditional fault extraction method and single autoencoder method, this method has the advantages of better accuracy, strong generalization ability and easy-to-deal-with high-dimensional data features.

A Study on Arrhythmia via ECG Signal Classification Using the Convolutional Neural Network

Cardiovascular diseases (CVDs) are the leading cause of death today. The current identification method of the diseases is analyzing the Electrocardiogram (ECG), which is a medical monitoring technology recording cardiac activity. Unfortunately, looking for experts to analyze a large amount of ECG data consumes too many medical resources. Therefore, the method of identifying ECG characteristics based on machine learning has gradually become prevalent. However, there are some drawbacks to these typical methods, requiring manual feature recognition, complex models, and long training time. This paper proposes a robust and efficient 12-layer deep one-dimensional convolutional neural network on classifying the five micro-classes of heartbeat types in the MIT- BIH Arrhythmia database. The five types of heartbeat features are classified, and wavelet self-adaptive threshold denoising method is used in the experiments. Compared with BP neural network, random forest, and other CNN networks, the results show that the model proposed in this paper has better performance in accuracy, sensitivity, robustness, and anti-noise capability. Its accurate classification effectively saves medical resources, which has a positive effect on clinical practice.

A Multi-Scale Residual Attention Network for Retinal Vessel Segmentation

Accurate segmentation of retinal blood vessels is a key step in the diagnosis of fundus diseases, among which cataracts, glaucoma, and diabetic retinopathy (DR) are the main diseases that cause blindness. Most segmentation methods based on deep convolutional neural networks can effectively extract features. However, convolution and pooling operations also filter out some useful information, and the final segmented retinal vessels have problems such as low classification accuracy. In this paper, we propose a multi-scale residual attention network called MRA-UNet. Multi-scale inputs enable the network to learn features at different scales, which increases the robustness of the network. In the encoding phase, we reduce the negative influence of the background and eliminate noise by using the residual attention module. We use the bottom reconstruction module to aggregate the feature information under different receptive fields, so that the model can extract the information of different thicknesses of blood vessels. Finally, the spatial activation module is used to process the up-sampled image to further increase the difference between blood vessels and background, which promotes the recovery of small blood vessels at the edges. Our method was verified on the DRIVE, CHASE, and STARE datasets. Respectively, the segmentation accuracy rates reached 96.98%, 97.58%, and 97.63%; the specificity reached 98.28%, 98.54%, and 98.73%; and the F-measure scores reached 82.93%, 81.27%, and 84.22%. We compared the experimental results with some state-of-art methods, such as U-Net, R2U-Net, and AG-UNet in terms of accuracy, sensitivity, specificity, F-measure, and AUCROC. Particularly, MRA-UNet outperformed U-Net by 1.51%, 3.44%, and 0.49% on DRIVE, CHASE, and STARE datasets, respectively.

Classifying a Lending Portfolio of Loans with Dynamic Updates via a Machine Learning Technique

Bankruptcy prediction has been broadly investigated using financial ratios methodologies. One involved factor is the quality of the portfolio of loans which is given. Hence, having a model to classify/predict position of each loan candidate based on several features is important. In this work, an application of machine learning approach in mathematical finance and banking is discussed. It is shown how we can classify some lending portfolios of banks under several features such as rating categories and various maturities. Dynamic updates of the portfolio are also given along with the top probabilities showing how the financial data of this type can be classified. The discussions and results reveal that a good algorithm for doing such a classification on large economic data of such type is the k-nearest neighbors (KNN) with k=1 along with parallelization even over the support vector machine, random forest, and artificial neural network techniques to save as much as possible on computational time.

One-Dimensional Convolutional Neural Networks with Feature Selection for Highly Concise Rule Extraction from Credit Scoring Datasets with Heterogeneous Attributes

Convolution neural networks (CNNs) have proven effectiveness, but they are not applicable to all datasets, such as those with heterogeneous attributes, which are often used in the finance and banking industries. Such datasets are difficult to classify, and to date, existing high-accuracy classifiers and rule-extraction methods have not been able to achieve sufficiently high classification accuracies or concise classification rules. This study aims to provide a new approach for achieving transparency and conciseness in credit scoring datasets with heterogeneous attributes by using a one-dimensional (1D) fully-connected layer first CNN combined with the Recursive-Rule Extraction (Re-RX) algorithm with a J48graft decision tree (hereafter 1D FCLF-CNN). Based on a comparison between the proposed 1D FCLF-CNN and existing rule extraction methods, our architecture enabled the extraction of the most concise rules (6.2) and achieved the best accuracy (73.10%), i.e., the highest interpretability–priority rule extraction. These results suggest that the 1D FCLF-CNN with Re-RX with J48graft is very effective for extracting highly concise rules for heterogeneous credit scoring datasets. Although it does not completely overcome the accuracy–interpretability dilemma for deep learning, it does appear to resolve this issue for credit scoring datasets with heterogeneous attributes, and thus, could lead to a new era in the financial industry.

Feature rearrangement based deep learning system for predicting heart failure mortality

BACKGROUND AND OBJECTIVE

Heart Failure is a clinical syndrome commonly caused by any structural or functional impairment. Fast and accurate mortality prediction for Heart Failure is essential to improve the health care of patients and prevent them from death. However, due to the imbalance problem and poor feature representation in Heart Failure data, mortality prediction of Heart Failure is difficult with some simple models. To handle these problems, this study is focused on proposing a fast and accurate Heart Failure mortality prediction framework.

METHODS

This paper proposes a feature rearrangement based deep learning system for heart failure mortality prediction. The proposed framework improves the performance of predicting heart failure mortality by handling imbalance problem and achieving better feature representation. This paper also proposes a method named Feature rearrangement based convolutional layer, which demonstrates that the order of the input features is essential for the convolutional network.

RESULTS

The proposed system is experimentally evaluated on real-world Heart Failure data collected from the EHR system of Shanghai Shuguang Hospital, where 10,198 in-patients records are extracted between March 2009 and April 2016. Internal comparison results illustrate that the proposed framework achieves the best performance for Heart Failure mortality prediction. Extensive experimental results compared with other machine learning methods demonstrate that the proposed method has the highest average accuracy and area under the curve while predicting the three goals of in-hospital mortality, 30-day mortality, and 1-year mortality. Finally, top 12 essential clinical features are mined with their chi-square scores, which can help to assist clinicians in the treatment and research of heart failure.

CONCLUSIONS

The proposed method successfully predict different target in three observation windows. Feature rearrangement based convolutional layer and Focal loss are employed into the proposed framework, which helps promote the prediction accuracy of Heart Failure death. The proposed method is fast and accurate for predicting heart failure mortality, especially for imbalance situation. This paper also provide a reasonable pipeline to model EHRs data and handle imbalance problem in medical data.

A New Machine Learning Algorithm Based on Optimization Method for Regression and Classification Problems

A convex minimization problem in the form of the sum of two proper lower-semicontinuous convex functions has received much attention from the community of optimization due to its broad applications to many disciplines, such as machine learning, regression and classification problems, image and signal processing, compressed sensing and optimal control. Many methods have been proposed to solve such problems but most of them take advantage of Lipschitz continuous assumption on the derivative of one function from the sum of them. In this work, we introduce a new accelerated algorithm for solving the mentioned convex minimization problem by using a linesearch technique together with a viscosity inertial forward–backward algorithm (VIFBA). A strong convergence result of the proposed method is obtained under some control conditions. As applications, we apply our proposed method to solve regression and classification problems by using an extreme learning machine model. Moreover, we show that our proposed algorithm has more efficiency and better convergence behavior than some algorithms mentioned in the literature.

Optimizing hyper-parameters of neural networks with swarm intelligence: A novel framework for credit scoring

Neural networks are widely used in automatic credit scoring systems with high accuracy and outstanding efficiency. However, in the absence of prior knowledge, it is difficult to determine the set of hyper-parameters, which makes its application limited in practice. This paper presents a novel framework of credit-scoring model based on neural networks trained by the optimal swarm intelligence (SI) algorithm. This framework incorporates three procedures. Step 1, pre-processing, including imputation, normalization, and re-ordering of the samples. Step 2, training, where SI algorithms optimize hyper-parameters of back-propagation artificial neural networks (BP-ANN) with the area under curve (AUC) as the evaluation function. Step 3, test, applying the optimized model in Step 2 to predict new samples. The results show that the framework proposed in this paper searches the hyper-parameter space efficiently and finds the optimal set of hyper parameters with appropriate time complexity, which enhances the fitting and generalization ability of BP-ANN. Compared with existing credit-scoring models, the model in this paper predicts with a higher accuracy. Additionally, the model enjoys a greater robustness, for the difference of performance between training and testing phases.

Impact of Imbalanced Datasets Preprocessing in the Performance of Associative Classifiers

In this paper, an experimental study was carried out to determine the influence of imbalanced datasets preprocessing in the performance of associative classifiers, in order to find the better computational solutions to the problem of credit scoring. To do this, six undersampling algorithms, six oversampling algorithms and four hybrid algorithms were evaluated in 13 imbalanced datasets referring to credit scoring. Then, the performance of four associative classifiers was analyzed. The experiments carried out allowed us to determine which sampling algorithms had the best results, as well as their impact on the associative classifiers evaluated. Accordingly, we determine that the Hybrid Associative Classifier with Translation, the Extended Gamma Associative Classifier and the Naïve Associative Classifier do not improve their performance by using sampling algorithms for credit data balancing. On the other hand, the Smallest Normalized Difference Associative Memory classifier was beneficiated by using oversampling and hybrid algorithms.

An ensemble learning approach for brain cancer detection exploiting radiomic features

BACKGROUND AND OBJECTIVE

The brain cancer is one of the most aggressive tumour: the 70% of the patients diagnosed with this malignant cancer will not survive. Early detection of brain tumours can be fundamental to increase survival rates. The brain cancers are classified into four different grades (i.e., I, II, III and IV) according to how normal or abnormal the brain cells look. The following work aims to recognize the different brain cancer grades by analysing brain magnetic resonance images.

METHODS

A method to identify the components of an ensemble learner is proposed. The ensemble learner is focused on the discrimination between different brain cancer grades using non invasive radiomic features. The considered radiomic features are belonging to five different groups: First Order, Shape, Gray Level Co-occurrence Matrix, Gray Level Run Length Matrix and Gray Level Size Zone Matrix. We evaluate the features effectiveness through hypothesis testing and through decision boundaries, performance analysis and calibration plots thus we select the best candidate classifiers for the ensemble learner.

RESULTS

We evaluate the proposed method with 111,205 brain magnetic resonances belonging to two freely available data-sets for research purposes. The results are encouraging: we obtain an accuracy of 99% for the benign grade I and the II, III and IV malignant brain cancer detection.

CONCLUSION

The experimental results confirm that the ensemble learner designed with the proposed method outperforms the current state-of-the-art approaches in brain cancer grade detection starting from magnetic resonance images.

Automated Parkinson's disease recognition based on statistical pooling method using acoustic features

Parkinson's disease is one of the mostly seen neurological disease. It affects to nervous system and hinders people's vital activities. The majority of Parkinson's patients lose their ability to speak, write and balance. Many machine learning methods have been proposed to automatically diagnose Parkinson's disease using acoustic, hand writing and gaits. In this study, a statistical pooling method is proposed to recognize Parkinson's disease using the vowels. The used Parkinson's disease dataset contains the features of vowels. In the proposed method, the features of dataset are increased by applying statistical pooling method. Then, the most weighted features are selected from increased feature vector by using ReliefF. The classification is applied using the most weighted feature vector obtained. In the proposed method, Support Vector Machine (SVM) and K Nearest Neighbor (KNN) algorithms are used. The success rate was calculated as 91.25% and 91.23% with by using SVM and KNN respectively. The proposed method has two main contributions. The first is to obtain new features from the Parkinson's acoustic dataset using the statistical pooling method. The second one is the selection of the most significant features from the many feature vectors obtained. Thus, successful results were obtained for both KNN and SVM algorithms. The comparatively results clearly show that the proposed method achieved the best success rate among the selected state-of-art methods. Considering the proposed method and the results obtained, it proposed method is successful for Parkinson's disease recognition.