• ETRI Journal
• /
• v.40 no.4
• /
• pp.531-536
• /
• 2018

The weighted K-nearest neighbor (WKNN) algorithm is used to reduce positioning accuracy, as it uses a fixed number of neighbors to estimate the position. In this paper, we propose a dynamic threshold location algorithm (DH-KNN) to improve positioning accuracy. The proposed algorithm is designed based on a dynamic threshold to determine the number of neighbors and filter out singular reference points (RPs). We compare its performance with the WKNN and Enhanced K-Nearest Neighbor (EKNN) algorithms in test spaces of networks with dimensions of $20m{\times}20m$, $30m{\times}30m$, $40m{\times}40m$ and $50m{\times}50m$. Simulation results show that the maximum position accuracy of DH-KNN improves by 31.1%, and its maximum position error decreases by 23.5%. The results demonstrate that our proposed method achieves better performance than other well-known algorithms.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.1
• /
• pp.129-134
• /
• 2018

Research on the technique for estimating the indoor position has been actively carried out. In particular, the WiFi fingerprint method, which does not require any additional infrastructure, is being partially used because of its high economic efficiency. The KNN method which estimates similar points to the corresponding points by comparing intensity information of the WLAN reception signal measured at various points in advance with intensity information measured at a specific point in the future is simple but has a good performance. However, in the conventional KNN scheme, since the number K of average candidate positions is constant, there is a problem that the position estimation error is not optimized according to a specific point. In this paper, we proposed an algorithm that adaptively changes the K value for each point and applied it to experimental data and evaluated its performance.

• The Journal of the Acoustical Society of Korea
• /
• v.23 no.3
• /
• pp.235-241
• /
• 2004

This paper studied the pattern recognition algorithm and feature parameters for speaker and context independent emotion recognition. In this paper, KNN algorithm was used as the pattern matching technique for comparison, and also VQ and GMM were used for speaker and context independent recognition. The speech parameters used as the feature are pitch. energy, MFCC and their first and second derivatives. Experimental results showed that emotion recognizer using MFCC and its derivatives showed better performance than that using the pitch and energy parameters. For pattern recognition algorithm. GMM-based emotion recognizer was superior to KNN and VQ-based recognizer.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2463-2466
• /
• 2003

This paper studied the pattern recognition algorithm and feature parameters for emotion recognition. In this paper, KNN algorithm was used as the pattern matching technique for comparison, and also VQ and GMM were used lot speaker and context independent recognition. The speech parameters used as the feature are pitch, energy, MFCC and their first and second derivatives. Experimental results showed that emotion recognizer using MFCC and their derivatives as a feature showed better performance than that using the Pitch and energy Parameters. For pattern recognition algorithm, GMM based emotion recognizer was superior to KNN and VQ based recognizer

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.4 s.304
• /
• pp.43-50
• /
• 2005

This paper proposes a new pattern recognition system combining the new adaptive feature weighting based on the genetic algorithm and the modified KNN(K Nearest-Neighbor) rules. The new feature weighting proposed herein avoids the overfitting and finds the Proper feature weighting value by determining the middle value of weights using GA. New GA operators are introduced to obtain the high performance of the system. Moreover, a class dependent feature weighting strategy is employed. Whilst the classical methods use the same feature space for all classes, the Proposed method uses a different feature space for each class. The KNN rule is modified to estimate the class of test pattern using adaptive feature space. Experiments were performed with the unconstrained handwritten numeral database of Concordia University in Canada to show the performance of the proposed method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.5
• /
• pp.495-507
• /
• 2019

Data sparsity is one of the main challenges for the recommender system. The recommender system contains massive data in which only a small part is the observed data and the others are missing data. Most studies assume that missing data is randomly missing from the dataset. Therefore, they only use observed data to train recommendation model, then recommend items to users. In actual case, however, missing data do not lost randomly. In our research, treat these missing data as negative examples of users' interest. Three sample methods are seamlessly integrated into SVD++ algorithm and then propose SVD++_W, SVD++_R and SVD++_KNN algorithm. Experimental results show that proposed sample methods effectively improve the precision in Top-N recommendation over the baseline algorithms. Among the three improved algorithms, SVD++_KNN has the best performance, which shows that the KNN sample method is a more effective way to extract the negative examples of the users' interest.

• Journal of Multimedia Information System
• /
• v.5 no.2
• /
• pp.67-78
• /
• 2018

This article proposes the modified KNN (K Nearest Neighbor) algorithm which considers the feature similarity and is applied to the word categorization. The texts which are given as features for encoding words into numerical vectors are semantic related entities, rather than independent ones, and the synergy effect between the word categorization and the text categorization is expected by combining both of them with each other. In this research, we define the similarity metric between two vectors, including the feature similarity, modify the KNN algorithm by replacing the exiting similarity metric by the proposed one, and apply it to the word categorization. The proposed KNN is empirically validated as the better approach in categorizing words in news articles and opinions. The significance of this research is to improve the classification performance by utilizing the feature similarities.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.602-605
• /
• 2011

현재 측위에 대한 측정 대상이 점점 작아지면서, 그에 따른 정확도 까지 높아지고 있다. 실내 측위에 관한 기술은 대표적으로 단말기의 수신신호의 세기방식인 RSS(Received Signal Strength), 수신신호의 도달시간 방식 TOA(Time of Arrival), 수신 신호의 도달 시간차 방식 TDOA(Time Difference of Arrival), 수신신호의 입사각 방식인 AOA(Angle of Arrival) 등 여러 가지 기술이 활발히 진행되고 있다. 본 논문은 특수 장비를 사용하지 않고, 무선 네트워크 기반의 실내 측위 중에 정확도가 높은 Fingerprinting 방법을 택하였다. WLAN 기반 실내측위에 가장 많이 사용되는 KNN은 k개의 이웃수와 RP의 수에 따라 민감하다. 본 논문에서는 KNN 성능을 향상 시키기 위해 SVM 이용하여 SNR 데이터를 군집화를 적용한 KNN과 SVM을 혼합한 알고리즘을 제안하였다. 제안한 알고리즘은 신호잡음비 데이터를 KNN 방법에 적용하여 k개의 RP를 선택한 후 선택된 RP의 신호잡음비를 SVM에 적용하여 k개의 RP를 군집하여 분류한다. 실험 결과 위치 오차가 2m이내에 KNN/SVM 혼합 알고리즘이 KNN 알고리즘보다 성능이 우수하다.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.3
• /
• pp.55-62
• /
• 2009

Location based Services in the ubiquitous computing environment, namely u-LBS, use very large and skewed spatial objects that are closely related to locational information. It is especially essential to achieve fast search, which is looking for POI(Point of Interest) related to the location of users. This paper examines how to search large and skewed POI efficiently in the u-LBS environment. We propose the Dynamic-level Grid based R-Tree(DGR-Tree), which is an index for point data that can reduce the cost of stationary POI search. DGR-Tree uses both R-Tree as a primary index and Dynamic-level Grid as a secondary index. DGR-Tree is optimized to be suitable for point data and solves the overlapping problem among leaf nodes. Dynamic-level Grid of DGR-Tree is created dynamically according to the density of POI. Each cell in Dynamic-level Grid has a leaf node pointer for direct access with the leaf node of the primary index. Therefore, the index access performance is improved greatly by accessing the leaf node directly through Dynamic-level Grid. We also propose a K-Nearest Neighbor(KNN) algorithm for DGR-Tree, which utilizes Dynamic-level Grid for fast access to candidate cells. The KNN algorithm for DGR-Tree provides the mechanism, which can access directly to cells enclosing given query point and adjacent cells without tree traversal. The KNN algorithm minimizes sorting cost about candidate lists with minimum distance and provides NEB(Non Extensible Boundary), which need not consider the extension of candidate nodes for KNN search.

• International Journal of Computer Science & Network Security
• /
• v.21 no.2
• /
• pp.120-130
• /
• 2021

The spinal cord or CSF surgery is a very complex process. It requires continuous pre and post-surgery evaluation to have a better ability to diagnose the disease. To detect automatically the suspected areas of tumors and symptoms of CSF leakage during the development of the tumor inside of the brain. We propose a new method based on using computer software that generates statistical results through data gathered during surgeries and operations. We performed statistical computation and data collection through the Google Source for the UK National Cancer Database. The purpose of this study is to address the above problems related to the accuracy of missing hybrid KNN values and finding the distance of tumor in terms of brain cancer or CSF images. This research aims to create a framework that can classify the damaged area of cancer or tumors using high-dimensional image segmentation and Laplace transformation method. A high-dimensional image segmentation method is implemented by software modelling techniques with measures the width, percentage, and size of cells within the brain, as well as enhance the efficiency of the hybrid KNN algorithm and Laplace transformation make it deal the non-zero values in terms of missing values form with the using of Frobenius Matrix for deal the space into non-zero values. Our proposed algorithm takes the longest values of KNN (K = 1-100), which is successfully demonstrated in a 4-dimensional modulation method that monitors the lighting field that can be used in the field of light emission. Conclusion: This approach dramatically improves the efficiency of hybrid KNN method and the detection of tumor region using 4-D segmentation method. The simulation results verified the performance of the proposed method is improved by 92% sensitivity of 60% specificity and 70.50% accuracy respectively.