• 제목/요약/키워드: K-nearest neighbor classification

검색결과 182건 처리시간 0.02초

Detection and Classification of Bearing Flaking Defects by Using Kullback Discrimination Information (KDI)

  • Kim, Tae-Gu;Takabumi Fukuda;Hisaji Shimizu
    • International Journal of Safety
    • /
    • 제1권1호
    • /
    • pp.28-35
    • /
    • 2002
  • Kullback Discrimination Information (KDI) is one of the pattern recognition methods. KDI defined as a measure of the mutual dissimilarity computed between two time series was studied for detection and classification of bearing flaking on outer-race and inner-races. To model the damages, the bearings in normal condition, outer-race flaking condition and inner-races flaking condition were provided. The vibration sensor was attached by the bearing housing. This produced the total 25 pieces of data each condition, and we chose the standard data and measure of distance between standard and tested data. It is difficult to detect the flaking because similar pulses come out when balls pass the defection point. The detection and classification method for inner and outer races are defected by KDI and nearest neighbor classification rule is proposed and its high performance is also shown.

A Low Complexity PTS Technique using Threshold for PAPR Reduction in OFDM Systems

  • Lim, Dai Hwan;Rhee, Byung Ho
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제6권9호
    • /
    • pp.2191-2201
    • /
    • 2012
  • Traffic classification seeks to assign packet flows to an appropriate quality of service (QoS) class based on flow statistics without the need to examine packet payloads. Classification proceeds in two steps. Classification rules are first built by analyzing traffic traces, and then the classification rules are evaluated using test data. In this paper, we use self-organizing map and K-means clustering as unsupervised machine learning methods to identify the inherent classes in traffic traces. Three clusters were discovered, corresponding to transactional, bulk data transfer, and interactive applications. The K-nearest neighbor classifier was found to be highly accurate for the traffic data and significantly better compared to a minimum mean distance classifier.

기어의 이상검지 및 진단에 관한 연구 -Wavelet Transform해석과 KDI의 비교- (A Study on Fault Detection and Diagnosis of Gear Damages - A Comparison between Wavelet Transform Analysis and Kullback Discrimination Information -)

  • 김태구;김광일
    • 한국안전학회지
    • /
    • 제15권2호
    • /
    • pp.1-7
    • /
    • 2000
  • This paper presents the approach involving fault detection and diagnosis of gears using pattern recognition and Wavelet transform. It describes result of the comparison between KDI (Kullback Discrimination Information) with the nearest neighbor classification rule as one of pattern recognition methods and Wavelet transform to know a way to detect and diagnosis of gear damages experimentally. To model the damages 1) Normal (no defect), 2) one tooth is worn out, 3) All teeth faces are worn out 4) One tooth is broken. The vibration sensor was attached on the bearing housing. This produced the total time history data that is 20 pieces of each condition. We chose the standard data and measure distance between standard and tested data. In Wavelet transform analysis method, the time series data of magnitude in specified frequency (rotary and mesh frequency) were earned. As a result, the monitoring system using Wavelet transform method and KDI with nearest neighbor classification rule successfully detected and classified the damages from the experimental data.

  • PDF

Adaptive Nearest Neighbors를 활용한 판별분류방법 (Adaptive Nearest Neighbors for Classification)

  • 전명식;최인경
    • 응용통계연구
    • /
    • 제22권3호
    • /
    • pp.479-488
    • /
    • 2009
  • 비모수적 판별분류방법으로 널리 사용되는 ${\kappa}$-Nearest Neighbors Classification(KNNC) 방법은 자료의 국소적 특징을 고려하지 않고 전체 자료에 대해 고정된 이웃의 개수 ${\kappa}$를 사용하여 개체를 분류하는 방법이다. 본 연구에서는 KNNC의 대안으로 자료의 국소적 특징을 고려하는 Adaptive Nearest Neighbors Classificaion(ANNC) 방법을 제안하였다. 제안된 방법의 특징을 규명하기 위하여 실제 자료에 대한 분석을 통하여 제안된 방법의 응용 가능성을 제시하였으며, 나아가 모의실험을 통하여 기존의 방법과의 효율성을 비교하였다.

Cross platform classification of microarrays by rank comparison

  • Lee, Sunho
    • Journal of the Korean Data and Information Science Society
    • /
    • 제26권2호
    • /
    • pp.475-486
    • /
    • 2015
  • Mining the microarray data accumulated in the public data repositories can save experimental cost and time and provide valuable biomedical information. Big data analysis pooling multiple data sets increases statistical power, improves the reliability of the results, and reduces the specific bias of the individual study. However, integrating several data sets from different studies is needed to deal with many problems. In this study, I limited the focus to the cross platform classification that the platform of a testing sample is different from the platform of a training set, and suggested a simple classification method based on rank. This method is compared with the diagonal linear discriminant analysis, k nearest neighbor method and support vector machine using the cross platform real example data sets of two cancers.

GAVaPS를 이용한 다수 K-Nearest Neighbor classifier들의 Feature 선택 (Feature Selection for Multiple K-Nearest Neighbor classifiers using GAVaPS)

  • 이희성;이제헌;김은태
    • 한국지능시스템학회논문지
    • /
    • 제18권6호
    • /
    • pp.871-875
    • /
    • 2008
  • 본 논문은 개체 변환 유전자 알고리즘을 (GAVaPS) 이용하여 k-nearest neighbor (k-NN) 분류기에서 사용되는 특징들을 선정하는 방법을 제시한다. 우리는 다수의 k-NN 분류기들을 사용하기 때문에 사용되는 특징들을 선정하는 문제는 매우 탐색 영역이 크고 해결하기 어려운 문제이다. 따라서 우리는 효과적인 특징득의 선정을 위해 일반적인 유전자 알고리즘 (GA) 보다 효율적이라고 알려진 개체군 변환 유전자 알고리즘을 사용한다. 또한 다수 k-NN 분류기를 개체군 변환 유전자 알고리즘으로 효과적으로 결합하는 방법을 제시한다. 제안하는 알고리즘의 우수성을 여러 실험을 통해 보여준다.

k-Nearest Neighbors 분류기를 이용한 복합 지표 산불피해 영역 탐지 (Mapping Burned Forests Using a k-Nearest Neighbors Classifier in Complex Land Cover)

  • 이한나;윤공현;김기홍
    • 대한토목학회논문집
    • /
    • 제43권6호
    • /
    • pp.883-896
    • /
    • 2023
  • 인간 활동 영역이 산지 곳곳에 퍼져 있는 한국에서는 산불이 주거지역이나 각종 시설물을 위협하는 경우가 잦다. 따라서 산불 이후 대책 마련과 피해 복구를 위해 피해 범위를 빠르게 파악할 필요가 있으며, 이러한 경우 원격탐사가 유용한 도구가 될 수 있다. 본 연구에서는 2019년 4월에 발생한 고성·속초 산불 피해지역에 k-nearest neighbor (kNN) 알고리즘을 적용하여 피해 범위를 탐지하는 실험을 수행하였다. 다양한 인공지물을 포함하는 지표와 숲이 혼재된 지역 특성을 고려하여 적절한 공간 해상도와 시간 해상도를 제공하는 Sentinel-2 multispectral instrument (MSI) 자료를 사용하였다. Sentinel-2 MSI의 여섯 밴드와 정규식생지수(NDVI), 정규탄화지수(NBR)를 분류 특성으로 사용하였다. 산불 피해지역과 비피해 지역에서 무작위로 추출된 2,000개 지점 정보를 이용하여 kNN 분류기를 훈련시켰다. 분류 성능을 높이기 위해 데이터에서 특이값을 제거하고 임상도를 병용하였다. 다양한 이웃(neighbor) 수와 분류 특성 조합을 적용하여 산불 후 데이터를 이용한 실험과 산불 전후 데이터 차이를 이용한 실험을 수행하였다. 산불 전후 데이터 차이를 이용하였을 때 더 우수한 분류 성과를 얻을 수 있었지만, 산불 후 데이터만을 이용한 경우에도 피해지역의 범위를 파악할 수 있었다.

An Approach of Dimension Reduction in k-Nearest Neighbor Based Short-term Load Forecasting

  • Chu, FaZheng;Jung, Sung-Hwan
    • 한국멀티미디어학회논문지
    • /
    • 제20권9호
    • /
    • pp.1567-1573
    • /
    • 2017
  • The k-nearest neighbor (k-NN) algorithm is one of the most widely used benchmark algorithm in classification. Nowadays it has been further applied to predict time series. However, one of the main concerns of the algorithm applied on short-term electricity load forecasting is high computational burden. In the paper, we propose an approach of dimension reduction that follows the principles of highlighting the temperature effect on electricity load data series. The results show the proposed approach is able to reduce the dimension of the data around 30%. Moreover, with temperature effect highlighting, the approach will contribute to finding similar days accurately, and then raise forecasting accuracy slightly.

Fuzzy Learning Vector Quantization based on Fuzzy k-Nearest Neighbor Prototypes

  • Roh, Seok-Beom;Jeong, Ji-Won;Ahn, Tae-Chon
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제11권2호
    • /
    • pp.84-88
    • /
    • 2011
  • In this paper, a new competition strategy for learning vector quantization is proposed. The simple competitive strategy used for learning vector quantization moves the winning prototype which is the closest to the newly given data pattern. We propose a new learning strategy based on k-nearest neighbor prototypes as the winning prototypes. The selection of several prototypes as the winning prototypes guarantees that the updating process occurs more frequently. The design is illustrated with the aid of numeric examples that provide a detailed insight into the performance of the proposed learning strategy.

k-최근접 이웃 알고리즘을 이용한 원공결함을 갖는 유한 폭 판재의 음향방출 음원분류에 대한 연구 (Acoustic Emission Source Classification of Finite-width Plate with a Circular Hole Defect using k-Nearest Neighbor Algorithm)

  • 이장규;오진수
    • 대한안전경영과학회지
    • /
    • 제11권1호
    • /
    • pp.27-33
    • /
    • 2009
  • A study of fracture to material is getting interest in nuclear and aerospace industry as a viewpoint of safety. Acoustic emission (AE) is a non-destructive testing and new technology to evaluate safety on structures. In previous research continuously, all tensile tests on the pre-defected coupons were performed using the universal testing machine, which machine crosshead was move at a constant speed of 5mm/min. This study is to evaluate an AE source characterization of SM45C steel by using k-nearest neighbor classifier, k-NNC. For this, we used K-means clustering as an unsupervised learning method for obtained multi -variate AE main data sets, and we applied k-NNC as a supervised learning pattern recognition algorithm for obtained multi-variate AE working data sets. As a result, the criteria of Wilk's $\lambda$, D&B(Rij) & Tou are discussed.