2014
DOI: 10.1016/j.neucom.2012.07.049
|View full text |Cite
|
Sign up to set email alerts
|

A fuzzy support vector machine algorithm for classification based on a novel PIM fuzzy clustering method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
28
0
3

Year Published

2015
2015
2023
2023

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 53 publications
(31 citation statements)
references
References 23 publications
0
28
0
3
Order By: Relevance
“…The Support Vector Machine algorithm is supervised learning approach used to solve classification problems. It accepts labelled training data and produces hyperplane which is used to maximize the margin between high-dimensional space classes (Wu et al, 2014). The Decision Forest algorithm is a learning method consisting of multiple classification methods.…”
Section: Machine Learning Algorithmsmentioning
confidence: 99%
“…The Support Vector Machine algorithm is supervised learning approach used to solve classification problems. It accepts labelled training data and produces hyperplane which is used to maximize the margin between high-dimensional space classes (Wu et al, 2014). The Decision Forest algorithm is a learning method consisting of multiple classification methods.…”
Section: Machine Learning Algorithmsmentioning
confidence: 99%
“…al., [5] have proposed a PIMclustering-based FSVM algorithm for classification problems with outliers or noises. The experiments have been conducted on five benchmark datasets to test the generalization performance of the PIM-FSVM algorithm.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Note that the variable h in (7) and that in (5) refer to the same functional. By minimizing h in (7), we are minimizing an exact bound on γ, the VC dimension of the classifier.…”
Section: The Linear Minimal Complexity Machinementioning
confidence: 99%
“…The most commonly used variants are the maximum margin L 1 norm SVM [1], and the least squares SVM (LSSVM) [2], both of which require the solution of a quadratic programming problem. In the last few years, SVMs have been applied to a number of applications to obtain cutting edge performance; novel uses have also been devised, where their utility has been amply demonstrated [3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24]. SVMs were motivated by the celebrated work of Vapnik and his colleagues on generalization, and the complexity of learning.…”
Section: Introductionmentioning
confidence: 99%