Incremental learning algorithm based on support vector machine with Mahalanobis distance (ISVMM) for intrusion prevention

In this paper we propose a new classifier called an incremental learning algorithm based on support vector machine with Mahalanobis distance (ISVMM). Prediction of the incoming data type by supervised learning of support vector machine (SVM), reducing the step of calculation and complexity of the algorithm by finding a support set, error set and remaining set, providing of hard and soft decisions, saving the time for repeatedly training the datasets by applying the incremental learning, a new approach for building an ellipsoidal kernel for multidimensional data instead of a sphere kernel by using Mahalanobis distance, and the concept of handling the covariance matrix from dividing by zero are various features of this new algorithm. To evaluate the classification performance of the algorithm, it was applied on intrusion prevention by employing the data from the third international knowledge discovery and data mining tools competition (KDDcup'99). According to the experimental results, ISVMM can predict well on all of the 41 features of incoming datasets without even reducing the enlarged dimensions and it can compete with the similar algorithm which uses a Euclidean measurement at the kernel distance

Adaptive SVM for Data Stream Classification

In this paper, we address the problem of learning an adaptive classifier for the classification of continuous streams of data. We present a solution based on incremental extensions of the Support Vector Machine (SVM) learning paradigm that updates an existing SVM whenever new training data are acquired. To ensure that the SVM effectiveness is guaranteed while exploiting the newly gathered data, we introduce an on-line model selection approach in the incremental learning process. We evaluated the proposed method on real world applications including on-line spam email filtering and human action classification from videos. Experimental results show the effectiveness and the potential of the proposed approach

Algorithm for early diagnosis of hepatocellular carcinoma based on gene pair similarity

The article proposes an algorithm based on intelligent methods for the early diagnosis of hepatocellular carcinoma (HCC), known as liver cancer, which is rated third cause of cancer deaths in the world. Initial diagnosis of HСC is based on laboratory studies, computer tomography and X-ray examination. However, in some cases, identifying cancerous tissues as similar non-cancerous tissues (cirrhotic tissues and normal tissues) made it necessary to perform gene analysis for the diagnosis. To predict HCC based on such numerous, diverse and heterogeneous unstructured data, preference is given to the method of artificial intelligence, i.e., machine learning. It shows the possibility of applying machine learning methods to solve the problem of accurate identification of HCC due to the compatibility of HCC tissues with identical CwoHCC non-cancerous tissues. The technology of gene pair profiling using relevant peer databases is described and the Within-Sample Relative Expression Orderings (REO) technique is used to determine the gene pair’s similarity. The article also presents a new approach based on The Within-Sample Relative Expression Orderings technique for determining the gene pair’s similarity, Incremental feature selection method for feature selection, and Support Vector Machine methods for gene pair classification. The proposed approach constitutes the methodological basis of a decision support system for the early diagnosis of HCC, and the development of such a system may be beneficial for physician decision support in the relevant fiel

Solving Dynamic Multi-objective Optimization Problems Using Incremental Support Vector Machine

The main feature of the Dynamic Multi-objective Optimization Problems (DMOPs) is that optimization objective functions will change with times or environments. One of the promising approaches for solving the DMOPs is reusing the obtained Pareto optimal set (POS) to train prediction models via machine learning approaches. In this paper, we train an Incremental Support Vector Machine (ISVM) classifier with the past POS, and then the solutions of the DMOP we want to solve at the next moment are filtered through the trained ISVM classifier. A high-quality initial population will be generated by the ISVM classifier, and a variety of different types of population-based dynamic multi-objective optimization algorithms can benefit from the population. To verify this idea, we incorporate the proposed approach into three evolutionary algorithms, the multi-objective particle swarm optimization(MOPSO), Nondominated Sorting Genetic Algorithm II (NSGA-II), and the Regularity Model-based multi-objective estimation of distribution algorithm(RE-MEDA). We employ experiments to test these algorithms, and experimental results show the effectiveness.Comment: 6 page