• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.7 no.1
• /
• pp.1-6
• /
• 2007

The SVDD (support vector data description) is one of the most well-known one-class support vector learning methods, in which one tries the strategy of utilizing balls defined on the feature space in order to distinguish a set of normal data from all other possible abnormal objects. Recently, with the objective of generalizing the SVDD which treats all training data with equal importance, the so-called D-SVDD (density-induced support vector data description) was proposed incorporating the idea that the data in a higher density region are more significant than those in a lower density region. In this paper, we consider the problem of further improving the D-SVDD toward the use of a partial reference set for testing, and propose an LMI (linear matrix inequality)-based optimization approach to solve the improved version of the D-SVDD problems. Our approach utilizes a new class of density-induced distance measures based on the RSDE (reduced set density estimator) along with the LMI-based mathematical formulation in the form of the SDP (semi-definite programming) problems, which can be efficiently solved by interior point methods. The validity of the proposed approach is illustrated via numerical experiments using real data sets.

• Journal of Information Processing Systems
• /
• v.14 no.6
• /
• pp.1385-1397
• /
• 2018

There are many factors that affect the wind speed. In addition, the randomness of wind speed also leads to low prediction accuracy for wind speed. According to this situation, this paper constructs the short-time forecasting model based on the least squares support vector machines (LSSVM) to forecast the wind speed. The basis of the model used in this paper is support vector regression (SVR), which is used to calculate the regression relationships between the historical data and forecasting data of wind speed. In order to improve the forecast precision, historical data is clustered by cluster analysis so that the historical data whose changing trend is similar with the forecasting data can be filtered out. The filtered historical data is used as the training samples for SVR and the parameters would be optimized by particle swarm optimization (PSO). The forecasting model is tested by actual data and the forecast precision is more accurate than the industry standards. The results prove the feasibility and reliability of the model.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.7
• /
• pp.1253-1258
• /
• 2006

In the mobile vector map service environments, there are problems like as terminal resource shortage and transmission delay for the characteristics of large spatial data. For the normal mobile vector map services, some techniques are required to overcome the problems. Spatial data compression approach is one of the techniques to reduce the bandwidth and the waiting time at clients. However it also must be considered that the effect on total efficiency caused by the overhead of compression and restoration time. This thesis proposes two spatial data compression techniques. First approach is to get relative coordinates to first coordinate of each object. The other approach is to compute client coordinates before transmission. Through the implementation and experiments, proposed techniques are evaluated the compression effects and efficiency.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.358-362
• /
• 2004

According to the rapid advance of computer and communication techniques, the request of mobile internet services is highly increasing. However, the main obstacles for mobile vector map service environments, are large data volume and narrow wireless bandwidth. Among the many possible solutions, spatial data compression technique may contribute to reduce the load of bandwidth and client response time. This thesis proposes two methods for spatial data compression. The one is relative coordinates transformation method, and the other is client coordinates transformation method. And, this thesis also proposes the system architecture for experiments. The two compression methods could be evaluated the compression effect and the response time.

• Journal of Information Technology Services
• /
• v.10 no.2
• /
• pp.235-245
• /
• 2011

Early criticality prediction models that determine whether a design entity is fault-prone or not are becoming more and more important as software development projects are getting larger. Effective predictions can reduce the system development cost and improve software quality by identifying trouble-spots at early phases and proper allocation of effort and resources. Many prediction models have been proposed using statistical and machine learning methods. This paper builds a prediction model using Support Vector Machine(SVM) which is one of the most popular modern classification methods and compares its prediction performance with a well-known prediction model, BackPropagation neural network Model(BPM). SVM is known to generalize well even in high dimensional spaces under small training data conditions. In prediction performance evaluation experiments, dimensionality reduction techniques for data set are not used because the dimension of input data is too small. Experimental results show that the prediction performance of SVM model is slightly better than that of BPM and polynomial kernel function achieves better performance than other SVM kernel functions.

• Communications for Statistical Applications and Methods
• /
• v.16 no.2
• /
• pp.335-348
• /
• 2009

Fuzzy regression is used as a complement or an alternative to represent the relation between variables among the forecasting models especially when the data is insufficient to evaluate the relation. Such phenomenon often occurs in seasonal time series data which require large amount of data to describe the underlying pattern. Semiparametric model is useful tool in the case where domain knowledge exists about the function to be estimated or emphasis is put onto understandability of the model. In this paper we propose fuzzy semiparametric support vector regression so that it can provide good performance on forecasting of the seasonal time series by incorporating into fuzzy support vector regression the basis functions which indicate the seasonal variation of time series. In order to indicate the performance of this method, we present two examples of predicting the seasonal time series. Experimental results show that the proposed method is very attractive for the seasonal time series in fuzzy environments.

• Communications for Statistical Applications and Methods
• /
• v.18 no.2
• /
• pp.165-170
• /
• 2011

Support vector quantile regression(SVQR) is capable of providing a good description of the linear and nonlinear relationships among random variables. In this paper we propose a sparse SVQR to overcome a limitation of SVQR, nonsparsity. The asymmetric e-insensitive loss function is used to efficiently provide sparsity. The experimental results are presented to illustrate the performance of the proposed method by comparing it with nonsparse SVQR.

• Journal of the Korean Data and Information Science Society
• /
• v.21 no.6
• /
• pp.1319-1325
• /
• 2010

Quantile regression provides a more complete statistical analysis of the stochastic relationships among random variables. Sometimes quantile functions estimated at different orders can cross each other. We propose a new non-crossing quantile regression method applying support vector median regression to restricted regression quantile, restricted support vector quantile regression. The proposed method provides a satisfying solution to estimating non-crossing quantile functions when multiple quantiles for high dimensional data are needed. We also present the model selection method that employs cross validation techniques for choosing the parameters which aect the performance of the proposed method. One real example and a simulated example are provided to show the usefulness of the proposed method.

• Journal of the Korean Statistical Society
• /
• v.36 no.3
• /
• pp.367-372
• /
• 2007

Classification as a tool to extract information from data plays an important role in science and engineering. Among various classification methodologies, support vector machine has recently seen significant developments. The central problem this paper addresses is the accuracy of support vector machine. In particular, we are interested in the situations where fast rates of convergence to the Bayes risk can be achieved by support vector machine. Through learning examples, we illustrate that support vector machine may yield fast rates if the space spanned by an adopted kernel is sufficiently large.

• Journal of the Korean Mathematical Society
• /
• v.55 no.6
• /
• pp.1321-1336
• /
• 2018

In this paper, we obtain some necessary and sufficient conditions for the Reeb vector field of a trans-Sasakian 3-manifold to be minimal or harmonic. We construct some examples to illustrate main results. As applications of the above results, we obtain some new characteristic conditions under which a compact trans-Sasakian 3-manifold is homothetic to either a Sasakian or cosymplectic 3-manifold.