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

We consider support vector machines(SVM) to predict Y with p numerical variables $X_1$, ${\ldots}$, $X_p$. This paper aims to build a biplot of p explanatory variables, in which the first dimension indicates the direction of SVM classification and/or regression fits. We use the geometric scheme of kernel principal component analysis adapted to map n observations on the two-dimensional projection plane of which one axis is determined by a SVM model a priori.

• Journal of the Korean Data and Information Science Society
• /
• v.18 no.3
• /
• pp.669-678
• /
• 2007

An algorithm to detect the number of discontinuity points of the variance function in regression model is proposed. The proposed algorithm is based on the left and right one-sided kernel estimators of the second moment function and test statistics of the existence of a discontinuity point coming from the asymptotic distribution of the estimated jump size. The finite sample performance is illustrated by simulated example.

• ETRI Journal
• /
• v.31 no.5
• /
• pp.565-575
• /
• 2009

This paper concerns the use of support vector regression (SVR), which is based on the kernel method for learning from examples, in identification of walking robots. To handle complex dynamics in humanoid robot and realize stable walking, this paper develops and implements two types of reference natural motions for a humanoid, namely, walking trajectories on a flat floor and on an ascending slope. Next, SVR is applied to model stable walking motions by considering these actual motions. Three kinds of kernels, namely, linear, polynomial, and radial basis function (RBF), are considered, and the results from these kernels are compared and evaluated. The results show that the SVR approach works well, and SVR with the RBF kernel function provides the best performance. Plus, it can be effectively applied to model and control a practical biped walking robot.

• Journal of the Korean Data and Information Science Society
• /
• v.21 no.1
• /
• pp.51-59
• /
• 2010

In the case that the regression function has a discontinuity point in generalized linear model, Huh (2009) estimated the location and jump size using the log-likelihood weighted the one-sided kernel function. In this paper, we consider estimation of the unknown number of the discontinuity points in the regression function. The proposed algorithm is based on testing of the existence of a discontinuity point coming from the asymptotic distribution of the estimated jump size described in Huh (2009). The finite sample performance is illustrated by simulated example.

• 한국어정보학회:학술대회논문집
• /
• 2016.10a
• /
• pp.291-295
• /
• 2016

본 논문에서는 한국어 기본 유니트 단위로 WPM을 활용한 구글 플레이 스토어 앱의 댓글 감정분석을 수행하였다. 먼저 자동 띄어쓰기 시스템을 적용한 후, 어절단위, 형태소 분석기, WPM을 각각 적용하여 모델을 생성하고, 로지스틱 회귀(Logistic Regression), 소프트맥스 회귀(Softmax Regression), 서포트 벡터머신(Support Vector Machine, SVM)등의 알고리즘을 이용하여 댓글 감정(긍정과 부정)을 비교 분석하였다. 그 결과 어절단위, 형태소 분석기보다 WPM이 최대 25%의 향상된 결과를 얻었다. 또한 분류 과정에서 로지스틱회귀, 소프트맥스 회귀보다는 SVM 성능이 우수했으며, SVM의 기본 파라미터({'kernel':('linear'), 'c':[4]})보다 최적의 파라미터를 적용({'kernel': ('linear','rbf', 'sigmoid', 'poly'), 'C':[0.01, 0.1, 1.4.5]} 하였을 때, 최대 91%의 성능이 나타났다.

• Transactions of the Korean Society of Pressure Vessels and Piping
• /
• v.13 no.1
• /
• pp.40-47
• /
• 2017

In this paper, we investigate the feasibility of a strategy of failure detection and identification. The point of proposed strategy includes a pattern extraction approach for failure identification using Auto-Associative Kernel Regression (AAKR). We consider a simulation data concerning 605 signals of a Generic Pressurized Water Reactor(GPWR). In the application, the reconstructions are provided by a set of AAKR models, whose input signals have been selected by Correlation Analysis(CA) for the identification of the groups. The failure pattern is extracted by analyzing the residuals of observations and reconstructions. We present the possibility of extraction of patterns for six failure.

• Annual Conference on Human and Language Technology
• /
• 2016.10a
• /
• pp.291-295
• /
• 2016

본 논문에서는 한국어 기본 유니트 단위로 WPM을 활용한 구글 플레이 스토어 앱의 댓글 감정분석을 수행하였다. 먼저 자동 띄어쓰기 시스템을 적용한 후, 어절단위, 형태소 분석기, WPM을 각각 적용하여 모델을 생성하고, 로지스틱 회귀(Logistic Regression), 소프트맥스 회귀(Softmax Regression), 서포트 벡터머신(Support Vector Machine, SVM)등의 알고리즘을 이용하여 댓글 감정(긍정과 부정)을 비교 분석하였다. 그 결과 어절단위, 형태소 분석기보다 WPM이 최대 25%의 향상된 결과를 얻었다. 또한 분류 과정에서 로지스틱회귀, 소프트맥스 회귀보다는 SVM 성능이 우수했으며, SVM의 기본 파라미터({'kernel':('linear'), 'c':[4]})보다 최적의 파라미터를 적용({'kernel': ('linear','rbf', 'sigmoid', 'poly'), 'C':[0.01, 0.1, 1.4.5]} 하였을 때, 최대 91%의 성능이 나타났다.

• Communications for Statistical Applications and Methods
• /
• v.23 no.3
• /
• pp.189-201
• /
• 2016

In survival analysis, the Nelson-Aalen estimator and Peterson estimator are often used to estimate a cumulative hazard function in randomly right censored data. In this paper, we suggested the smoothing version of the cumulative hazard function estimators using a Bezier curve. We compare them with the existing estimators including a kernel smooth version of the Nelson-Aalen estimator and the Peterson estimator in the sense of mean integrated square error to show through numerical studies that the proposed estimators are better than existing ones. Further, we applied our method to the Cox regression where covariates are used as predictors and suggested a survival function estimation at a given covariate.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.8 no.3
• /
• pp.196-201
• /
• 2008

Statistical learning theory has three analytical tools which are support vector machine, support vector regression, and support vector clustering for classification, regression, and clustering respectively. In general, their performances are good because they are constructed by convex optimization. But, there are some problems in the methods. One of the problems is the subjective determination of the parameters for kernel function and regularization by the arts of researchers. Also, the results of the learning machines are depended on the selected parameters. In this paper, we propose an efficient method for objective determination of the parameters of support vector clustering which is the clustering method of statistical learning theory. Using evolutionary algorithm and bootstrap method, we select the parameters of kernel function and regularization constant objectively. To verify improved performances of proposed research, we compare our method with established learning algorithms using the data sets form ucr machine learning repository and synthetic data.

• The Korean Journal of Applied Statistics
• /
• v.30 no.5
• /
• pp.733-745
• /
• 2017

Local composite quantile regression is a useful non-parametric regression method widely used for its high efficiency. Data smoothing methods using kernel are typically used in the estimation process with performances that rely largely on the smoothing parameter rather than the kernel. However, $L_2$-norm is generally used as criterion to estimate the performance of the regression function. In addition, many studies have been conducted on the selection of smoothing parameters that minimize mean square error (MSE) or mean integrated square error (MISE). In this paper, we explored the optimality of selecting smoothing parameters that determine the performance of non-parametric regression models using local linear composite quantile regression. As evaluation criteria for the choice of smoothing parameter, we used mean absolute error (MAE) and mean integrated absolute error (MIAE), which have not been researched extensively due to mathematical difficulties. We proved the uniqueness of the optimal smoothing parameter based on MAE and MIAE. Furthermore, we compared the optimal smoothing parameter based on the proposed criteria (MAE and MIAE) with existing criteria (MSE and MISE). In this process, the properties of the proposed method were investigated through simulation studies in various situations.