• Title/Summary/Keyword: KNN

Search Result 239, Processing Time 0.031 seconds

Optimized KNN/IFCM Algorithm for Efficient Indoor Location (효율적인 실내 측위를 위한 최적화된 KNN/IFCM 알고리즘)

  • Lee, Jang-Jae;Song, Lick-Ho;Kim, Jong-Hwa;Lee, Seong-Ro
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.48 no.2
    • /
    • pp.125-133
    • /
    • 2011
  • For any pattern matching based algorithm in WLAN environment, the characteristics of signal to noise ratio(SNR) to multiple access points(APs) are utilized to establish database in the training phase, and in the estimation phase, the actual two dimensional coordinates of mobile unit(MU) are estimated based on the comparison between the new recorded SNR and fingerprints stored in database. As fingerprinting method, k-nearest neighbor(KNN) has been widely applied for indoor location in wireless location area networks(WLAN), but its performance is sensitive to number of neighbors k and positions of reference points(RPs). So intuitive fuzzy c-means(IFCM) clustering algorithm is applied to improve KNN, which is the KNN/IFCM hybrid algorithm presented in this paper. In the proposed algorithm, through KNN, k RPs are firstly chosen as the data samples of IFCM based on signal to noise ratio(SNR). Then, the k RPs are classified into different clusters through IFCM based on SNR. Experimental results indicate that the proposed KNN/IFCM hybrid algorithm generally outperforms KNN, KNN/FCM, KNN/PFCM algorithm when the locations error is less than 2m.

KNN/PFCM Hybrid Algorithm for Indoor Location Determination in WLAN (WLAN 실내 측위 결정을 위한 KNN/PFCM Hybrid 알고리즘)

  • Lee, Jang-Jae;Jung, Min-A;Lee, Seong-Ro
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.6
    • /
    • pp.146-153
    • /
    • 2010
  • For the indoor location, wireless fingerprinting is most favorable because fingerprinting is most accurate among the technique for wireless network based indoor location which does not require any special equipments dedicated for positioning. As fingerprinting method,k-nearest neighbor(KNN) has been widely applied for indoor location in wireless location area networks(WLAN), but its performance is sensitive to number of neighborsk and positions of reference points(RPs). So possibilistic fuzzy c-means(PFCM) clustering algorithm is applied to improve KNN, which is the KNN/PFCM hybrid algorithm presented in this paper. In the proposed algorithm, through KNN,k RPs are firstly chosen as the data samples of PFCM based on signal to noise ratio(SNR). Then, thek RPs are classified into different clusters through PFCM based on SNR. Experimental results indicate that the proposed KNN/PFCM hybrid algorithm generally outperforms KNN and KNN/FCM algorithm when the locations error is less than 2m.

KNN/ANN Hybrid Location Determination Algorithm for Indoor Location Base Service (실내 위치기반서비스를 위한 KNN/ANN Hybrid 측위 결정 알고리즘)

  • Lee, Jang-Jae;Jung, Min-A;Lee, Seong-Ro;Song, Iick-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.48 no.2
    • /
    • pp.109-115
    • /
    • 2011
  • As fingerprinting method, k-nearest neighbor(KNN) has been widely applied for indoor location in wireless location area networks(WLAN), but its performance is sensitive to number of neighbors k and positions of reference points(RPs). So artificial neural network(ANN) clustering algorithm is applied to improve KNN, which is the KNN/ANN hybrid algorithm presented in this paper. For any pattern matching based algorithm in WLAN environment, the characteristics of signal to noise ratio(SNR) to multiple access points(APs) are utilized to establish database in the training phase, and in the estimation phase, the actual two dimensional coordinates of mobile unit(MU) are estimated based on the comparison between the new recorded SNR and fingerprints stored in database. In the proposed algorithm, through KNN, k RPs are firstly chosen as the data samples of ANN based on SNR. Then, the k RPs are classified into different clusters through ANN based on SNR. Experimental results indicate that the proposed KNN/ANN hybrid algorithm generally outperforms KNN algorithm when the locations error is less than 2m.

KNN / ANN Hybrid algorithm Using indoor positioning Method (KNN/ANN Hybrid 알고리즘을 활용한 실내위치 측위 기법)

  • Kim, Beom-mu;Thapa, Prakash;Paudel, Prebesh;Jeong, Min-A;Lee, Seong-Ro
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2015.10a
    • /
    • pp.1205-1207
    • /
    • 2015
  • Fingerprinting 방식에서 KNN은 WLAN 기반 실내 측위에 가장 많이 적용되고 있지만 KNN의 성능은 k개의 이웃 수와 RP의 수에 따라 민감하다. 논문에서는 KNN 성능을 향상시키기 위해 ANN 군집화를 적용한 KNN과 ANN을 혼합한 알고리즘을 제안하였다. 제안한 알고리즘은 신호잡음비 데이터를 KNN 방법에 적용하여 k개의 RP을 선택한 후 선택된 RP의 신호잡음비를 ANN에 적용하여 k개의 RP를 군집하여 분류한다. 실험 결과에서는 위치 오차가 2m 이내에서 KNN/ANN 알고리즘이 KNN 알고리즘보다 성능이 우수하다.

KNN/PFCM Hybrid Algorithm for Indoor Location Determination in WLAN (WLAN 실내 측위 결정을 위한 KNN/PFCM Hybrid 알고리즘)

  • Kim, Kyoung-Soung;Lee, Jang-Jae;Oh, Il-Whan;Lee, Yeonwoo;Jung, Min-A;Lee, Seong-Ro
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2010.11a
    • /
    • pp.1708-1710
    • /
    • 2010
  • 무선 네트워크 기반 실내 측위는 측위를 위한 특수 장비를 필요로 하지 않고, Fingerprinting 방식은 무선네트워크 기반 측위를 위한 기술 중에서 가장 정확도가 높기 때문에 무선 네트워크 Fingerprinting 방식이 가장 적당한 실내 측위 방법이다. Fingerprinting 방식에서 KNN은 WLAN 기반 실내 측위에 가장 많이 적용되고 있지만 KNN의 성능은 k개의 이웃 수와 RP의 수에 따라 민감하다. 논문에서는 KNN 성능을 향상시키기 위해 PFCM 군집화를 적용한 KNN과 PFCM을 혼합한 알고리즘을 제안하였다. 제안한 알고리즘은 신호잡음비 데이터를 KNN 방법에 적용하여 k개의 RP를 선택한 후 선택된 RP의 신호잡음비를 PFCM에 적용하여 k개의 RP를 군집하여 분류한다. 실험 결과에서는 위치 오차가 2m 이내에서 KNN/PFCM 알고리즘이 KNN과 KNN/FCM 알고리즘보다 성능이 우수하다.

Improvement of location positioning using KNN, Local Map Classification and Bayes Filter for indoor location recognition system

  • Oh, Seung-Hoon;Maeng, Ju-Hyun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.26 no.6
    • /
    • pp.29-35
    • /
    • 2021
  • In this paper, we propose a method that combines KNN(K-Nearest Neighbor), Local Map Classification and Bayes Filter as a way to increase the accuracy of location positioning. First, in this technique, Local Map Classification divides the actual map into several clusters, and then classifies the clusters by KNN. And posterior probability is calculated through the probability of each cluster acquired by Bayes Filter. With this posterior probability, the cluster where the robot is located is searched. For performance evaluation, the results of location positioning obtained by applying KNN, Local Map Classification, and Bayes Filter were analyzed. As a result of the analysis, it was confirmed that even if the RSSI signal changes, the location information is fixed to one cluster, and the accuracy of location positioning increases.

Interference Elimination Method of Ultrasonic Sensors Using K-Nearest Neighbor Algorithm (KNN 알고리즘을 활용한 초음파 센서 간 간섭 제거 기법)

  • Im, Hyungchul;Lee, Seongsoo
    • Journal of IKEEE
    • /
    • v.26 no.2
    • /
    • pp.169-175
    • /
    • 2022
  • This paper introduces an interference elimination method using k-nearest neighbor (KNN) algorithm for precise distance estimation by reducing interference between ultrasonic sensors. Conventional methods compare current distance measurement result with previous distance measurement results. If the difference exceeds some thresholds, conventional methods recognize them as interference and exclude them, but they often suffer from imprecise distance prediction. KNN algorithm classifies input values measured by multiple ultrasonic sensors and predicts high accuracy outputs. Experiments of distance measurements are conducted where interference frequently occurs by multiple ultrasound sensors of same type, and the results show that KNN algorithm significantly reduce distance prediction errors. Also the results show that the prediction performance of KNN algorithm is superior to conventional voting methods.

On the Use of Weighted k-Nearest Neighbors for Missing Value Imputation (Weighted k-Nearest Neighbors를 이용한 결측치 대치)

  • Lim, Chanhui;Kim, Dongjae
    • 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.

Manufacture and Surface Structure Characteristics of Mn-Doped (K, Na)NbO3 Films

  • Kim, Yeon Jung;Byun, Jaeduk;Hyun, June Won
    • Journal of the Korean institute of surface engineering
    • /
    • v.54 no.1
    • /
    • pp.18-24
    • /
    • 2021
  • KNN is widely used in the electronic industry such as memory devices, sensors, and capacitors due to various structural, electrical, and eco-friendly properties. In this study, Mn-doped KNN was prepared by adopting a sol-gel method with advantages of low cost and large area thin film fabrication. The Mn-doped KNN thin films were deposited by annealing in air for 1 hour and 700℃. The surface morphology characteristics and grain size of the heat-treated KNN were observed by SEM and AFM, and we used the X-ray diffraction for measuring the crystal phase of KNN. The XRD analysis results show that the fabrication of (K0.5Na0.5)(Nb1-xMnn)O3 thin films by sol-gel method in the thin film process of this experiment was stable in the perovskite phase of c-axis orientation. The SEM and AFM results show that the cracks were not confirmed from the fracture surface data of KNN thin films and were densely deposited with thin films with uniform thickness.

A Comparative Study on Category Assignment Methods of a KNN Classifier (KNN 분류기의 범주할당 방법 비교 실험)

  • 이영숙;정영미
    • Proceedings of the Korean Society for Information Management Conference
    • /
    • 2000.08a
    • /
    • pp.37-40
    • /
    • 2000
  • KNN(K-Neatest Neighbors)을 사용한 문서의 자동분류에서는 새로운 입력문서에 범주를 할당하기 위해 K개의 유사문서로부터 범주별 문서의 분류빈도나 유사도를 이용한다. 본 연구에서는 KNN 기법에서 보편적으로 사용되는 범주 할당 방법을 응용하여 K개 유사문서 중 최상위 및 상위 M개 문서에 가중치를 부여하는 방법들을 고안하였고 K값의 변화에 따른 이들의 성능을 비교해 보았다.

  • PDF