• The Korean Journal of Applied Statistics
• /
• v.23 no.6
• /
• pp.1093-1102
• /
• 2010

Even though the k-Nearest Neighbors Classification(KNNC) is one of the popular non-parametric classification methods, it does not consider the local features and class information for each observation. In order to overcome such limitations, several methods have been developed such as Adaptive Nearest Neighbors Classification(ANNC) and Modified k-Nearest Neighbors Classification(MKNNC). In this paper, we propose the Modified Adaptive Nearest Neighbors Classification(MANNC) that employs the advantages of both the ANNC and MKNNC. Through a real data analysis and a simulation study, we show that the proposed MANNC outperforms other methods in terms of classification accuracy.

• 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 Korean Statistical Society Conference
• /
• 2004.11a
• /
• pp.185-190
• /
• 2004

비모수적 결측치 대치 방법으로 널리 사용되는 k-nearest neighbors(KNN) 방법은 자료의 국소적(local) 특징을 고려하지 않고 전체 자료에 대해 균일한 이웃의 개수 k를 사용하는 단점이 있다. 본 연구에서는 KNN의 대안으로 자료의 국소적 특징을 고려하는 adaptive nearest neighbors(ANN) 방법을 제안하였다. 나아가 microarray 자료의 경우에 대하여 결측치 대치를 통해 KNN과 ANN의 성능을 비교하였다.

• The Korean Journal of Applied Statistics
• /
• v.28 no.1
• /
• pp.23-31
• /
• 2015

A conventional missing value problem in the statistical analysis k-Nearest Neighbor(KNN) method are used for a simple imputation method. When one of the k-nearest neighbors is an extreme value or outlier, the KNN method can create a bias. In this paper, we propose a Weighted k-Nearest Neighbors(WKNN) imputation method that can supplement KNN's faults. A Monte-Carlo simulation study is also adapted to compare the WKNN method and KNN method using real data set.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.7
• /
• pp.828-833
• /
• 2005

Kernel methods have shown to improve the performance of conventional linear classification algorithms for complex distributed data sets, as mapping the data in input space into a higher dimensional feature space(7). In this paper, we propose a fuzzy kernel K-nearest neighbor(fuzzy kernel K-NN) algorithm, which applies the distance measure in feature space based on kernel functions to the fuzzy K-nearest neighbor(fuzzy K-NN) algorithm. In doing so, the proposed algorithm can enhance the Performance of the conventional algorithm, by choosing an appropriate kernel function. Results on several data sets and segmentation results for real images are given to show the validity of our proposed algorithm.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.12 no.4
• /
• pp.300-307
• /
• 2012

When the volume of data grows big, some simple tasks could become a significant concern. Nearest neighbor search is such a task which finds from a data set the k nearest data points to queries. Locality-sensitive hashing techniques have been developed for approximate but fast nearest neighbor search. This paper introduces the notion of locality-sensitive hashing and surveys the locality-sensitive hashing techniques. It categories them based on several criteria, presents their characteristics, and compares their performance.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2002.12a
• /
• pp.271-274
• /
• 2002

본 논문은 (1)에 기술된 퍼지 K-nearest neighbor(NN) 알고리즘의 확장인 interval 제2종 퍼지 K-NN을 제안한다. 제안된 방법에서는, 각 패턴벡터의 멤버쉽 값들에 불확실성(Uncertainty)을 할당하는 것에 의해 interval 제2종 퍼지 멤버쉽으로의 확장을 시도한다. 이러한 확장은, K의 결정에 존재하는 불확실성은 다루고, 조정할 수 있게 한다.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2005.04a
• /
• pp.367-369
• /
• 2005

현대인들이 계속 쏟아지는 정보로부터 자신에게 필요한 정보만을 제한된 시간 안에 검색하는 일은 쉬운 일이 아니다. 컴퓨터를 이용하여 제한된 시간 내에 원하는 정보를 검색하고자 하는 정보검색 분야에서는 성능을 향상시키기 위한 연구가 활발히 진행되어 오고 있다. 본 논문에서는 정보검색 시스템의 성능을 향상시키고자 퍼지 K-Nearest Neighbor에 의한 정보검색시스템(IRS-FKNN: Information Retrieval System using Fuzzy K-Nearest Neighbor)을 제안한다. 제안하는 시스템은 기존의 시스템과 비교했을 때 검색결과의 신뢰성을 높이게 되어 시스템의 성능을 향상시키게 되었다.

• The Korean Journal of Applied Statistics
• /
• v.22 no.3
• /
• pp.479-488
• /
• 2009

The ${\kappa}$-Nearest Neighbors Classification(KNNC) is a popular non-parametric classification method which assigns a fixed number ${\kappa}$ of neighbors to every observation without consideration of the local feature of the each observation. In this paper, we propose an Adaptive Nearest Neighbors Classification(ANNC) as an alternative to KNNC. The proposed ANNC method adapts the number of neighbors according to the local feature of the observation such as density of data. To verify characteristics of ANNC, we compare the number of misclassified observation with KNNC by Monte Carlo study and confirm the potential performance of ANNC method.