• The Korean Journal of Applied Statistics
• /
• v.13 no.2
• /
• pp.447-455
• /
• 2000

We propose a weighted kernel pattern recognition method using the K -means clustering algorithm to reduce computation and storage required for the full kernel classifier. This technique finds a set of reference vectors and weights which are used to approximate the kernel classifier. Since the hierarchical clustering method implemented in the 'Weighted Parzen Window (WP\V) classifier is not able to rearrange the proper clusters, we adopt the K -means algorithm to find reference vectors and weights from the more properly rearranged clusters \Ve find that the proposed method outperforms the \VP\V method for the repre~entativeness of the reference vectors and the data reduction.

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.9-12
• /
• 2001

Learning vector quantization (LVQ) is a supervised learning technique that uses class information to move the vector quantizer slightly, so as to improve the quality of the classifier decision regions. In this paper we propose a selection method of initial codebook vectors for a teaming vector quantization (LVQ3) using support vector machines (SVM). The method is experimented with artificial and real design data sets and compared with conventional methods of the condensed nearest neighbor (CNN) and its modifications (mCNN). From the experiments, it is discovered that the proposed method produces higher performance than the conventional ones and then it could be used efficiently for designing nonparametric classifiers.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.7C
• /
• pp.428-434
• /
• 2011

Recently, subspace analysis has raised its performance to a higher level through the adoption of kernel-based nonlinearity. Especially, the radial basis function, based on its nonparametric nature, has shown promising results in face recognition. However, due to the endemic small sample size problem of face data, the conventional kernel-based feature extraction methods have difficulty in data representation. In this paper, we introduce a novel variant of the RBF kernel to alleviate this problem. By adopting the concept of the nearest feature line classifier, we show both effectiveness and generalizability of the proposed method, particularly regarding the small sample size issue.

• Journal of Korea Water Resources Association
• /
• v.32 no.1
• /
• pp.3-13
• /
• 1999

In this study, an alternative spatial analysis method against conventional methods such as Thiessen method, Inverse Distance method, and Kriging method, named Spatial-Analysis Neural-Network (SANN) is presented. It is based on neural network modeling and provides a nonparametric mean estimator and also estimators of high order statistics such as standard deviation and skewness. In addition, it provides a decision-making tool including an estimator of posterior probability that a spatial variable at a given point will belong to various classes representing the severity of the problem of interest and a Bayesian classifier to define the boundaries of subregions belonging to the classes. In this paper, the SANN is implemented to be used for analyzing a mean annual precipitation filed and classifying the field into dry, normal, and wet subregions. For an example, the whole area of South Korea with 39 precipitation sites is applied. Then, several useful results related with the spatial variability of mean annual precipitation on South Korea were obtained such as interpolated field, standard deviation field, and probability maps. In addition, the whole South Korea was classified with dry, normal, and wet regions.