scholarly journals Comparing performance of interval neutrosophic sets and neural networks with support vector machines for binary classification problems

2008 ◽  
Author(s):  
Pawalai Kraipeerapun ◽  
Chun Che Fung
Keyword(s):  
Neural Networks ◽  
Support Vector Machines ◽  
Binary Classification ◽  
Support Vector ◽  
Classification Problems ◽  
Neutrosophic Sets ◽  
Vector Machines ◽  
Interval Neutrosophic Sets

Support Vector Machines

2011 ◽  
pp. 1518-1523
Author(s):  
Cecilio Angulo ◽  
Luis Gonzalez-Abril
Keyword(s):  
Support Vector Machines ◽  
Text Categorization ◽  
Binary Classification ◽  
Support Vector ◽  
Risk Minimization ◽  
Classification Problems ◽  
Microarray Gene Expression ◽  
Vector Machines ◽  
The Sixties ◽  
Learning Machine

Support Vector Machines -- SVMs -- are learning machines, originally designed for bi-classification problems, implementing the well-known Structural Risk Minimization (SRM) inductive principle to obtain good generalization on a limited number of learning patterns (Vapnik, 1998). The optimization criterion for these machines is maximizing the margin between two classes, i.e. the distance between two parallel hyperplanes that split the vectors of each one of the two classes, since larger is the margin separating classes, smaller is the VC dimension of the learning machine, which theoretically ensures a good generalization performance (Vapnik, 1998), as it has been demonstrated in a number of real applications (Cristianini, 2000). In its formulation is applicable the kernel trick, which improves the capacity of these algorithms, learning not being directly performed in the original space of data but in a new space called feature space; for this reason this algorithm is one of the most representative of the called Kernel Machines (KMs). Main theory was originally developed on the sixties and seventies by V. Vapnik and A. Chervonenkis (Vapnik et al., 1963, Vapnik et al., 1971, Vapnik, 1995, Vapnik, 1998), on the basis of a separable binary classification problem, however generalization in the use of these learning algorithms did not take place until the nineties (Boser et al., 1992). SVMs has been used thoroughly in any kind of learning problems, mainly in classification problems, although also in other problems like regression (Schölkopf et al., 2004) or clustering (Ben-Hur et al., 2001). The fields of Optic Character Recognition (Cortes et al., 1995) and Text Categorization (Sebastiani, 2002) were the most important initial applications where SVMs were used. With the extended application of new kernels, novel applications have taken place in the field of Bioinformatics, concretely many works are related with the classification of data in Genetic Expression (Microarray Gene Expression) (Brown et al., 1997) and detecting structures between proteins and their relationship with the chains of DNA (Jaakkola et al., 2000). Other applications include image identification, voice recognition, prediction in time series, etc. A more extensive list of applications can be found in (Guyon, 2006).

scholarly journals Universal consistency of twin support vector machines

2021 ◽  
Author(s):  
Weixia Xu ◽  
Dingjiang Huang ◽  
Shuigeng Zhou
Keyword(s):  
Support Vector Machines ◽  
Sample Size ◽  
General Framework ◽  
Binary Classification ◽  
Classification Problem ◽  
Covering Number ◽  
Support Vector ◽  
Classification Problems ◽  
Vector Machines ◽  
Universal Consistency

AbstractA classification problem aims at constructing a best classifier with the smallest risk. When the sample size approaches infinity, the learning algorithms for a classification problem are characterized by an asymptotical property, i.e., universal consistency. It plays a crucial role in measuring the construction of classification rules. A universal consistent algorithm ensures that the larger the sample size of the algorithm is, the more accurately the distribution of the samples could be reconstructed. Support vector machines (SVMs) are regarded as one of the most important models in binary classification problems. How to effectively extend SVMs to twin support vector machines (TWSVMs) so as to improve performance of classification has gained increasing interest in many research areas recently. Many variants for TWSVMs have been proposed and used in practice. Thus in this paper, we focus on the universal consistency of TWSVMs in a binary classification setting. We first give a general framework for TWSVM classifiers that unifies most of the variants of TWSVMs for binary classification problems. Based on it, we then investigate the universal consistency of TWSVMs. To do this, we give some useful definitions of risk, Bayes risk and universal consistency for TWSVMs. Theoretical results indicate that universal consistency is valid for various TWSVM classifiers under some certain conditions, including covering number, localized covering number and stability. For applications of our general framework, several variants of TWSVMs are considered.

Gaussian Processes for Classification: Mean-Field Algorithms

2000 ◽  
Vol 12 (11) ◽  
pp. 2655-2684 ◽  
Author(s):  
Manfred Opper ◽  
Ole Winther
Keyword(s):  
Support Vector Machines ◽  
Gaussian Processes ◽  
Disordered Systems ◽  
Binary Classification ◽  
Computational Cost ◽  
Mean Field ◽  
Strong Support ◽  
Support Vector ◽  
Vector Machines ◽  
Leave One Out

We derive a mean-field algorithm for binary classification with gaussian processes that is based on the TAP approach originally proposed in statistical physics of disordered systems. The theory also yields an approximate leave-one-out estimator for the generalization error, which is computed with no extra computational cost. We show that from the TAP approach, it is possible to derive both a simpler “naive” mean-field theory and support vector machines (SVMs) as limiting cases. For both mean-field algorithms and support vector machines, simulation results for three small benchmark data sets are presented. They show that one may get state-of-the-art performance by using the leave-one-out estimator for model selection and the built-in leave-one-out estimators are extremely precise when compared to the exact leave-one-out estimate. The second result is taken as strong support for the internal consistency of the mean-field approach.

Audio-Based Condition Monitoring in Milling of the Workpiece Material With the Hardness Variation Using Support Vector Machines and Convolutional Neural Networks

2018 ◽  
Author(s):  
Achyuth Kothuru ◽  
Sai Prasad Nooka ◽  
Rui Liu
Keyword(s):  
Neural Networks ◽  
Support Vector Machines ◽  
Tool Wear ◽  
Support Vector ◽  
Workpiece Material ◽  
Artificial Intelligent ◽  
Tool Condition ◽  
Hardness Variation ◽  
Vector Machines ◽  
Audible Sound

Machining industry has been evolving towards implementation of automation into the process for higher productivity and efficiency. Although many studies have been conducted in the past to develop intelligent monitoring systems in various application scenarios of machining processes, most of them just focused on cutting tools without considering the influence due to the non-uniform hardness of workpiece material. This study develops a compact, reliable, and cost-effective intelligent Tool Condition Monitoring (TCM) model to detect the cutting tool wear in machining of the workpiece material with hardness variation. The generated audible sound signals during the machining process will be analyzed by state of the art artificial intelligent techniques, Support Vector Machines (SVMs) and Convolutional Neural Networks (CNNs), to predict the tool condition and the hardness variation of the workpiece. A four-level classification model is developed for the system to detect the tool wear condition based on the width of the flank wear land and hardness variation of the workpiece. The study also involves comparative analysis between two employed artificial intelligent techniques to evaluate the performance of models in predicting the tool wear level condition and workpiece hardness variation. The proposed intelligent models have shown a significant prediction accuracy in detecting the tool wear and from the audible sound into the proposed multi-classification wear class in the end-milling process of non-uniform hardened workpiece.

Sign in / Sign up

Export Citation Format

Share Document