애스크로AIPublic Preview
← 학술논문 검색
학술논문한국생산관리학회지2025.11 발행

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

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

유의기(동국대학교); 장철념(중국 하남성 푸양시 타이첸현 발전개혁위원회); 정욱(동국대학교)

36권 4호, 495~516쪽

초록

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.

Abstract

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.

발행기관:
한국생산관리학회
DOI:
http://dx.doi.org/10.32956/kopoms.2025.36.4.495
분류:
경영학

AI 법률 상담

이 논문의 주제에 대해 더 알고 싶으신가요?

460만+ 법률 자료에서 관련 판례·법령·해석례를 찾아 답변합니다

AI 상담 시작
Grid-based k-Nearest Neighbor Approach for Process Monitoring with Large Size Data | 한국생산관리학회지 2025 | AskLaw | 애스크로 AI