• The Korean Journal of Applied Statistics
• /
• v.31 no.4
• /
• pp.507-516
• /
• 2018

Widely used among the various single imputation methods is k-nearest neighbors (KNN) imputation due to its robustness even when a parametric model such as multivariate normality is not satisfied. We propose a weighted adaptive nearest neighbors imputation method that combines the adaptive nearest neighbors imputation method that accounts for the local features of the data in the KNN imputation method and weighted k-nearest neighbors method that are less sensitive to extreme value or outlier among k-nearest neighbors. We conducted a Monte Carlo simulation study to compare the performance of the proposed imputation method with previous imputation methods.

• The Korean Journal of Applied Statistics
• /
• v.24 no.6
• /
• pp.1249-1257
• /
• 2011

In this paper, we propose a Sequential Adaptive Nearest Neighbor(SANN) imputation method that combines the Adaptive Nearest Neighbor(ANN) method and the Sequential k-Nearest Neighbor(SKNN) method. When choosing the nearest neighbors of missing observations, the proposed SANN method takes the local feature of the missing observations into account as well as reutilizes the imputed observations in a sequential manner. By using a Monte Carlo study and a real data example, we demonstrate the characteristics of the SANN method and its potential performance.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.761-764
• /
• 2004

얼굴 데이터를 사용하는 인식 시스템에서 특징 벡터의 차원은 일반적으로 매우 크다. 패턴인식에서 차원 축소는 중요한 문제로서, 효과적인 얼굴 인식을 위한 특징 벡터의 차원 축소는 필수적이라 할 수 있다. 본 논문에서는 획득된 얼굴 데이터로부터 저 차원의 강건한 특징을 얻기 위하여 웨이블릿을 사용하고, 식별력 있는 특징을 얻기 위하여 direct linear discriminant analysis를 사용하였다. Direct linear discriminant analysis 방법을 사용하기 이전에 웨이블릿을 사용함으로써 계산 복잡도를 줄여줄 뿐만 아니라 식별력을 높여주고 효과적으로 얼굴 데이터의 차원을 축소할 수 있음을 보여 준다. 얼굴의 패턴정합을 위해서는 최근접 평균 분류기(Nearest Mean Classifier)를 사용하였으며, 최근접 평균 분류기를 사용함으로써 분류를 위한 시간을 최소화하였다. 본 논문에서 인간의 얼굴인식을 위해 제시한 방법이 얼굴패턴을 표현하는 효과적인 방법이며, 시간 및 공간의 절약이라는 측면에서 유리하다는 것을 보여준다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.793-795
• /
• 2004

본 논문에서는 웨이블릿 변환과 Direct LDA(DLDA)을 사용한 홍채 특징추출 방법을 제안한다. 이것은 획득한 홍채 영상으로부터 독특한 특징을 추출하기 위해 특별히 이차원 이산 웨이블릿 변환의 다중해상도 분해 방법을 사용하는 것이다 또한 홍채의 다양한 웨이블릿 성분으로부터 변별력을 가진 특징을 얻을 수 있도록 DLDA 기법을 적용하였다. 이러한 특징추출 방법은 이동이나 회전에 변하지 않는 알고리즘을 요구하는 홍채의 모양을 묘사하는데 적합하다. 홍채의 패턴정합을 위해서는 최근접 평균 분류기(Nearest Mean Classifier)를 사용하였다. 본 논문에서 인간의 홍채인식을 위해 제시한 방법이 홍채패턴을 표현하는 효과적인 방법이며, 시간 및 공간의 절약이라는 측면에서 유리하다는 것을 보여준다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2018.01a
• /
• pp.143-146
• /
• 2018

서명기반 악성코드 탐지는 악성 파일의 고유 해싱 값을 사용하거나 패턴화된 공격 규칙을 이용하므로, 변형된 악성코드 탐지에 취약한 단점이 있다. 기계 학습을 적용한 악성코드 탐지는 이러한 취약점을 극복할 수 있는 방안으로 인식되고 있다. 본 논문은 정적 분석으로 n-gram과 API 특징점을 추출해 특징 벡터로 구성하여 XGBoost, k-최근접 이웃 알고리즘, 지지 벡터 기기, 신경망 알고리즘, 심층 학습 알고리즘의 일반화 성능을 비교한다. 실험 결과로 XGBoost가 일반화 성능이 99%로 가장 우수했으며 k-최근접 이웃 알고리즘이 학습 시간이 가장 적게 소요됐다. 일반화 성능과 시간 복잡도 측면에서 XGBoost가 비교 대상 알고리즘에 비해 우수한 성능을 보였다.

• The Korean Journal of Applied Statistics
• /
• v.34 no.3
• /
• pp.401-410
• /
• 2021

Popular in discriminant classification analysis, k-nearest neighbor classification methods have limitations that do not reflect the local characteristic of the data, considering only the number of fixed neighbors. Considering the local structure of the data, the adaptive nearest neighbor method has been developed to select the number of neighbors. In the analysis of high-dimensional data, it is common to perform dimension reduction such as random projection techniques before using k-nearest neighbor classification. Recently, an ensemble technique has been developed that carefully combines the results of such random classifiers and makes final assignments by voting. In this paper, we propose a novel discriminant classification technique that combines adaptive nearest neighbor methods with random projection ensemble techniques for analysis on high-dimensional data. Through simulation and real-world data analyses, we confirm that the proposed method outperforms in terms of classification accuracy compared to the previously developed methods.

• The Journal of the Korea Contents Association
• /
• v.20 no.10
• /
• pp.715-725
• /
• 2020

In this paper, we propose an optimization scheme for a k-Nearest Neighbor(k-NN) query, which finds k objects closest to the query in the high dimensional feature vectors. The k-NN query is converted and processed into a range query based on the range that is likely to contain k data. In this paper, we propose an optimization scheme using DNN model to derive an optimal range that can reduce processing cost and accelerate search speed. The entire system of the proposed scheme is composed of online and offline modules. In the online module, a query is actually processed when it is issued from a client. In the offline module, an optimal range is derived for the query by using the DNN model and is delivered to the online module. It is shown through various performance evaluations that the proposed scheme outperforms the existing schemes.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.3
• /
• pp.328-333
• /
• 2003

NGE (Nested Generalized Exemplars) proposed by Salzberg improved the storage requirement and classification rate of the Memory Based Reasoning. It constructs hyperrectangles during training and performs classification tasks. It worked not bad in many area, however, the major drawback of NGE is constructing hyperrectangles because its hyperrectangle is extended so as to cover the error data and the way of maintaining the feature weight vector. We proposed the OH (Optimizing Hyperrectangle) algorithm which use the feature weight vectors and the ED(Exemplar Densimeter) to optimize resulting Hyperrectangles. The proposed algorithm, as well as the EACH, required only approximately 40% of memory space that is needed in k-NN classifier, and showed a superior classification performance to the EACH. Also, by reducing the number of stored patterns, it showed excellent results in terms of classification when we compare it to the k-NN and the EACH.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2003.05a
• /
• pp.132-138
• /
• 2003

In order to evaluate properly ship motion relating to the berthing maneuver, the hydrodynamic forces acting on ship hull in berthing maneuver need to be estimated rightly. CFD has been employed for time-domain simulation of transient flow induced by Wigley model moving laterally from rest in shallow water. The numerical solutions successfully captured not only the characteristics of the transitional hydrodynamic forces but also some interesting features of the flow field around a berthing ship according to the water depth. In this paper, the consideration is carried out on the approximate formula based on the CFD results, which can estimate hydrodynamic forces especially lateral drag coefficient starting from the rest to the uniform movement.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.418-421
• /
• 2007

In this paper, we proposed a hierarchical nearest-neighbor searching method for deciding fitness of a clustered segment. It is difficult to distinguish the difference between correct spots and atypical noisy spots in footprint patterns. Therefore we could not completely remove unsuitable noisy spots from binarized image in image preprocessing stage or clustering stage. As a preprocessing stage for recognition of insect footprints, this method decides whether a segment is suitable or not, using degree of clustered segment fitness, and then unsuitable segments are eliminated from patterns. Removing unsuitable segments can improve performance of feature extraction for recognition of inset footprints.