• ETRI Journal
• /
• v.33 no.6
• /
• pp.924-934
• /
• 2011

Sensor networks play an important role in making the dream of ubiquitous computing a reality. With a variety of applications, sensor networks have the potential to influence everyone's life in the near future. However, there are a number of issues in deployment and exploitation of these networks that must be dealt with for sensor network applications to realize such potential. Localization of the sensor nodes, which is the subject of this paper, is one of the basic problems that must be solved for sensor networks to be effectively used. This paper proposes a probabilistic support vector machine (SVM)-based method to gain a fairly accurate localization of sensor nodes. As opposed to many existing methods, our method assumes almost no extra equipment on the sensor nodes. Our experiments demonstrate that the probabilistic SVM method (PSVM) provides a significant improvement over existing localization methods, particularly in sparse networks and rough environments. In addition, a post processing step for PSVM, called attractive/repulsive potential field localization, is proposed, which provides even more improvement on the accuracy of the sensor node locations.

• Journal of Information Processing Systems
• /
• v.17 no.1
• /
• pp.75-88
• /
• 2021

Automobile credit business has developed rapidly in recent years, and corresponding default phenomena occur frequently. Credit default will bring great losses to automobile financial institutions. Therefore, the successful prediction of automobile credit default is of great significance. Firstly, the missing values are deleted, then the random forest is used for feature selection, and then the sample data are randomly grouped. Finally, six prediction models of support vector machine (SVM), random forest and k-nearest neighbor (KNN), logistic, decision tree, and artificial neural network (ANN) are constructed. The results show that these six machine learning models can be used to predict the default of automobile credit. Among these six models, the accuracy of decision tree is 0.79, which is the highest, but the comprehensive performance of SVM is the best. And random grouping can improve the efficiency of model operation to a certain extent, especially SVM.

• Communications for Statistical Applications and Methods
• /
• v.20 no.6
• /
• pp.481-490
• /
• 2013

Classification is an important research area as data can be easily obtained even if the number of predictors becomes huge. The support vector machine(SVM) is widely used to classify a subject into a predetermined group because it gives sound theoretical background and better performance than other methods in many applications. The SVM can be viewed as a penalized method with the hinge loss function and penalty functions. Instead of $L_2$ penalty function Fan and Li (2001) proposed the smoothly clipped absolute deviation(SCAD) satisfying good statistical properties. Despite the ability of SVMs, they have drawbacks of non-robustness when there are outliers in the data. We develop a robust SVM method using a weight function with the SCAD penalty function based on the local quadratic approximation. We compare the performance of the proposed SVM with the SVM using the $L_1$ and $L_2$ penalty functions.

• Journal of Internet Computing and Services
• /
• v.20 no.4
• /
• pp.21-27
• /
• 2019

Selection of feature pattern gathered from the observation of the RNA sequencing data (RNA-seq) are not all equally informative for identification of differential expressions: some of them may be noisy, correlated or irrelevant because of redundancy in Big-Data sets. Variable selection of feature pattern aims at differential expressed gene set that is significantly relevant for a special task. This issues are complex and important in many domains, for example. In terms of a computational research field of machine learning, selection of feature pattern has been studied such as Random Forest, K-Nearest and Support Vector Machine (SVM). One of most the well-known machine learning algorithms is SVM, which is classical as well as original. The one of a member of SVM-criterion is Support Vector Machine-Recursive Feature Elimination (SVM-RFE), which have been utilized in our research work. We propose a novel algorithm of the SVM-RFE with Q-learning in reinforcement learning for better variable selection of feature pattern. By comparing our proposed algorithm with the well-known SVM-RFE combining Welch' T in published data, our result can show that the criterion from weight vector of SVM-RFE enhanced by Q-learning has been improved by an off-policy by a more exploratory scheme of Q-learning.

• Geomechanics and Engineering
• /
• v.18 no.5
• /
• pp.493-502
• /
• 2019

Internal stability is an important safety issue for levees, embankments, and other earthen structures. Since a large part of the world's population lives near oceans, lakes and rivers, floods resulting from breaching of dams can lead to devastating disasters with tremendous loss of life and property, especially in densely populated areas. There are some main factors that affect the internal stability of dams, levees and other earthen structures, such as the erodibility of the soil, the water velocity inside the soil mass and the geometry of the earthen structure, etc. Thus, the mechanism of internal erosion and stability of soils is very complicated and it is vital to investigate the assessment methods of internal stability of soils in embankment dams and their foundations. This paper presents an improved support vector machine (SVM) model to predict the internal stability of soils. The grid search algorithm (GSA) is employed to find the optimal parameters of SVM firstly, and then the cross - validation (CV) method is employed to estimate the classification accuracy of the GSA-SVM model. Two examples of internal stability of soils are presented to validate the predictive capability of the proposed GSA-SVM model. In addition to verify the effectiveness of the proposed GSA-SVM model, the predictions from the proposed GSA-SVM model were compared with those from the traditional back propagation neural network (BPNN) model. The results showed that the proposed GSA-SVM model is a feasible and efficient tool for assessing the internal stability of soils with high accuracy.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.67 no.8
• /
• pp.1071-1079
• /
• 2018

In this study, the design methodology as well as network architecture of Support Vector Machine based Polynomial Neural Network, which is a kind of the dynamically generated neural networks, is introduced. The Support Vector Machine based polynomial neural networks is given as a novel network architecture redesigned with the aid of polynomial neural networks and Support Vector Machine. The generic polynomial neural networks, whose nodes are made of polynomials, are dynamically generated in each layer-wise. The individual nodes of the support vector machine based polynomial neural networks is constructed as a support vector machine, and the nodes as well as layers of the support vector machine based polynomial neural networks are dynamically generated as like the generation process of the generic polynomial neural networks. Support vector machine is well known as a sort of robust pattern classifiers. In addition, in order to enhance the structural flexibility as well as the classification performance of the proposed classifier, multi-objective particle swarm optimization is used. In other words, the optimization algorithm leads to sequentially successive generation of each layer of support vector based polynomial neural networks. The bench mark data sets are used to demonstrate the pattern classification performance of the proposed classifiers through the comparison of the generalization ability of the proposed classifier with some already studied classifiers.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.15 no.2
• /
• pp.96-101
• /
• 2015

Support vector machine (SVM) has a strong theoretical foundation and also achieved excellent empirical success. It has been widely used in a variety of pattern recognition applications. Unfortunately, SVM also has the drawback that it is sensitive to outliers and its performance is degraded by their presence. In this paper, a new outlier detection method based on genetic algorithm (GA) is proposed for a robust SVM. The proposed method parallels the GA-based feature selection method and removes the outliers that would be considered as support vectors by the previous soft margin SVM. The proposed algorithm is applied to various data sets in the UCI repository to demonstrate its performance.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.34 no.11
• /
• pp.1681-1689
• /
• 2010

Several studies on the use of Support Vector Machines (SVMs) for diagnosing rotating machinery have been successfully carried out, but the fault classification depends on the input features as well as a multi-classification scheme, binary optimizer, kernel function, and the parameter to be used in the kernel function. Most of the published papers on multiclass SVM applications report the use of the same features to classify the faults. In this study, simple statistical features are determined on the basis of time domain vibration signals for various fault conditions, and the optimal features for each fault condition are selected. Then, the optimal features are used in the SVM training and in the classification of each fault condition. Simulation results using experimental data show that the results of the proposed stepwise classification approach with a relatively short training time are comparable to those for a single multi-class SVM.

• Journal of the Korean Data and Information Science Society
• /
• v.27 no.3
• /
• pp.827-833
• /
• 2016

In this paper, we propose a deep least squares support vector machine (LS-SVM) for regression problems, which consists of the input layer and the hidden layer. In the hidden layer, LS-SVMs are trained with the original input variables and the perturbed responses. For the final output, the main LS-SVM is trained with the outputs from LS-SVMs of the hidden layer as input variables and the original responses. In contrast to the multilayer neural network (MNN), LS-SVMs in the deep LS-SVM are trained to minimize the penalized objective function. Thus, the learning dynamics of the deep LS-SVM are entirely different from MNN in which all weights and biases are trained to minimize one final error function. When compared to MNN approaches, the deep LS-SVM does not make use of any combination weights, but trains all LS-SVMs in the architecture. Experimental results from real datasets illustrate that the deep LS-SVM significantly outperforms state of the art machine learning methods on regression problems.

• Communications for Statistical Applications and Methods
• /
• v.6 no.2
• /
• pp.337-344
• /
• 1999

Support vector machine(SVM) is a new and very promising regression and classification technique developed by Vapnik and his group at AT&T Bell laboratories. This article provides a brief overview of SVM focusing on linear regression. We explain from statistical point of view why SVM might be attractive and how this could be compared with other linear regression techniques. Furthermore. we explain model selection based on VC-theory.