Support Vector Machine Incremental Learning Research Articles

Intelligent Diagnosis Method for New Diseases Based on Fuzzy SVM Incremental Learning.

The diagnosis of new diseases is a challenging problem. In the early stage of the emergence of new diseases, there are few case samples; this may lead to the low accuracy of intelligent diagnosis. Because of the advantages of support vector machine (SVM) in dealing with small sample problems, it is selected for the intelligent diagnosis method. The standard SVM diagnosis model updating needs to retrain all samples. It costs huge storage and calculation costs and is difficult to adapt to the changing reality. In order to solve this problem, this paper proposes a new disease diagnosis method based on Fuzzy SVM incremental learning. According to SVM theory, the support vector set and boundary sample set related to the SVM diagnosis model are extracted. Only these sample sets are considered in incremental learning to ensure the accuracy and reduce the cost of calculation and storage. To reduce the impact of noise points caused by the reduction of training samples, FSVM is used to update the diagnosis model, and the generalization is improved. The simulation results on the banana dataset show that the proposed method can improve the classification accuracy from 86.4% to 90.4%. Finally, the method is applied in COVID-19's diagnostic. The diagnostic accuracy reaches 98.2% as the traditional SVM only gets 84%. With the increase of the number of case samples, the model is updated. When the training samples increase to 400, the number of samples participating in training is only 77; the amount of calculation of the updated model is small.

Nonconvulsive epileptic seizure monitoring with incremental learning

Nonconvulsive epileptic seizures (NCSz) and nonconvulsive status epilepticus (NCSE) are two neurological entities associated with increment in morbidity and mortality in critically ill patients. In a previous work, we introduced a method which accurately detected NCSz in EEG data (referred here as ‘Batch method’). However, this approach was less effective when the EEG features identified at the beginning of the recording changed over time. Such pattern drift is an issue that causes failures of automated seizure detection methods. This paper presents a support vector machine (SVM)-based incremental learning method for NCSz detection that for the first time addresses the seizure evolution in EEG records from patients with epileptic disorders and from ICU having NCSz. To implement the incremental learning SVM, three methodologies are tested. These approaches differ in the way they reduce the set of potentially available support vectors that are used to build the decision function of the classifier. To evaluate the suitability of the three incremental learning approaches proposed here for NCSz detection, first, a comparative study between the three methods is performed. Secondly, the incremental learning approach with the best performance is compared with the Batch method and three other batch methods from the literature. From this comparison, the incremental learning method based on maximum relevance minimum redundancy (MRMR_IL) obtained the best results. MRMR_IL method proved to be an effective tool for NCSz detection in a real-time setting, achieving sensitivity and accuracy values above 99%.

Research on Incremental Learning of SVM Based on Robustness

The following problems exist in the process of incremental learning of support vector machines. If the number of support vectors will increase with the increase of the increment sample, the time of training will become longer and longer; if the vector that has no effect on the hyperplane of the classification is abandoned, this part of the vector may become a support vector in the subsequent training. This will have an impact on the effect of the classification. In this paper, a support vector machine incremental learning algorithm based on fuzzy C mean clustering and central density is used to determine support vector set by fuzzy C mean clustering, and the selected non support vector sets are obtained by using the ratio of center density to determine non support vectors. The effect of non support vector on the robustness of support vector incremental learning is studied by comparing the classification efficiency of the four kinds of classification, and the conclusion of this paper is finally obtained.

Support vector machine incremental learning triggered by wrongly predicted samples

According to the classic Karush-Kuhn-Tucker (KKT) theorem, at every step of incremental support vector machine (SVM) learning, the newly adding sample which violates the KKT conditions will be a new support vector (SV) and migrate the old samples between SV set and non-support vector (NSV) set, and at the same time the learning model should be updated based on the SVs. However, it is not exactly clear at this moment that which of the old samples would change between SVs and NSVs. Additionally, the learning model will be unnecessarily updated, which will not greatly increase its accuracy but decrease the training speed. Therefore, how to choose the new SVs from old sets during the incremental stages and when to process incremental steps will greatly influence the accuracy and efficiency of incremental SVM learning. In this work, a new algorithm is proposed to select candidate SVs and use the wrongly predicted sample to trigger the incremental processing simultaneously. Experimental results show that the proposed algorithm can achieve good performance with high efficiency, high speed and good accuracy.

Incremental Support Vector Machine Combined with Ultraviolet-Visible Spectroscopy for Rapid Discriminant Analysis of Red Wine

The aim of this work is to develop a new method to overcome the increased training time when a recognition model is updated based on the condition of new features extracted from new samples. As a common complex system, red wine has a rich chemical composition and is used as an object of this research. The novel method based on incremental learning support vector machine (I-SVM) combined with ultraviolet–visible (UV-Vis) spectroscopy was applied to discriminant analysis of the brands of red wine for the first time. In this method, new features included in the new training samples were introduced into the recognition model through iterative learning in each iteration, and the recognition model was rapidly updated without significantly increasing the training time. Experimental results show that the recognition model established by this method obtains a good balance between training efficiency and recognition accuracy.

Optimal Boundary SVM Incremental Learning Algorithm

Support vectors (SVs) cant be selected completely in support vector machine (SVM) incremental, resulting incremental learning process cant be sustained. In order to solve this problem, the article proposes optimal boundary SVM incremental learning algorithm. Based on in-depth analysis of the trend of the classification surface and make use of the KKT conditions, selecting the border of the vectors include the support vectors to participate SVM incremental learning. The experiment shows that the algorithm can be completely covered the support vectors and have the identical result with the classic support vector machine, it also saves lots of time. Therefore it can provide the conditions for future large sample classification and incremental learning sustainability.

An online incremental learning support vector machine for large-scale data

Support Vector Machines (SVMs) have gained outstanding generalization in many fields. However, standard SVM and most of modified SVMs are in essence batch learning, which make them unable to handle incremental learning or online learning well. Also, such SVMs are not able to handle large-scale data effectively because they are costly in terms of memory and computing consumption. In some situations, plenty of Support Vectors (SVs) are produced, which generally means a long testing time. In this paper, we propose an online incremental learning SVM for large data sets. The proposed method mainly consists of two components: the learning prototypes (LPs) and the learning Support Vectors (LSVs). LPs learn the prototypes and continuously adjust prototypes to the data concept. LSVs are to get a new SVM by combining learned prototypes with trained SVs. The proposed method has been compared with other popular SVM algorithms and experimental results demonstrate that the proposed algorithm is effective for incremental learning problems and large-scale problems.

Incremental support vector machine algorithm based on multi-kernel learning

Abstract: A new incremental support vector machine (SVM) al-gorithm is proposed which is based on multiple kernel learning.Through introducing multiple kernel learning into the SVM incre-mental learning, large scale data set learning problem can besolved effectively. Furthermore, different punishments are adoptedin allusion to the training subset and the acquired support vectors,which may help to improve the performance of SVM. Simulationresults indicate that the proposed algorithm can not only solve themodel selection problem in SVM incremental learning, but alsoimprove the classification or prediction precision. Keywords: support vector machine (SVM), incremental learning,multiple kernel learning (MKL). DOI: 10.3969/j.issn.1004-4132.2011.04.021 1. Introduction Supportvectormachines(SVMs),proposedbyVapnik[1],areabletotranslatethenonlinearproblemintolinearprob-lemandobtaintheglobaloptimalsolutionbyfollowingthestructure risk minimization and integrating manifold tech-niquessuchasmaximalmarginhyper-plane,Mercerkerneland slack variables. In recent years, SVMs are extensivelyapplied to pattern recognition, system modeling, time se-ries predictionand otherfields [2,3].Unfortunately, SVMs do not scale well with respectto the size of training data. Given

Incremental training for SVM-based classification with keyword adjusting

This paper analyzed the theory of incremental learning of SVM (support vector machine) and pointed out it is a shortage that the support vector optimization is only considered in present research of SVM incremental learning. According to the significance of keyword in training, a new incremental training method considering keyword adjusting was proposed, which eliminates the difference between incremental learning and batch learning through the keyword adjusting. The experimental results show that the improved method outperforms the method without the keyword adjusting and achieve the same precision as the batch method.