scholarly journals An Improved Weighted K-Nearest Neighbor Algorithm for Indoor Localization

Electronics ◽  
2020 ◽  
Vol 9 (12) ◽  
pp. 2117
Author(s):  
Xuesheng Peng ◽  
Ruizhi Chen ◽  
Kegen Yu ◽  
Feng Ye ◽  
Weixing Xue

The weighted K-nearest neighbor (WKNN) algorithm is the most commonly used algorithm for indoor localization. Traditional WKNN algorithms adopt received signal strength (RSS) spatial distance (usually Euclidean distance and Manhattan distance) to select reference points (RPs) for position determination. It may lead to inaccurate position estimation because the relationship of received signal strength and distance is exponential. To improve the position accuracy, this paper proposes an improved weighted K-nearest neighbor algorithm. The spatial distance and physical distance of RSS are used for RP selection, and a fusion weighted algorithm based on these two distances is used for position calculation. The experimental results demonstrate that the proposed algorithm outperforms traditional algorithms, such as K-nearest neighbor (KNN), Euclidean distance-based WKNN (E-WKNN), and physical distance-based WKNN (P-WKNN). Compared with the KNN, E-WKNN, and P-WKNN algorithms, the positioning accuracy of the proposed method is improved by about 29.4%, 23.5%, and 20.7%, respectively. Compared with some recently improved WKNN algorithms, our proposed algorithm can also obtain a better positioning performance.

Sensors ◽  
2020 ◽  
Vol 20 (4) ◽  
pp. 1067 ◽  
Author(s):  
Chenbin Zhang ◽  
Ningning Qin ◽  
Yanbo Xue ◽  
Le Yang

Commercial interests in indoor localization have been increasing in the past decade. The success of many applications relies at least partially on indoor localization that is expected to provide reliable indoor position information. Wi-Fi received signal strength (RSS)-based indoor localization techniques have attracted extensive attentions because Wi-Fi access points (APs) are widely deployed and we can obtain the Wi-Fi RSS measurements without extra hardware cost. In this paper, we propose a hierarchical classification-based method as a new solution to the indoor localization problem. Within the developed approach, we first adopt an improved K-Means clustering algorithm to divide the area of interest into several zones and they are allowed to overlap with one another to improve the generalization capability of the following indoor positioning process. To find the localization result, the K-Nearest Neighbor (KNN) algorithm and support vector machine (SVM) with the one-versus-one strategy are employed. The proposed method is implemented on a tablet, and its performance is evaluated in real-world environments. Experiment results reveal that the proposed method offers an improvement of 1.4% to 3.2% in terms of position classification accuracy and a reduction of 10% to 22% in terms of average positioning error compared with several benchmark methods.


Author(s):  
Vijay Muralidharan ◽  
Pravien M. ◽  
Janani Balaji

Abstract—The examination results have become an integral part of every student’s life. The educational institution’s ranking is greatly influenced by the university results. This paper mainly focuses on the prediction of a student’s university result by making use of different attributes. These attributes might be of quantitative and qualitative type. The quantitative attributes used are Internal Assessments, Attendance percentage, Number of On-Duties taken and Overall Assignments completed. The qualitative attributes include Subject feedback, Faculty feedback, and whether the student is a Day Scholar/Hosteller. Here, we make use of k-Nearest Neighbor algorithm (or k-NN for short) against the historical data of students for more accurate prediction of results. In this method all the attributes considered are converted to the same scale. This algorithm makes use of the Euclidean distance formula which is used to find the nearest record. This algorithm predicts better results which help students maximize their academic output.


2018 ◽  
Author(s):  
I Wayan Agus Surya Darma

Balinese character recognition is a technique to recognize feature or pattern of Balinese character. Feature of Balinese character is generated through feature extraction process. This research using handwritten Balinese character. Feature extraction is a process to obtain the feature of character. In this research, feature extraction process generated semantic and direction feature of handwritten Balinese character. Recognition is using K-Nearest Neighbor algorithm to recognize 81 handwritten Balinese character. The feature of Balinese character images tester are compared with reference features. Result of the recognition system with K=3 and reference=10 is achieved a success rate of 97,53%.


Sign in / Sign up

Export Citation Format

Share Document