• Title/Summary/Keyword: Cross - Validation

Search Result 994, Processing Time 0.024 seconds

A WEIGHTED GLOBAL GENERALIZED CROSS VALIDATION FOR GL-CGLS REGULARIZATION

  • Chung, Seiyoung;Kwon, SunJoo;Oh, SeYoung
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.29 no.1
    • /
    • pp.59-71
    • /
    • 2016
  • To obtain more accurate approximation of the true images in the deblurring problems, the weighted global generalized cross validation(GCV) function to the inverse problem with multiple right-hand sides is suggested as an efficient way to determine the regularization parameter. We analyze the experimental results for many test problems and was able to obtain the globally useful range of the weight when the preconditioned global conjugate gradient linear least squares(Gl-CGLS) method with the weighted global GCV function is applied.

Estimating Variance Function with Kernel Machine

  • Kim, Jong-Tae;Hwang, Chang-Ha;Park, Hye-Jung;Shim, Joo-Yong
    • Communications for Statistical Applications and Methods
    • /
    • v.16 no.2
    • /
    • pp.383-388
    • /
    • 2009
  • In this paper we propose a variance function estimation method based on kernel trick for replicated data or data consisted of sample variances. Newton-Raphson method is used to obtain associated parameter vector. Furthermore, the generalized approximate cross validation function is introduced to select the hyper-parameters which affect the performance of the proposed variance function estimation method. Experimental results are then presented which illustrate the performance of the proposed procedure.

A transductive least squares support vector machine with the difference convex algorithm

  • Shim, Jooyong;Seok, Kyungha
    • Journal of the Korean Data and Information Science Society
    • /
    • v.25 no.2
    • /
    • pp.455-464
    • /
    • 2014
  • Unlabeled examples are easier and less expensive to obtain than labeled examples. Semisupervised approaches are used to utilize such examples in an eort to boost the predictive performance. This paper proposes a novel semisupervised classication method named transductive least squares support vector machine (TLS-SVM), which is based on the least squares support vector machine. The proposed method utilizes the dierence convex algorithm to derive nonconvex minimization solutions for the TLS-SVM. A generalized cross validation method is also developed to choose the hyperparameters that aect the performance of the TLS-SVM. The experimental results conrm the successful performance of the proposed TLS-SVM.

Prediction Model with a Logistic Regression of Sequencing Two Arrival Flows (합류하는 두 항공기간 도착순서 결정에 대한 로지스틱회귀 예측 모형)

  • Jung, Soyeon;Lee, Keumjin
    • Journal of the Korean Society for Aviation and Aeronautics
    • /
    • v.23 no.4
    • /
    • pp.42-48
    • /
    • 2015
  • This paper has its purpose on constructing a prediction model of the arrival sequencing strategy which reflects the actual sequencing patterns of air traffic controllers. As the first step, we analyzed a pair-wise sequencing of two aircraft entering TMA from different entering points. Based on the historical trajectory data, several traffic factors such as time, speed and traffic density were examined for the model. With statistically significant factors, we constructed a prediction model of arrival sequencing through a binary logistic regression analysis. With the estimated coefficients, the performance of the model was conducted through a cross validation.

Multinomial Kernel Logistic Regression via Bound Optimization Approach

  • Shim, Joo-Yong;Hong, Dug-Hun;Kim, Dal-Ho;Hwang, Chang-Ha
    • Communications for Statistical Applications and Methods
    • /
    • v.14 no.3
    • /
    • pp.507-516
    • /
    • 2007
  • Multinomial logistic regression is probably the most popular representative of probabilistic discriminative classifiers for multiclass classification problems. In this paper, a kernel variant of multinomial logistic regression is proposed by combining a Newton's method with a bound optimization approach. This formulation allows us to apply highly efficient approximation methods that effectively overcomes conceptual and numerical problems of standard multiclass kernel classifiers. We also provide the approximate cross validation (ACV) method for choosing the hyperparameters which affect the performance of the proposed approach. Experimental results are then presented to indicate the performance of the proposed procedure.

Signal Reconstruction by Synchrosqueezed Wavelet Transform

  • Park, Minsu;Oh, Hee-Seok;Kim, Donghoh
    • Communications for Statistical Applications and Methods
    • /
    • v.22 no.2
    • /
    • pp.159-172
    • /
    • 2015
  • This paper considers the problem of reconstructing an underlying signal from noisy data. This paper presents a reconstruction method based on synchrosqueezed wavelet transform recently developed for multiscale representation. Synchrosqueezed wavelet transform based on continuous wavelet transform is efficient to estimate the instantaneous frequency of each component that consist of a signal and to reconstruct components. However, an objective selection method for the optimal number of intrinsic mode type functions is required. The proposed method is obtained by coupling the synchrosqueezed wavelet transform with cross-validation scheme. Simulation studies and musical instrument sounds are used to compare the empirical performance of the proposed method with existing methods.

A Simulation Study on Regularization Method for Generating Non-Destructive Depth Profiles from Angle-Resolved XPS Data

  • Ro, Chul-Un
    • Analytical Science and Technology
    • /
    • v.8 no.4
    • /
    • pp.707-714
    • /
    • 1995
  • Two types of regularization method (singular system and HMP approaches) for generating depth-concentration profiles from angle-resolved XPS data were evaluated. Both approaches showed qualitatively similar results although they employed different numerical algorithms. The application of the regularization method to simulated data demonstrates its excellent utility for the complex depth profile system. It includes the stable restoration of the depth-concentration profiles from the data with considerable random error and the self choice of smoothing parameter that is imperative for the successful application of the regularization method. The self choice of smoothing parameter is based on generalized cross-validation method which lets the data themselves choose the optimal value of the parameter.

  • PDF

SVQR with asymmetric quadratic loss function

  • Shim, Jooyong;Kim, Malsuk;Seok, Kyungha
    • Journal of the Korean Data and Information Science Society
    • /
    • v.26 no.6
    • /
    • pp.1537-1545
    • /
    • 2015
  • Support vector quantile regression (SVQR) can be obtained by applying support vector machine with a check function instead of an e-insensitive loss function into the quantile regression, which still requires to solve a quadratic program (QP) problem which is time and memory expensive. In this paper we propose an SVQR whose objective function is composed of an asymmetric quadratic loss function. The proposed method overcomes the weak point of the SVQR with the check function. We use the iterative procedure to solve the objective problem. Furthermore, we introduce the generalized cross validation function to select the hyper-parameters which affect the performance of SVQR. Experimental results are then presented, which illustrate the performance of proposed SVQR.

Robust varying coefficient model using L1 regularization

  • Hwang, Changha;Bae, Jongsik;Shim, Jooyong
    • Journal of the Korean Data and Information Science Society
    • /
    • v.27 no.4
    • /
    • pp.1059-1066
    • /
    • 2016
  • In this paper we propose a robust version of varying coefficient models, which is based on the regularized regression with L1 regularization. We use the iteratively reweighted least squares procedure to solve L1 regularized objective function of varying coefficient model in locally weighted regression form. It provides the efficient computation of coefficient function estimates and the variable selection for given value of smoothing variable. We present the generalized cross validation function and Akaike information type criterion for the model selection. Applications of the proposed model are illustrated through the artificial examples and the real example of predicting the effect of the input variables and the smoothing variable on the output.

Claims Reserving via Kernel Machine

  • Kim, Mal-Suk;Park, He-Jung;Hwang, Chang-Ha;Shim, Joo-Yong
    • Journal of the Korean Data and Information Science Society
    • /
    • v.19 no.4
    • /
    • pp.1419-1427
    • /
    • 2008
  • This paper shows the kernel Poisson regression which can be applied in the claims reserving, where the row effect is assumed to be a nonlinear function of the row index. The paper concentrates on the chain-ladder technique, within the framework of the chain-ladder linear model. It is shown that the proposed method can provide better reserve estimates than the Poisson model. The cross validation function is introduced to choose optimal hyper-parameters in the procedure. Experimental results are then presented which indicate the performance of the proposed model.

  • PDF