• Communications for Statistical Applications and Methods
• /
• 제19권4호
• /
• pp.517-526
• /
• 2012

In this paper a support vector method is proposed for use when the sample observations are contaminated by a normally distributed measurement error. The performance of deconvolution density estimators based on the support vector method is explored and compared with kernel density estimators by means of a simulation study. An interesting result was that for the estimation of kurtotic density, the support vector deconvolution estimator with a Gaussian kernel showed a better performance than the classical deconvolution kernel estimator.

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

In this paper we propose support vector quantile regression (SVQR) for randomly right censored data. The proposed procedure basically utilizes iterative method based on the empirical distribution functions of the censored times and the sample quantiles of the observed variables, and applies support vector regression for the estimation of the quantile function. Experimental results we then presented to indicate the performance of the proposed procedure.

• 응용통계연구
• /
• 제18권2호
• /
• pp.253-269
• /
• 2005

회귀모형의 기본가정은 추정된 계수들이 표본 내의 모든 관측값에 대해 일정하다는 것이다. 그러나 자료의 구조적 변화로 인해 모형의 추정계수 중 최소한 일부는 상이한 부분집합으로 전체 표본을 분할해야 하는 경우가 현실적으로는 흔히 존재한다. 본 연구에서는 두 회귀모형 계수들간의 동일성을 검정하는 방법을 확대${\cdot}$일반화하여 자료의 분할시점을 탐색하는 검정절차와 결합시킨 후 이를 최근 가장 큰 사회적 문제가 되고 있는 실업률의 구조변화 발생 여부와 시점을 판별하는 실증분석에 적용시켜 보았다.

• 한국통신학회논문지
• /
• 제24권12B호
• /
• pp.2391-2400
• /
• 1999

벡터 양자화(vector quantizer:VQ)는 낮은 전송률을 가지는 데이터 압축에 효과적인 방법이나, 가장 큰 단점은 부호화 복잡도로 벡터의 차수와 전송률이 증가함에 따라 기하 급수적으로 증가하게 된다. VQ의 부호화 복잡도 문제를 해결하기 위하여 여러 변형된 VQ 기법이 제안되었어도 전송률이 높은 경우에는 높은 부호화 복잡도와 방대한 양의 부호책 및 훈련 열로 인하여 구현이 거의 불가능하다. 본 논문에서는 특별히 높은 전송률에서, 스칼라 양자기의 구조를 가지며 VQ의 성능을 얻을 수 있는 양자화 기법을 제안하였다. 이 기법은 feed-forward 적응 양자기의 형태를 가지고 있는데, 비교적 짧은 적응 주기를 가지고 있다. 따라서 제안한 양자화 기법을 표본 적응 프로덕트 양자기(sample-adaptive product quantizer: SAPQ)로 부르기로 한다. 그러나 제안된 SAPQ는 m차원의 공간에서 구조적 제한을 가지는 m차원 VQ의 일종으로, 비록 입력 신호가 독립이라고 할지라도 입력 분포에 따라 큰 이득을 얻을 수 있다. 제한한 SAPQ의 성능은 입력 분포에 따라서 Lloyd-Max 양자기에 비하여 약 2∼3dB의 이득을 얻었다.

• Journal of the Korean Data and Information Science Society
• /
• 제27권2호
• /
• pp.549-557
• /
• 2016

In this paper we propose multiclassification method for large data sets by ensembling least squares support vector machines (LS-SVM) with principal components instead of raw input vector. We use the revised one-vs-all method for multiclassification, which is one of voting scheme based on combining several binary classifications. The revised one-vs-all method is performed by using the hat matrix of LS-SVM ensemble, which is obtained by ensembling LS-SVMs trained using each random sample from the whole large training data. The leave-one-out cross validation (CV) function is used for the optimal values of hyper-parameters which affect the performance of multiclass LS-SVM ensemble. We present the generalized cross validation function to reduce computational burden of leave-one-out CV functions. Experimental results from real data sets are then obtained to illustrate the performance of the proposed multiclass LS-SVM ensemble.

• 호남수학학술지
• /
• 제25권1호
• /
• pp.95-115
• /
• 2003

Consider the problem of estimating a $p{\times}1$ mean vector ${\theta}(p{\geq}4)$ under the quadratic loss, based on a sample $X_1,\;{\cdots}X_n$. We find an optimal decision rule within the class of Lindley type decision rules which shrink the usual one toward the mean of observations when the underlying distribution is that of a variance mixture of normals and when the norm $||{\theta}-{\bar{\theta}}1||$ is known, where ${\bar{\theta}}=(1/p)\sum_{i=1}^p{\theta}_i$ and 1 is the column vector of ones. When the norm is restricted to a known interval, typically no optimal Lindley type rule exists but we characterize a minimal complete class within the class of Lindley type decision rules. We also characterize the subclass of Lindley type decision rules that dominate the sample mean.

• Journal of the Korean Data and Information Science Society
• /
• 제16권4호
• /
• pp.1027-1039
• /
• 2005

Consider the problem of estimating a $p{\times}1$ mean vector $\theta(p\geq4)$ under the quadratic loss, based on a sample $X_1$, $X_2$, $\cdots$, $X_n$. We find a Lindley type decision rule which shrinks the usual one toward the mean of observations when the underlying distribution is that of a variance mixture of normals and when the norm $\parallel\;{\theta}-\bar{{\theta}}1\;{\parallel}$ is restricted to a known interval, where $bar{{\theta}}=\frac{1}{p}\;\sum\limits_{i=1}^{p}{\theta}_i$ and 1 is the column vector of ones. In this case, we characterize a minimal complete class within the class of Lindley type decision rules. We also characterize the subclass of Lindley type decision rules that dominate the sample mean.

• Journal of information and communication convergence engineering
• /
• 제17권1호
• /
• pp.14-20
• /
• 2019

Currently, microarray gene expression data take advantage of the sufficient classification of cancers, which addresses the problems relating to cancer causes and treatment regimens. However, the sample size of gene expression data is often restricted, because the price of microarray technology on studies in humans is high. We propose enhancing the gene expression classification of support vector machines with generative adversarial networks (GAN-SVMs). A GAN that generates new data from original training datasets was implemented. The GAN was used in conjunction with nonlinear SVMs that efficiently classify gene expression data. Numerical test results on 20 low-sample-size and very high-dimensional microarray gene expression datasets from the Kent Ridge Biomedical and Array Expression repositories indicate that the model is more accurate than state-of-the-art classifying models.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2008년도 International Symposium on Remote Sensing
• /
• pp.386-389
• /
• 2008

It is important that the training stage of a supervised classification is designed to provide the spectral information. On the design of the training stage of a classification typically calls for the use of a large sample of randomly selected pure pixels in order to characterize the classes. Such guidance is generally made without regard to the specific nature of the application in-hand, including the classifier to be used. An approach to the training of a support vector machine (SVM) classifier that is the opposite of that generally promoted for training set design is suggested. This approach uses a small sample of mixed spectral responses drawn from purposefully selected locations (geographical boundaries) in training. A sample of such data should, however, be easier and cheaper to acquire than that suggested by traditional approaches. In this research, we evaluated them against traditional approaches with high-resolution satellite data. The results proved that it can be used small mixed pixels to derive a classification with similar accuracy using a large number of pure pixels. The approach can also reduce substantial costs in training data acquisition because the sampling locations used are commonly easy to observe.

• Communications for Statistical Applications and Methods
• /
• 제15권6호
• /
• pp.939-946
• /
• 2008

In this paper the support vector method is presented for the probability density function estimation when the sample observations are contaminated with random noise. The performance of the procedure is compared to kernel density estimates by the simulation study.