Combination Of Classification Algorithms Research Articles

Robust attribute selection to improve the Parkinson's disease classification: a hybrid approach

Parkinson’s disease (PD) is known to be a neurodegenerative syndrome that progresses chronically. As a result of the damage or death of brain neurons that generate dopamine patients tend to face difficulty when performing simple everyday tasks like walking, writing, or speaking. The main contribution of this work presents a hybrid method for improving predicting PD. This methodology has been obtained by means of testing a number of different combinations of classification algorithms and approaches for selecting attributes. A total of three attributes selection methods (correlation, information gain, and variance threshold) and three classifiers (decision trees (DT), naive bayes (NB), and support vector machine (SVM)) have been adopted. The speech data set provided by University of California-Irvine (UCI) machine learning (ML) repository is adopted to analyze the performance of different combinations. The combination of information gain and DT classifier achieved the best performance rather than other combination methods, reaching a classification accuracy of (97.43%). Finally, an additional comparison of the performance analysis with the results of previous studies was made and it was found that the proposed methodology proved to outperform the results of other studies conducted in this field.

A Framework for Sentiment Analysis Classification based on Comparative Study

A number of Feature Selection and Ensemble Methods for Sentiment Analysis Classification had been introduced in many searches. This paper presents A frame work for sentiment analysis classification based on comparative study on different classification algorithms i.e., comparison between combinations of classification algorithms: Bayes, SVM, Decision Tree. We also examined the effect of using feature selection methods (statistical, wrapper, or embedded), ensemble methods (Bagging, Boosting, Stacking, or Vote), tuning parameters of methods (SVMAttributeEval, Stacking), and the effect of merging feature subsets selected by embedded method on the classification accuracy. Particularly, the results showed that accuracy depends on the feature selection method, ensemble methods, number of selected features, type of classifier, and tuning parameters of the algorithms used. A high accuracy of up to 99.85% was achieved by merging features of two embedded methods when using stacking ensemble method. Also, a high accuracy of 99.5% was achieved by tuning parameters in stacking method, and it reached 99.95% and 100% by tuning parameters in SVMAttributeEval method using statistical and machine learning approaches, respectively. Furthermore, tuning algorithms' parameters reduced the time needed to select feature subsets. Thus, these combinations of algorithms can be followed as a frame work for sentiment analyses.

A Comparative Performance Assessment of Optimized Multilevel Ensemble Learning Model with Existing Classifier Models.

To predict the class level of any classification problem, predictive models are used and mostly a single predictive model is built to predict the class level of any classification problem; current research considers multiple predictive models to predict the class level. Ensemble modeling means instead of building a single predictive model, it is proposed to build a multilevel predictive model, which generalizes to predict all the class levels with an adequate percent of accuracy, that is, from 70% to 90% by applying and using a different combination of classification algorithms. In this article, a multilevel approach for selecting base classifiers for building an ensemble classification model is proposed. The rudimentary concept behind this approach is to drop lousy performing features and collinearity from the selected data set for ensemble modeling. For the evaluation of the proposed multilevel predictive model, different data sets from the University of California, Irvine, repository have been used and comparisons with the modern classifier's models have been conducted. The implementation analyses demonstrate the potency and excellence of the novel approach when compared with other modern classification models (three-layered artificial neural network, Radial Variant Function Neural Network/Fish Swarm Algorithm). The classification accuracy achieved with selected algorithms lies in the range of 70%-88.3%. Among all the selected classification algorithms, the lowest accuracy is achieved by the naive Bayes algorithm, which is close to 71.9%. However, the proposed algorithm (NB-RF-LR-SEMod), which is a combination of different classifiers, achieved a maximum accuracy of 88.3% on the Photographic and Imaging Manufacturers Association Diabetes data set, which is, by far, the best to any single classifier. Hence, this proposed work is helpful for any health care official to detect the diabetes problem at an early stage and prevent the affected person from future complications of it.

ANALISIS CREDIT SCORING TERHADAP STATUS PEMBAYARAN BARANG ELEKTRONIK DAN FURNITURE MENGGUNAKAN BOOTSTRAP AGGREGATING K-NEAREST NEIGHBOR

Classification is the process of grouping objects that have the same characteristics into several categories. This study applies a combination of classification algorithms, namely Bootstrap Aggregating K-Nearest Neighbor in credit scoring analysis. The aim is to classify the credit payment status of electronic goods and furniture at PT KB Finansia Multi Finance in 2020 and determine the level of accuracy produced. Credit payment status is grouped into 2 categories, namely smoothly and not smoothly. There are 7 independent variables that are used to describe the characteristics of the debtor, namely age, number of dependents, length of stay, years of service, income, amount of payment, and payment period. The application of the classification algorithm at the credit scoring analysis is expected to assist creditors in making decisions to accept or reject credit applications from prospective debtors. The results showed that the accuracy obtained from the Bootstrap Aggregating K-Nearest Neighbor algorithm with a proportion of 90:10, m=80%, C=73, and K=5 was the best, which was 92.308%.

Machine Learning Prediction of Response to Cardiac Resynchronization Therapy

Cardiac resynchronization therapy (CRT) has significant nonresponse rates. We assessed whether machine learning (ML) could predict CRT response beyond current guidelines. We analyzed CRT patients from Cleveland Clinic and Johns Hopkins. A training cohort was created from all Johns Hopkins patients and an equal number of randomly sampled Cleveland Clinic patients. All remaining patients comprised the testing cohort. Response was defined as ≥10% increase in left ventricular ejection fraction. ML models were developed to predict CRT response using different combinations of classification algorithms and clinical variable sets on the training cohort. The model with the highest area under the curve was evaluated on the testing cohort. Probability of response was used to predict survival free from a composite end point of death, heart transplant, or placement of left ventricular assist device. Predictions were compared with current guidelines. Nine hundred twenty-five patients were included. On the training cohort (n=470: 235, Johns Hopkins; 235, Cleveland Clinic), the best ML model was a naive Bayes classifier including 9 variables (QRS morphology, QRS duration, New York Heart Association classification, left ventricular ejection fraction and end-diastolic diameter, sex, ischemic cardiomyopathy, atrial fibrillation, and epicardial left ventricular lead). On the testing cohort (n=455, Cleveland Clinic), ML demonstrated better response prediction than guidelines (area under the curve, 0.70 versus 0.65; P=0.012) and greater discrimination of event-free survival (concordance index, 0.61 versus 0.56; P<0.001). The fourth quartile of the ML model had the greatest risk of reaching the composite end point, whereas the first quartile had the least (hazard ratio, 0.34; P<0.001). ML with 9 variables incrementally improved prediction of echocardiographic CRT response and survival beyond guidelines. Performance was not improved by incorporating more variables. The model offers potential for improved shared decision-making in CRT (online calculator: http://riskcalc.org:3838/CRTResponseScore ). Significant remaining limitations confirm the need to identify better variables to predict CRT response.

Feature selection for gene prediction in metagenomic fragments

BackgroundComputational approaches, specifically machine-learning techniques, play an important role in many metagenomic analysis algorithms, such as gene prediction. Due to the large feature space, current de novo gene prediction algorithms use different combinations of classification algorithms to distinguish between coding and non-coding sequences.ResultsIn this study, we apply a filter method to select relevant features from a large set of known features instead of combining them using linear classifiers or ignoring their individual coding potential. We use minimum redundancy maximum relevance (mRMR) to select the most relevant features. Support vector machines (SVM) are trained using these features, and the classification score is transformed into the posterior probability of the coding class. A greedy algorithm uses the probability of overlapped candidate genes to select the final genes. Instead of using one model for all sequences, we train an ensemble of SVM models on mutually exclusive datasets based on GC content and use the appropriated model to classify candidate genes based on their read’s GC content.ConclusionOur proposed algorithm achieves an improvement over some existing algorithms. mRMR produces promising results in gene prediction. It improves classification performance and feature interpretation. Our research serves as a basis for future studies on feature selection for gene prediction.

Characterization of Fine Metal Particles Derived from Shredded WEEE Using a Hyperspectral Image System: Preliminary Results.

Waste of electric and electronic equipment (WEEE) is the fastest-growing waste stream in Europe. The large amount of electric and electronic products introduced every year in the market makes WEEE disposal a relevant problem. On the other hand, the high abundance of key metals included in WEEE has increased the industrial interest in WEEE recycling. However, the high variability of materials used to produce electric and electronic equipment makes key metals’ recovery a complex task: the separation process requires flexible systems, which are not currently implemented in recycling plants. In this context, hyperspectral sensors and imaging systems represent a suitable technology to improve WEEE recycling rates and the quality of the output products. This work introduces the preliminary tests using a hyperspectral system, integrated in an automatic WEEE recycling pilot plant, for the characterization of mixtures of fine particles derived from WEEE shredding. Several combinations of classification algorithms and techniques for signal enhancement of reflectance spectra were implemented and compared. The methodology introduced in this study has shown characterization accuracies greater than 95%.

Hierarchical classification in text mining for sentiment analysis of online news

Sentiment analysis in text mining is a challenging task. Sentiment is subtly reflected by the tone and affective content of a writer's words. Conventional text mining techniques, which are based on keyword frequencies, usually run short of accurately detecting such subjective information implied in the text. In this paper, we evaluate several popular classification algorithms, along with three filtering schemes. The filtering schemes progressively shrink the original dataset with respect to the contextual polarity and frequent terms of a document. We call this approach "hierarchical classification". The effects of the approach in different combination of classification algorithms and filtering schemes are discussed over three sets of controversial online news articles where binary and multi-class classifications are applied. Meanwhile we use two methods to test this hierarchical classification model, and also have a comparison of the two methods.

An enhanced Customer Relationship Management classification framework with Partial Focus Feature Reduction

Effective data mining solutions have for long been anticipated in Customer Relationship Management (CRM) to accurately predict customer behavior, but from various industry research and case studies we have observed sub-optimal CRM classification models due to inferior data quality inherent to CRM data set. In this paper, one type of CRM data with a distinctive distribution pattern of Reduced Dimensionality is discussed. A new classification framework termed Partial Focus Feature Reduction is proposed to resolve CRM data set with Reduced Dimensionality using a collection of efficient data mining techniques characterizing a specially tailored modality grouping method to significantly improve data quality and feature relevancy after preprocessing, eventually achieving excellent classification performance with the right combination of classification algorithms.