Training algorithms for fuzzy support vector machines with noisy data
Pattern Recognition LettersPublished 7 July 2004
Chun-Fu Lin, Sheng-de Wang
Citations269
SJR quartileQ1
SJR score1.00
SNIP1.43
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
The previous study of fuzzy support vector machines (FSVMs) provides a method to classify data with noises or outliers by manually associating each data point with a fuzzy membership that can reflect their relative degrees as meaningful data. In this paper, we introduce two factors in training data points, the confident factor and the trashy factor, and automatically generate fuzzy memberships of training data points from a heuristic strategy by using these two factors and a mapping function. We investigate and compare two strategies in the experiments and the results show that the generalization error of FSVMs is comparable to other methods on benchmark datasets. The proposed approach for automatic setting of fuzzy memberships makes the FSVMs more applicable in reducing the effects of noises or outliers.
Keywords
Computer ScienceEngineering
Machine LearningSupport-vector networks
40,463 Citations1995Corinna Cortes, Vladimir Vapnik
High generalization ability of support-vector networks utilizing polynomial input transformations is demonstrated and the performance of the support- vector network is compared to various classical learning algorithms that all took part in a benchmark study of Optical Character Recognition.
The Nature of Statistical Learning Theory
39,279 Citations1995Vladimir Vapnik
Machine LearningSupport-Vector Networks
33,035 Citations1995Corinna Cortes, Vladimir Vapnik
High generalization ability of support-vector networks utilizing polynomial input transformations is demonstrated and the performance of the support- vector network is compared to various classical learning algorithms that all took part in a benchmark study of Optical Character Recognition.
TechnometricsStatistical Learning Theory
26,913 Citations1999Yuhai Wu, Vladimir Vapnik
Presenting a method for determining the necessary and sufficient conditions for consistency of learning process, the author covers function estimates from small data pools, applying these estimations to real-life problems, and much more.
Data Mining and Knowledge DiscoveryA Tutorial on Support Vector Machines for Pattern Recognition
16,433 Citations1998Christopher J. C. Burges
There are several arguments which support the observed high accuracy of SVMs, which are reviewed and numerous examples and proofs of most of the key theorems are given.
A training algorithm for optimal margin classifiers
11,594 Citations1992Bernhard E. Boser, Isabelle Guyon +1 more
A training algorithm that maximizes the margin between the training patterns and the decision boundary is presented, applicable to a wide variety of the classification functions, including Perceptrons, polynomials, and Radial Basis Functions.
Neural Processing LettersLeast Squares Support Vector Machine Classifiers
9,375 Citations1999Johan A. K. Suykens, Joos Vandewalle
A least squares version for support vector machine (SVM) classifiers that follows from solving a set of linear equations, instead of quadratic programming for classical SVM's.
International Conference on Neural Information ProcessingAdvances in kernel methods: support vector learning
5,815 Citations1999Bernhard Schölkopf, Christopher J. C. Burges +1 more
Support vector machines for dynamic reconstruction of a chaotic system, Klaus-Robert Muller et al pairwise classification and support vector machines, Ulrich Kressel.
Machine LearningChoosing Multiple Parameters for Support Vector Machines
2,182 Citations2002Olivier Chapelle, Vladimir Vapnik +2 more
The problem of automatically tuning multiple parameters for pattern recognition Support Vector Machines (SVMs) is considered by minimizing some estimates of the generalization error of SVMs using a gradient descent algorithm over the set of parameters.
The MIT Press eBooksAdvances in Large-Margin Classifiers
1,870 Citations2000
This book provides an overview of recent developments in large margin classifiers, examines connections with other methods, and identifies strengths and weaknesses of the method, as well as directions for future research.
IEEE Transactions on Neural NetworksFuzzy support vector machines
1,489 Citations2002Chun-Fu Lin, Sheng‐De Wang
This paper applies a fuzzy membership to each input point and reformulate the SVMs such that different input points can make different contributions to the learning of decision surface.
Machine LearningSoft Margins for AdaBoost
1,306 Citations2001Gunnar Rätsch, Takashi Onoda +1 more
It is found that ADABOOST asymptotically achieves a hard margin distribution, i.e. the algorithm concentrates its resources on a few hard-to-learn patterns that are interestingly very similar to Support Vectors.
Studies in fuzziness and soft computingOn Kernel Target Alignment
853 Citations2006Nello Cristianini, Jaz Kandola +2 more
The notion of kernel-alignment, a measure of similarity between two kernel functions or between a kernel and a target function, is introduced, giving experimental results showing that adapting the kernel to improve alignment on the labelled data significantly increases the alignment on a test set, giving improved classification accuracy.
IEEE Transactions on Information TheoryStructural risk minimization over data-dependent hierarchies
527 Citations1998John Shawe‐Taylor, Peter L. Bartlett +2 more
A result is presented that allows one to trade off errors on the training sample against improved generalization performance, and a more general result in terms of "luckiness" functions, which provides a quite general way for exploiting serendipitous simplicity in observed data to obtain better prediction accuracy from small training sets.
IEEE Transactions on Neural NetworksA robust backpropagation learning algorithm for function approximation
298 Citations1994D.S. Chen, Ramesh Jain
A robust BP learning algorithm is derived that is resistant to the noise effects and is capable of rejecting gross errors during the approximation process, and its rate of convergence is improved since the influence of incorrect samples is gracefully suppressed.
Neural ComputationProperties of Support Vector Machines
231 Citations1998Massimiliano Pontil, Alessandro Verri
Using class-center vectors to build support vector machines
133 Citations2003Xuegong Zhang
A new method is presented, which applies the idea of capacity control in SVM but tries to make the machine less sensitive to noises and outliers, and can be called a central support vector machine or CSVM, for it uses the class centers in building the support vectors.
Pattern Recognition LettersEfficient computations for large least square support vector machine classifiers
110 Citations2002Kok Seng Chua
The linear system in the training of the least square support vector machine (LSSVM) proposed by Suykens and Vandewalle can be placed in a more symmetric form so that for a data set with N data points and m features, the linear system can be solved by inverting an m × m instead of an N × N matrix and storing and working with matrices of size at most m × N.
Pattern Recognition LettersModified support vector novelty detector using training data with outliers
41 Citations2003Li Cao, Heow Pueh Lee +1 more
The modified support vector novelty detector (SVND) for novelty detection is proposed which addresses the problem of detecting outliers from normal data patterns and generalizes it to take into account the outliers in the training set by separating both the normalData patterns and the outlier from the origin with maximal margin.
Leave-one-out support vector machines
37 Citations1999Jason Weston
The main novelty of the algorithm is that apart from the choice of kernel, it is parameterless - the selection of the number of training errors is inherent in the algorithm and not chosen by an extra free parameter as in SVMs.
The MIT Press eBooksAdaptive Margin Support Vector Machines
28 Citations2000Jason Weston, Ralf Herbrich
This chapter proposes a minimization problem such that adaptive margins for each training pattern are utilized and gives bounds on the generalization error of the approach which justiies its robustness against outliers.