Support Vector Machines and Applications

2018 ◽  
pp. 1381-1390
Author(s):  
Vandana M. Ladwani
Keyword(s):  
Support Vector Machines ◽  
Machine Learning Algorithms ◽  
Training Data ◽  
Support Vector ◽  
Decision Boundary ◽  
Visual Words ◽  
Vector Machines ◽  
Special Subset ◽  
Multiclass Svm ◽  
Unique Decision

Support Vector Machines is one of the powerful Machine learning algorithms used for numerous applications. Support Vector Machines generate decision boundary between two classes which is characterized by special subset of the training data called as Support Vectors. The advantage of support vector machine over perceptron is that it generates a unique decision boundary with maximum margin. Kernalized version makes it very faster to learn as the data transformation is implicit. Object recognition using multiclass SVM is discussed in the chapter. The experiment uses histogram of visual words and multiclass SVM for image classification.

Support Vector Machines and Applications

2017 ◽  
pp. 254-262
Author(s):  
Vandana M. Ladwani
Keyword(s):  
Support Vector Machines ◽  
Machine Learning Algorithms ◽  
Training Data ◽  
Support Vector ◽  
Decision Boundary ◽  
Visual Words ◽  
Vector Machines ◽  
Special Subset ◽  
Multiclass Svm ◽  
Unique Decision

Support Vector Machines is one of the powerful Machine learning algorithms used for numerous applications. Support Vector Machines generate decision boundary between two classes which is characterized by special subset of the training data called as Support Vectors. The advantage of support vector machine over perceptron is that it generates a unique decision boundary with maximum margin. Kernalized version makes it very faster to learn as the data transformation is implicit. Object recognition using multiclass SVM is discussed in the chapter. The experiment uses histogram of visual words and multiclass SVM for image classification.

Klasifikasi Jenis Pantun Dengan Metode Support Vector Machines (SVM)

2020 ◽  
Vol 4 (5) ◽  
pp. 915-922
Author(s):  
Helena Nurramdhani Irmanda ◽  
Ria Astriratma
Keyword(s):  
Support Vector Machines ◽  
Training Data ◽  
Classification Model ◽  
Support Vector ◽  
Processing Stage ◽  
Stop Word ◽  
Vector Machines ◽  
Testing Data ◽  
Extraction Stage ◽  
Multiclass Svm

This study aims to create a model for categorizing pantun types and analyze the accuracy of support vector machines (SVM). The first stage is collecting pantun that have been labeled with pantun category. The pantun categories consist of pantun for children, pantun for young people, and pantun for elder. After collecting data, the next stage is pre-processing. This pre-processing stage makes data ready to be processed on the extraction stage. The pre-processing stage consists of text segmentation, case folding, tokenization, stop word removal, and stemming. The feature extraction stage is intended to analyze potential information and represent terms as a vector. Separating training data and testing data is necessary to be conducted before the classification process. Then the classification process is done by using multiclass SVM. The results of the classification are evaluated to obtain accuracy and will be analyzed whether the classification model is proper to be used. The results showed that SVM classified the types of pantun with accuracy of 81,91%.  

scholarly journals Research on Parallel Support Vector Machine Based on Spark Big Data Platform

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Yao Huimin
Keyword(s):  
Machine Learning ◽  
Support Vector Machine ◽  
Big Data ◽  
Support Vector Machines ◽  
Cross Validation ◽  
Machine Learning Algorithms ◽  
Support Vector ◽  
Lambda Architecture ◽  
Vector Machines ◽  
Data Platform

With the development of cloud computing and distributed cluster technology, the concept of big data has been expanded and extended in terms of capacity and value, and machine learning technology has also received unprecedented attention in recent years. Traditional machine learning algorithms cannot solve the problem of effective parallelization, so a parallelization support vector machine based on Spark big data platform is proposed. Firstly, the big data platform is designed with Lambda architecture, which is divided into three layers: Batch Layer, Serving Layer, and Speed Layer. Secondly, in order to improve the training efficiency of support vector machines on large-scale data, when merging two support vector machines, the “special points” other than support vectors are considered, that is, the points where the nonsupport vectors in one subset violate the training results of the other subset, and a cross-validation merging algorithm is proposed. Then, a parallelized support vector machine based on cross-validation is proposed, and the parallelization process of the support vector machine is realized on the Spark platform. Finally, experiments on different datasets verify the effectiveness and stability of the proposed method. Experimental results show that the proposed parallelized support vector machine has outstanding performance in speed-up ratio, training time, and prediction accuracy.

scholarly journals DETECTION OF DISEASE SYMPTOMS ON HYPERSPECTRAL 3D PLANT MODELS

2016 ◽  
Vol III-7 ◽  
pp. 89-96 ◽  
Author(s):  
Ribana Roscher ◽  
Jan Behmann ◽  
Anne-Katrin Mahlein ◽  
Jan Dupuis ◽  
Heiner Kuhlmann ◽  
...  
Keyword(s):  
Support Vector Machines ◽  
Sparse Representation ◽  
Test Data ◽  
Training Data ◽  
Hyperspectral Images ◽  
Spectral Information ◽  
Support Vector ◽  
Leaf Spot Disease ◽  
Disease Symptoms ◽  
Vector Machines

We analyze the benefit of combining hyperspectral images information with 3D geometry information for the detection of <i>Cercospora</i> leaf spot disease symptoms on sugar beet plants. Besides commonly used one-class Support Vector Machines, we utilize an unsupervised sparse representation-based approach with group sparsity prior. Geometry information is incorporated by representing each sample of interest with an inclination-sorted dictionary, which can be seen as an 1D topographic dictionary. We compare this approach with a sparse representation based approach without geometry information and One-Class Support Vector Machines. One-Class Support Vector Machines are applied to hyperspectral data without geometry information as well as to hyperspectral images with additional pixelwise inclination information. Our results show a gain in accuracy when using geometry information beside spectral information regardless of the used approach. However, both methods have different demands on the data when applied to new test data sets. One-Class Support Vector Machines require full inclination information on test and training data whereas the topographic dictionary approach only need spectral information for reconstruction of test data once the dictionary is build by spectra with inclination.

Combination with Machine Learning Algorithms for the Classification in E-Bussiness

2011 ◽  
Vol 230-232 ◽  
pp. 625-628
Author(s):  
Lei Shi ◽  
Xin Ming Ma ◽  
Xiao Hong Hu
Keyword(s):  
Machine Learning ◽  
Support Vector Machines ◽  
Set Theory ◽  
Rough Set ◽  
Rough Set Theory ◽  
Machine Learning Algorithms ◽  
Classification Model ◽  
Support Vector ◽  
Mathematical Tool ◽  
Vector Machines

E-bussiness has grown rapidly in the last decade and massive amount of data on customer purchases, browsing pattern and preferences has been generated. Classification of electronic data plays a pivotal role to mine the valuable information and thus has become one of the most important applications of E-bussiness. Support Vector Machines are popular and powerful machine learning techniques, and they offer state-of-the-art performance. Rough set theory is a formal mathematical tool to deal with incomplete or imprecise information and one of its important applications is feature selection. In this paper, rough set theory and support vector machines are combined to construct a classification model to classify the data of E-bussiness effectively.

scholarly journals Linear Support Vector Machines for Prediction of Student Performance in School-Based Education

2020 ◽  
Vol 2020 ◽  
pp. 1-7
Author(s):  
Nalindren Naicker ◽  
Timothy Adeliyi ◽  
Jeanette Wing
Keyword(s):  
Machine Learning ◽  
Support Vector Machines ◽  
Student Performance ◽  
State Of The Art ◽  
Learning Algorithms ◽  
The State ◽  
Machine Learning Algorithms ◽  
Superior Performance ◽  
Support Vector ◽  
Vector Machines

Educational Data Mining (EDM) is a rich research field in computer science. Tools and techniques in EDM are useful to predict student performance which gives practitioners useful insights to develop appropriate intervention strategies to improve pass rates and increase retention. The performance of the state-of-the-art machine learning classifiers is very much dependent on the task at hand. Investigating support vector machines has been used extensively in classification problems; however, the extant of literature shows a gap in the application of linear support vector machines as a predictor of student performance. The aim of this study was to compare the performance of linear support vector machines with the performance of the state-of-the-art classical machine learning algorithms in order to determine the algorithm that would improve prediction of student performance. In this quantitative study, an experimental research design was used. Experiments were set up using feature selection on a publicly available dataset of 1000 alpha-numeric student records. Linear support vector machines benchmarked with ten categorical machine learning algorithms showed superior performance in predicting student performance. The results of this research showed that features like race, gender, and lunch influence performance in mathematics whilst access to lunch was the primary factor which influences reading and writing performance.

scholarly journals Mobile Money Fraud Prediction—A Cross-Case Analysis on the Efficiency of Support Vector Machines, Gradient Boosted Decision Trees, and Naïve Bayes Algorithms

Information ◽  
2020 ◽  
Vol 11 (8) ◽  
pp. 383
Author(s):  
Francis Effirim Botchey ◽  
Zhen Qin ◽  
Kwesi Hughes-Lartey
Keyword(s):  
Developing Countries ◽  
Support Vector Machines ◽  
Decision Tree ◽  
Naive Bayes ◽  
Naïve Bayes ◽  
Machine Learning Algorithms ◽  
Support Vector ◽  
Mobile Money ◽  
Vector Machines ◽  
Boosted Decision Tree

The onset of COVID-19 has re-emphasized the importance of FinTech especially in developing countries as the major powers of the world are already enjoying the advantages that come with the adoption of FinTech. Handling of physical cash has been established as a means of transmitting the novel corona virus. Again, research has established that, been unbanked raises the potential of sinking one into abject poverty. Over the years, developing countries have been piloting the various forms of FinTech, but the very one that has come to stay is the Mobile Money Transactions (MMT). As mobile money transactions attempt to gain a foothold, it faces several problems, the most important of them is mobile money fraud. This paper seeks to provide a solution to this problem by looking at machine learning algorithms based on support vector machines (kernel-based), gradient boosted decision tree (tree-based) and Naïve Bayes (probabilistic based) algorithms, taking into consideration the imbalanced nature of the dataset. Our experiments showed that the use of gradient boosted decision tree holds a great potential in combating the problem of mobile money fraud as it was able to produce near perfect results.

LOCAL DESCRIPTOR MATCHING WITH SUPPORT VECTOR MACHINES

2010 ◽  
Vol 07 (01) ◽  
pp. 59-80
Author(s):  
D. CHENG ◽  
S. Q. XIE ◽  
E. HÄMMERLE
Keyword(s):  
Machine Learning ◽  
Support Vector Machines ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
Support Vector ◽  
Local Descriptor ◽  
Local Descriptors ◽  
Vector Machines ◽  
Three Stages ◽  
Image Transformations

Local descriptor matching is the most overlooked stage of the three stages of the local descriptor process, and this paper proposes a new method for matching local descriptors based on support vector machines. Results from experiments show that the developed method is more robust for matching local descriptors for all image transformations considered. The method is able to be integrated with different local descriptor methods, and with different machine learning algorithms and this shows that the approach is sufficiently robust and versatile.

Sign in / Sign up

Export Citation Format

Share Document