scholarly journals Algorithms of Hard c-Means Clustering Using Kernel Functions in Support Vector Machines

Author(s):  
Sadaaki Miyamoto ◽  
◽  
Youichi Nakayama ◽  

We discuss hard c-means clustering using a mapping into a high-dimensional space considered within the theory of support vector machines. Two types of iterative algorithms are developed. Effectiveness of the proposed method is shown by numerical examples.

Author(s):  
Sadaaki Miyamoto ◽  
◽  
Daisuke Suizu ◽  

We studied clustering algorithms of fuzzy c-means using a kernel to represent an inner product for mapping into high-dimensional space. Such kernels have been studied in support vector machines used by many researchers in pattern classification. Algorithms of fuzzy c-means are transformed into kernel-based methods by changing objective functions, whereby new iterative minimization algorithms are derived. Numerical examples show that clusters that cannot be obtained without a kernel are generated.


This article presented in the context of 2D global facial recognition, using Gabor Wavelet's feature extraction algorithms, and facial recognition Support Vector Machines (SVM), the latter incorporating the kernel functions: linear, cubic and Gaussian. The models generated by these kernels were validated by the cross validation technique through the Matlab application. The objective is to observe the results of facial recognition in each case. An efficient technique is proposed that includes the mentioned algorithms for a database of 2D images. The technique has been processed in its training and testing phases, for the facial image databases FERET [1] and MUCT [2], and the models generated by the technique allowed to perform the tests, whose results achieved a facial recognition of individuals over 96%.


Author(s):  
Alina Lazar ◽  
Bradley A. Shellito

Support Vector Machines (SVM) are powerful tools for classification of data. This article describes the functionality of SVM including their design and operation. SVM have been shown to provide high classification accuracies and have good generalization capabilities. SVM can classify linearly separable data as well as nonlinearly separable data through the use of the kernel function. The advantages of using SVM are discussed along with the standard types of kernel functions. Furthermore, the effectiveness of applying SVM to large, spatial datasets derived from Geographic Information Systems (GIS) is also described. Future trends and applications are also discussed – the described extracted dataset contains seven independent variables related to urban development plus a class label which denotes the urban areas versus the rural areas. This large dataset, with over a million instances really proves the generalization capabilities of the SVM methods. Also, the spatial property allows experts to analyze the error signal.


2014 ◽  
Vol 511-512 ◽  
pp. 467-474
Author(s):  
Jun Tu ◽  
Cheng Liang Liu ◽  
Zhong Hua Miao

Feature selection plays an important role in terrain classification for outdoor robot navigation. For terrain classification, the image data usually have a large number of feature dimensions. The better selection of features usually results in higher labeling accuracy. In this work, a novel approach for terrain perception using Importance Factor based I-Relief algorithm and Feature Weighted Support Vector Machines (IFIR-FWSVM) is put forward. Firstly, the weight of each feature for classification is computed by using Importance Factor based I-Relief algorithm (IFIR) and the irrelevant features are eliminated. Then the weighted features are used to compute the kernel functions of SVM and trained the classifier. Finally, the trained SVM is employed to predict the terrain label in the far-field regions. Experimental results based on DARPA datasets show that the proposed method IFIR-FWSVM is superior over traditional SVM.


2014 ◽  
Vol 644-650 ◽  
pp. 4314-4318
Author(s):  
Xin You Wang ◽  
Ya Li Ning ◽  
Xi Ping He

In order to solve the problem of the conventional methods operated directly in the image, difficult to obtain good results because they are poor in high dimension performance. In this paper, a new method was proposed, which use the Least Squares Support Vector Machines in image segmentation. Furthermore, the parameters of kernel functions are also be optimized by Particle Swarm Optimization (PSO) algorithm. The practical application in various of standard data sets and color image segmentation experiment. The results show that, LS-SVM can use a variety of features in image, the experiments have achieved good results of image segmentation, and the time needed for segmentation is greatly reduced than standard SVM.


Author(s):  
NUTTAKORN THUBTHONG ◽  
BOONSERM KIJSIRIKUL

The Support Vector Machine (SVM) has recently been introduced as a new pattern classification technique. It learns the boundary regions between samples belonging to two classes by mapping the input samples into a high dimensional space, and seeking a separating hyperplane in this space. This paper describes an application of SVMs to two phoneme recognition problems: 5 Thai tones, and 12 Thai vowels spoken in isolation. The best results on tone recognition are 96.09% and 90.57% for the inside test and outside test, respectively, and on vowel recognition are 95.51% and 87.08% for the inside test and outside test, respectively.


Sign in / Sign up

Export Citation Format

Share Document