The Construction of Support Vector Machine Classifier Using the Firefly Algorithm

The setting of parameters in the support vector machines (SVMs) is very important with regard to its accuracy and efficiency. In this paper, we employ the firefly algorithm to train all parameters of the SVM simultaneously, including the penalty parameter, smoothness parameter, and Lagrangian multiplier. The proposed method is called the firefly-based SVM (firefly-SVM). This tool is not considered the feature selection, because the SVM, together with feature selection, is not suitable for the application in a multiclass classification, especially for the one-against-all multiclass SVM. In experiments, binary and multiclass classifications are explored. In the experiments on binary classification, ten of the benchmark data sets of the University of California, Irvine (UCI), machine learning repository are used; additionally the firefly-SVM is applied to the multiclass diagnosis of ultrasonic supraspinatus images. The classification performance of firefly-SVM is also compared to the original LIBSVM method associated with the grid search method and the particle swarm optimization based SVM (PSO-SVM). The experimental results advocate the use of firefly-SVM to classify pattern classifications for maximum accuracy

Hybrid Feature Selection Approach Based on GRASP for Cancer Microarray Data

Microarray data usually contain a large number of genes, but a small number of samples. Feature subset selection for microarray data aims at reducing the number of genes so that useful information can be extracted from the samples. Reducing the dimension of data sets further helps in improving the computational efficiency of the learning model. In this paper, we propose a modified algorithm based on the tabu search as local search procedures to a Greedy Randomized Adaptive Search Procedure (GRASP) for high dimensional microarray data sets. The proposed Tabu based Greedy Randomized Adaptive Search Procedure algorithm is named as TGRASP. In TGRASP, a new parameter has been introduced named as Tabu Tenure and the existing parameters, NumIter and size have been modified. We observed that different parameter settings affect the quality of the optimum. The second proposed algorithm known as FFGRASP (Firefly Greedy Randomized Adaptive Search Procedure) uses a firefly optimization algorithm in the local search optimzation phase of the greedy randomized adaptive search procedure (GRASP). Firefly algorithm is one of the powerful algorithms for optimization of multimodal applications. Experimental results show that the proposed TGRASP and FFGRASP algorithms are much better than existing algorithm with respect to three performance parameters viz. accuracy, run time, number of a selected subset of features. We have also compared both the approaches with a unified metric (Extended Adjusted Ratio of Ratios) which has shown that TGRASP approach outperforms existing approach for six out of nine cancer microarray datasets and FFGRASP performs better on seven out of nine datasets

A Multi-Population FA for Automatic Facial Emotion Recognition

Automatic facial emotion recognition system is popular in various domains such as health care, surveillance and human-robot interaction. In this paper we present a novel multi-population FA for automatic facial emotion recognition. The overall system is equipped with horizontal vertical neighborhood local binary patterns (hvnLBP) for feature extraction, a novel multi-population FA for feature selection and diverse classifiers for emotion recognition. First, we extract features using hvnLBP, which are robust to illumination changes, scaling and rotation variations. Then, a novel FA variant is proposed to further select most important and emotion specific features. These selected features are used as input to the classifier to further classify seven basic emotions. The proposed system is evaluated with multiple facial expression datasets and also compared with other state-of-the-art models

A new model for large dataset dimensionality reduction based on teaching learning-based optimization and logistic regression

One of the human diseases with a high rate of mortality each year is breast cancer (BC). Among all the forms of cancer, BC is the commonest cause of death among women globally. Some of the effective ways of data classification are data mining and classification methods. These methods are particularly efficient in the medical field due to the presence of irrelevant and redundant attributes in medical datasets. Such redundant attributes are not needed to obtain an accurate estimation of disease diagnosis. Teaching learning-based optimization (TLBO) is a new metaheuristic that has been successfully applied to several intractable optimization problems in recent years. This paper presents the use of a multi-objective TLBO algorithm for the selection of feature subsets in automatic BC diagnosis. For the classification task in this work, the logistic regression (LR) method was deployed. From the results, the projected method produced better BC dataset classification accuracy (classified into malignant and benign). This result showed that the projected TLBO is an efficient features optimization technique for sustaining data-based decision-making systems

A Machine Learning Technique for Detection of Social Media Fake News

publishedVersio

Improving KNN by Gases Brownian Motion Optimization Algorithm to Breast Cancer Detection

In the last decade, the application of information technology and artificial intelligence algorithms are widely developed in collecting information of cancer patients and detecting them based on proposing various detection algorithms. The K-Nearest-Neighbor classification algorithm (KNN) is one of the most popular of detection algorithms, which has two challenges in determining the value of k and the volume of computations proportional to the size of the data and sample selected for training. In this paper, the Gaussian Brownian Motion Optimization (GBMO) algorithm is utilized for improving the KNN performance to breast cancer detection. To achieve to this aim, each gas molecule contains the information such as a selected subset of features to apply the KNN and k value. The GBMO has lower time-complexity order than other algorithms and has also been observed to perform better than other optimization algorithms in other applications. The algorithm and three well-known meta-heuristic algorithms such as Genetic Algorithm (GA), Particle Swarm Optimization (PSO) and Imperialist Competitive Algorithm (ICA) have been implemented on five benchmark functions and compared the obtained results. The GBMO+KNN performed on three benchmark datasets of breast cancer from UCI and the obtained results are compared with other existing cancer detection algorithms. These comparisons show significantly improves this classification accuracy with the proposed detection algorithm

A Proposed Technique for Finding Pattern from Web Usage Data

There are various ways of web page classification but they take higher time to compute with lesser accuracy. Hence, there is a need to invent an efficient algorithm in order to reduce time and increase web page classification result. Artificial Immune System (AIS) which has the characteristic of high self-adaptation and self-construction inspired from the function of biological immune system. An ensemble approach of AIS and tree based classifier has used the hybrid approach. This inspired the scholars to use such hybrid approach for Structure based web page classification