A Genetic-Neural System Diagnosing Hepatitis B

Hepatitis B is a life threaten disease and if not diagnose early can lead to death of the infected patient. In this paper a genetic neural system for diagnosing hepatitis B was designed. The system was designed to diagnose HBV using clinical symptoms. The dataset used in training the system was gotten from UCI repository. The system incorporated both genetic algorithm and neural network. The genetic algorithm was used to optimize the dataset used in training the neural network. The neural network was trained for 300 iterations and the system had a prediction accuracy of 99.14% on predicting Hepatitis B

Hybrid ACO and SVM algorithm for pattern classification

Ant Colony Optimization (ACO) is a metaheuristic algorithm that can be used to solve a variety of combinatorial optimization problems. A new direction for ACO is to optimize continuous and mixed (discrete and continuous) variables. Support Vector Machine (SVM) is a pattern classification approach originated from statistical approaches. However, SVM suffers two main problems which include feature subset selection and parameter tuning. Most approaches related to tuning SVM parameters discretize the continuous value of the parameters which will give a negative effect on the classification performance. This study presents four algorithms for tuning the SVM parameters and selecting feature subset which improved SVM classification accuracy with smaller size of feature subset. This is achieved by performing the SVM parameters’ tuning and feature subset selection processes simultaneously. Hybridization algorithms between ACO and SVM techniques were proposed. The first two algorithms, ACOR-SVM and IACOR-SVM, tune the SVM parameters while the second two algorithms, ACOMV-R-SVM and IACOMV-R-SVM, tune the SVM parameters and select the feature subset simultaneously. Ten benchmark datasets from University of California, Irvine, were used in the experiments to validate the performance of the proposed algorithms. Experimental results obtained from the proposed algorithms are better when compared with other approaches in terms of classification accuracy and size of the feature subset. The average classification accuracies for the ACOR-SVM, IACOR-SVM, ACOMV-R and IACOMV-R algorithms are 94.73%, 95.86%, 97.37% and 98.1% respectively. The average size of feature subset is eight for the ACOR-SVM and IACOR-SVM algorithms and four for the ACOMV-R and IACOMV-R algorithms. This study contributes to a new direction for ACO that can deal with continuous and mixed-variable ACO

Diagnosing Hepatitis Using Hybrid Fuzzy-CBR

The Malaysia populations are currently estimated to be 28.9 million with a number of medical specialists is 2,500 and 20,280 doctors. This ratio figures to cause patients need to wait longer in government hospitals and clinics before they can meet doctor or medical specialist. In order to resolve this problem, Ministry of Health has pledged to reduce waiting time of patient examination from 45 minutes to 30 minutes by provide allocation of large budget to the medical sector. This budget will be used either to buy new equipment, which can work with large capacity or upgrade the old equipment to work faster or build the new hospital to tend more patients or hire other doctors from overseas. Due to that reason and the coming which World Hepatitis Day on 28 July 2012, this study proposes a the use of hybrid intelligent, which combine Fuzzy Logic and Case-Based Reasoning (CBR) approach that could be integrated in the diagnosis system to classify patient condition by using fuzzy technique and similarity measurement based on current symptoms of a hepatitis patient. Focus of this study is to develop an automated decision support system that can be used by the doctors to accelerate diagnosis processing. As a result, a prototype called Intelligent Medical Decision Support System (IMDSS) using Fuzzy-CBR engine for diagnosis purposes has been developed, validated and evaluated in this study. The finding through validation and evaluation phase indicates that IMDSS is reliable in assisting doctors during the diagnosis process. In fact, the diagnosis of a patient has become easier than the manual process and easy to use

A predictive method for hepatitis disease diagnosis using ensembles of neuro-fuzzy technique

Background: Hepatitis is an inflammation of the liver, most commonly caused by a viral infection. Supervised data mining techniques have been successful in hepatitis disease diagnosis through a set of datasets. Many methods have been developed by the aids of data mining techniques for hepatitis disease diagnosis. The majority of these methods are developed by single learning techniques. In addition, these methods do not support the ensemble learning of the data. Combining the outputs of several predictors can result in improved accuracy in classification problems. This study aims to propose an accurate method for the hepatitis disease diagnosis by taking the advantages of ensemble learning. Methods: We use Non-linear Iterative Partial Least Squares to perform the data dimensionality reduction, Self-Organizing Map technique for clustering task and ensembles of Neuro-Fuzzy Inference System for predicting the hepatitis disease. We also use decision trees for the selection of most important features in the experimental dataset. We test our method on a real-world dataset and present our results in comparison with the latest results of previous studies. Results: The results of our analyses on the dataset demonstrated that our method performance is superior to the Neural Network, ANFIS, K-Nearest Neighbors and Support Vector Machine. Conclusions: The method has potential to be used as an intelligent learning system for hepatitis disease diagnosis in the healthcare. © 2018 The Author

Simulated annealing least squares twin support vector machine (SA-LSTSVM) for pattern classification

Least squares twin support vector machine (LSTSVM) is a relatively new version of support vector machine (SVM) based on non-parallel twin hyperplanes. Although, LSTSVM is an extremely efficient and fast algorithm for binary classification, its parameters depend on the nature of the problem. Problem dependent parameters make the process of tuning the algorithm with best values for parameters very difficult, which affects the accuracy of the algorithm. Simulated annealing (SA) is a random search technique proposed to find the global minimum of a cost function. It works by emulating the process where a metal slowly cooled so that its structure finally “freezes”. This freezing point happens at a minimum energy configuration. The goal of this paper is to improve the accuracy of the LSTSVMalgorithmby hybridizing it with simulated anneaing. Our research to date suggests that this improvement on the LSTSVM is made for the first time in this paper. Experimental results on several benchmark datasets demonstrate that the accuracy of the proposed algorithm is very promising when compared to other classification methods in the literature. In addition, computational time analysis of the algorithm showed the practicality of the proposed algorithm where the computational time of the algorithm falls between LSTSVM and SVM

Solving SVM model selection problem using ACOR and IACOR

Ant Colony Optimization (ACO) has been used to solve Support Vector Machine (SVM) model selection problem.ACO originally deals with discrete optimization problem. In applying ACO for optimizing SVM parameters which are continuous variables, there is a need to discretize the continuously value into discrete values.This discretize process would result in loss of some information and hence affect the classification accuracy.In order to enhance SVM performance and solving the discretization problem, this study proposes two algorithms to optimize SVM parameters using Continuous ACO (ACOR) and Incremental Continuous Ant Colony Optimization (IACOR) without the need to discretize continuous value for SVM parameters.Eight datasets from UCI were used to evaluate the credibility of the proposed integrated algorithm in terms of classification accuracy and size of features subset.Promising results were obtained when compared to grid search technique, GA with feature chromosome-SVM, PSO-SVM, and GA-SVM. Results have also shown that IACOR-SVM is better than ACOR-SVM in terms of classification accuracy

Analysis of Dimensionality Reduction Techniques on Big Data

Due to digitization, a huge volume of data is being generated across several sectors such as healthcare, production, sales, IoT devices, Web, organizations. Machine learning algorithms are used to uncover patterns among the attributes of this data. Hence, they can be used to make predictions that can be used by medical practitioners and people at managerial level to make executive decisions. Not all the attributes in the datasets generated are important for training the machine learning algorithms. Some attributes might be irrelevant and some might not affect the outcome of the prediction. Ignoring or removing these irrelevant or less important attributes reduces the burden on machine learning algorithms. In this work two of the prominent dimensionality reduction techniques, Linear Discriminant Analysis (LDA) and Principal Component Analysis (PCA) are investigated on four popular Machine Learning (ML) algorithms, Decision Tree Induction, Support Vector Machine (SVM), Naive Bayes Classifier and Random Forest Classifier using publicly available Cardiotocography (CTG) dataset from University of California and Irvine Machine Learning Repository. The experimentation results prove that PCA outperforms LDA in all the measures. Also, the performance of the classifiers, Decision Tree, Random Forest examined is not affected much by using PCA and LDA.To further analyze the performance of PCA and LDA the eperimentation is carried out on Diabetic Retinopathy (DR) and Intrusion Detection System (IDS) datasets. Experimentation results prove that ML algorithms with PCA produce better results when dimensionality of the datasets is high. When dimensionality of datasets is low it is observed that the ML algorithms without dimensionality reduction yields better results

Knowledge Mining from Clinical Datasets Using Rough Sets and Backpropagation Neural Network

The availability of clinical datasets and knowledge mining methodologies encourages the researchers to pursue research in extracting knowledge from clinical datasets. Different data mining techniques have been used for mining rules, and mathematical models have been developed to assist the clinician in decision making. The objective of this research is to build a classifier that will predict the presence or absence of a disease by learning from the minimal set of attributes that has been extracted from the clinical dataset. In this work rough set indiscernibility relation method with backpropagation neural network (RS-BPNN) is used. This work has two stages. The first stage is handling of missing values to obtain a smooth data set and selection of appropriate attributes from the clinical dataset by indiscernibility relation method. The second stage is classification using backpropagation neural network on the selected reducts of the dataset. The classifier has been tested with hepatitis, Wisconsin breast cancer, and Statlog heart disease datasets obtained from the University of California at Irvine (UCI) machine learning repository. The accuracy obtained from the proposed method is 97.3%, 98.6%, and 90.4% for hepatitis, breast cancer, and heart disease, respectively. The proposed system provides an effective classification model for clinical datasets