Grid-based k-Nearest Neighbor Approach for Process Monitoring with Large Size Data

대용량 데이터 공정 모니터링을 위한 격자 기반 k-최근접 이웃 기법

초록

This paper presents an algorithmic approach that integrates data mining principles with control chart techniques to detect deviations from standard values within a multivariate dataset. Recently, research has focused on methods for calculating outlier scores based on the k-nearest neighbors (kNN) paradigm. However, the practical utility of kNN-based methods is limited due to the computational complexities inherent in the kNN algorithm, which restrict its applicability to large datasets. The main aim of this research is to propose a new control chart framework that utilizes a grid-based kNN algorithm to reduce the computational effort involved in identifying the k nearest neighbors. To validate the effectiveness of this methodological innovation, extensive experiments were conducted in various experimental settings. The empirical results from these experiments demonstrate significant efficiency gains, as the proposed method considerably reduces the computation time required for analysis while maintaining a level of precision and reliability that is both predictable and acceptable in the context of anomaly detection and control charting.

키워드

Statistical Process ControlAnomaly ScoresK-nearest NeighborGrid-based Algorithm
제목
Grid-based k-Nearest Neighbor Approach for Process Monitoring with Large Size Data
제목 (타언어)
대용량 데이터 공정 모니터링을 위한 격자 기반 k-최근접 이웃 기법
저자
유의기장철념정욱
DOI
10.32956/kopoms.2025.36.4.495
발행일
2025-11
유형
Y
저널명
한국생산관리학회지
36
4
페이지
495 ~ 516