• Communications for Statistical Applications and Methods
• /
• 제14권1호
• /
• pp.215-227
• /
• 2007

Variable selection algorithm for Sliced Inverse Regression using penalty function is proposed. We noted SIR models can be expressed as generalized eigenvalue decompositions and incorporated penalty functions on them. We found from small simulation that the HARD penalty function seems to be the best in preserving original directions compared with other well-known penalty functions. Also it turned out to be effective in forcing coefficient estimates zero for irrelevant predictors in regression analysis. Results from illustrative examples of simulated and real data sets will be provided.

• Communications for Statistical Applications and Methods
• /
• 제22권1호
• /
• pp.41-54
• /
• 2015

In this article, we propose nonconcave penalties on a reduced-rank regression model to select variables and estimate coefficients simultaneously. We apply HARD (hard thresholding) and SCAD (smoothly clipped absolute deviation) symmetric penalty functions with singularities at the origin, and bounded by a constant to reduce bias. In our simulation study and real data analysis, the new method is compared with an existing variable selection method using $L_1$ penalty that exhibits competitive performance in prediction and variable selection. Instead of using only one type of penalty function, we use two or three penalty functions simultaneously and take advantages of various types of penalty functions together to select relevant predictors and estimation to improve the overall performance of model fitting.

• 대한교통학회지
• /
• 제27권1호
• /
• pp.157-167
• /
• 2009

본 연구는 도시교통수요예측에 있어 회전제약함수를 다루고 있다. 연구의 목적은 신호교차로의 좌회전 교통에 대한 제약함수를 개발하고, 통행배정모형에 이러한 함수의 적용가능성을 분석하는데 있다. 이것은 기존 모형이 직진 이동류의 지체보다 더 많은 죄회전 이동류의 지체를 효과적으로 반영하지 못하고 있다는 배경에 근거하고 있다. 이를 위해 본 연구에서는 Transyt-7F의 모의실험 결과를 이용하여 포화도에 근거한 함수를 개발하고, 청주를 사례연구로 이러한 함수의 적용가능성을 분석하는데 중점을 두고 있다. 주요 연구결과는 다음과 같다. 첫째, 포화도에 따라 개발된 두 제약함수는 모두 통계적으로 의미 있는 것으로 평가된다. 둘째, 위 함수를 청주시에 적용한 결과, 반복횟수는 증가하나 수렴하는 것으로 분석된다. 셋째, 회전제약 함수를 적용하여 예측한 구간통행량은 기존 모형의 경우보다 관측통행량과의 오차가 감소된 것으로 평가된다. 마지막으로, 회전제약 함수의 두 형태, 즉 지수함수와 분리함수에 의해 배정된 교통량의 차이는 매우 작은 것으로 분석된다.

• Communications for Statistical Applications and Methods
• /
• 제10권3호
• /
• pp.1025-1036
• /
• 2003

Variable selection algorithm for principal component analysis using penalty function is proposed. We use the fact that usual principal component problem can be expressed as a maximization problem with appropriate constraints and we will add penalty function to this maximization problem. Simulated annealing algorithm is used in searching for optimal solutions with penalty functions. Comparisons between several well-known penalty functions through simulation reveals that the HARD penalty function should be suggested as the best one in several aspects. Illustrations with real and simulated examples are provided.

• Communications for Statistical Applications and Methods
• /
• 제20권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.

• Korean Journal of Mathematics
• /
• 제25권2호
• /
• pp.147-162
• /
• 2017

In this research works, we consider the general regularized penalty method for non-stationary set valued equilibrium problem in a Banach space. We define weak coercivity conditions and show that the weak and strong convergence problems of the regularized penalty method.

• Communications for Statistical Applications and Methods
• /
• 제19권5호
• /
• pp.655-662
• /
• 2012

Classification is an important research field in pattern recognition with high-dimensional predictors. The support vector machine(SVM) is a penalized feature selector and classifier. It is based on the hinge loss function, the non-convex penalty function, and the smoothly clipped absolute deviation(SCAD) suggested by Fan and Li (2001). We developed the algorithm for the multiclass SVM with the SCAD penalty function using the local quadratic approximation. For multiclass problems we compared the performance of the SVM with the $L_1$, $L_2$ penalty functions and the developed method.

• Journal of Ship and Ocean Technology
• /
• 제9권4호
• /
• pp.35-46
• /
• 2005

The performance of optimisation methods, based on penalty functions, is highly problem- dependent and many methods require additional tuning of some variables. This additional tuning is the influences of penalty coefficient, which depend strongly on the degree of constraint violation. Moreover, Binary-coded Genetic Algorithm (BGA) meets certain difficulties when dealing with continuous and/or discrete search spaces with large dimensions. With the above reasons, Real-coded Micro-Genetic Algorithm (R$\mu$GA) is proposed to find the global optimum of continuous and/or discrete nonlinear constrained engineering problems without handling any of penalty functions. R$\mu$GA can help in avoiding the premature convergence and search for global solution-spaces, because of its wide spread applicability, global perspective and inherent parallelism. The proposed R$\mu$GA approach has been demonstrated by solving three different engineering design problems. From the simulation results, it has been concluded that R$\mu$GA is an effective global optimisation tool for solving continuous and/or discrete nonlinear constrained real­world optimisation problems.

• 대한의용생체공학회:의공학회지
• /
• 제38권5호
• /
• pp.219-226
• /
• 2017

Penalized-likelihood (PL) reconstruction methods for transmission tomography are known to provide improved image quality for reduced dose level by efficiently smoothing out noise while preserving edges. Unfortunately, however, most of the edge-preserving penalty functions used in conventional PL methods contain at least one free parameter which controls the shape of a non-quadratic penalty function to adjust the sensitivity of edge preservation. In this work, to avoid difficulties in finding a proper value of the free parameter involved in a non-quadratic penalty function, we propose a new adaptive method of space-variant smoothing with a simple quadratic penalty function. In this method, the smoothing parameter is adaptively selected for each pixel location at each iteration by using the image roughness measured by a pixel-wise standard deviation image calculated from the previous iteration. The experimental results demonstrate that our new method not only preserves edges, but also suppresses noise well in monotonic regions without requiring additional processes to select free parameters that may otherwise be included in a non-quadratic penalty function.

• Communications for Statistical Applications and Methods
• /
• 제15권4호
• /
• pp.633-642
• /
• 2008

본 논문에서는 반응변수가 하나 이상이고 설명변수들의 수가 관측치에 비하여 상대적으로 많은 경우에 널리 사용되는 부분최소제곱회귀모형에 벌점함수를 적용하여 모형에 필요한 설명변수들을 선택하는 문제를 고려하였다. 모형에 필요한 설명변수들은 각각의 잠재변수들에 대한 최적해 문제에 벌점함수를 추가한 후 모의담금질을 이용하여 선택하였다. 실제 자료에 대한 적용 결과 모형의 설명력 및 예측력을 크게 떨어뜨리지 않으면서 필요없는 변수들을 효과적으로 제거하는 것으로 나타나 부분최소제곱회귀모형에서 최적인 설명변수들의 부분집합을 선택하는데 적용될 수 있을 것이다.