Adaptive K-nearest Neighbor Algorithm Research Articles

An Improved K-Nearest Neighbor Algorithm for Pattern Classification

This paper proposed a “Locally Adaptive K-Nearest Neighbor (LAKNN) algorithm” for pattern exploration problem to enhance the obscenity of dimensionality. To compute neighborhood local linear discriminant analysis is an effective metric which determines the local decision boundaries from centroid information. KNN is a novel approach which uses in many classifications problem of data mining and machine learning. KNN uses class conditional probabilities for unfamiliar pattern. For limited training data in high dimensional feature space this hypothesis is unacceptable due to disfigurement of high dimensionality. To normalize the feature value of dissimilar metrics, Standard Euclidean Distance is used in KNN which s misguide to find a proper subset of nearest points of the pattern to be predicted. To overcome the effect of high dimensionality LANN uses a new variant of Standard Euclidian Distance Metric. A flexible metric is estimated for computing neighborhoods based on Chi-squared distance analysis. Chi-squared metric is used to ascertains most significant features in finding k-closet points of the training patterns. This paper also shows that LANN outperformed other four different models of KNN and other machine-learning algorithm in both training and accuracy.

A new locally adaptive [formula omitted]-nearest neighbor algorithm based on discrimination class

The k-nearest neighbor (kNN) rule is a classical non-parametric classification algorithm in pattern recognition, and has been widely used in many fields due to its simplicity, effectiveness and intuitiveness. However, the classification performance of the kNN algorithm suffers from the choice of a fixed and single value of k for all queries in the search stage and the use of simple majority voting rule in the decision stage.In this paper, we propose a new kNN-based algorithm, called locally adaptive k-nearest neighbor algorithm based on discrimination class (DC-LAKNN). In our method, the role of the second majority class in classification is for the first time considered. Firstly, the discrimination classes at different values of k are selected from the majority class and the second majority class in the k-neighborhood of the query. Then, the adaptive k value and the final classification result are obtained according to the quantity and distribution information on the neighbors in the discrimination classes at each value of k.Extensive experiments on eighteen real-world datasets from UCI (University of California, Irvine) Machine Learning Repository and KEEL (Knowledge Extraction based on Evolutionary Learning) Repository show that the DC-LAKNN algorithm achieves better classification performance compared to standard kNN algorithm and nine other state-of-the-art kNN-based algorithms.

Prototype selection for dynamic classifier and ensemble selection

In dynamic ensemble selection (DES) techniques, only the most competent classifiers, for the classification of a specific test sample, are selected to predict the sample’s class labels. The key in DES techniques is estimating the competence of the base classifiers for the classification of each specific test sample. The classifiers’ competence is usually estimated according to a given criterion, which is computed over the neighborhood of the test sample defined on the validation data, called the region of competence. A problem arises when there is a high degree of noise in the validation data, causing the samples belonging to the region of competence to not represent the query sample. In such cases, the dynamic selection technique might select the base classifier that overfitted the local region rather than the one with the best generalization performance. In this paper, we propose two modifications in order to improve the generalization performance of any DES technique. First, a prototype selection technique is applied over the validation data to reduce the amount of overlap between the classes, producing smoother decision borders. During generalization, a local adaptive K-Nearest Neighbor algorithm is used to minimize the influence of noisy samples in the region of competence. Thus, DES techniques can better estimate the classifiers’ competence. Experiments are conducted using 10 state-of-the-art DES techniques over 30 classification problems. The results demonstrate that the proposed scheme significantly improves the classification accuracy of dynamic selection techniques.

RFID Indoor Localization Algorithm Based on Adaptive Self-correction

With the rapid development of wireless communication and embedded system, wireless positioning systems are paid more and more attention to. Radio Frequency Identification (RFID) localization system is getting more important, due to its own advantages, such as no contact, non-line-of-sight nature, promising transmission range and cost-effectiveness. To improve the accuracy of active RFID indoor location system, some traditional RFID indoor localization systems were studied, such as LANDMARC. On this basis, an adaptive selfcorrection location algorithm was presented, which uses a positioning correction value to correct the positioning result. N minimum errors and position results are obtained by using adaptive K-nearest neighbor algorithm N times. The positioning correction value calculated with N minimum errors in weighted way. The sum of the positioning average value and the positioning correction value would be the final positioning results. Experimental results show that compared with adaptive K-nearest neighbor algorithm and error self-correction algorithm, the proposed method provides a higher accuracy and stability.

Software refactoring at the function level using new Adaptive K-Nearest Neighbor algorithm

Improving the quality of software is a vital target of software engineering. Constantly evolving requirements force software developers to enhance, modify, or adapt software. Thus, increasing internal complexity, maintenance effort, and ultimately cost. In trying to balance between the needs to change software, maintain high quality, and keep the maintenance effort and cost low, refactoring comes up as a solution. Refactoring aims to improve a number of quality factors, among which is understandability. Enhancing understandability of ill-structured software decreases the maintenance effort and cost. To improve understandability, designers need to maximize cohesion and minimize coupling, which becomes more difficult to achieve as software evolves and internal complexity increases. In this paper, we propose a new Adaptive K-Nearest Neighbor (A-KNN) algorithm to perform clustering with different attribute weights. The technique is used to assist software developers in refactoring at the function/method level. This is achieved by identifying ill-structured software entities and providing suggestions to improve cohesion of such entities. We also compare the proposed technique with three function-level clustering techniques Single Linkage algorithm (SLINK), Complete Linkage algorithm (CLINK) and Weighted Pair-Group Method using Arithmetic averages (WPGMA). A-KNN showed competitive performance with the other three algorithms and required less computational complexity.

Using adaptive K-nearest neighbor algorithm and cellular automata images to predicting G-protein-coupled receptor classes

G-Protein-Coupled Receptors (GPCRs) are the largest of cell surface receptor, accounting for >1% of the human genome. They play a key role in cellular signaling networks that regulate various physiological processes. The functions of many of GPCRs are unknown, because they are difficult to crystallize and most of them will not dissolve in normal solvents. This difficulty has motivated and challenged the development of a computational method which can predict the classification of the families and subfamilies of GPCRs based on their primary sequence so as to help us classify drugs. In this paper the adaptive K-nearest neighbor algorithm and protein cellular automata image (CAI) is introduced. Based on the CAI, the complexity measure factors derived from each of the protein sequences concerned are adopted for its Pseudo amino acid composition. GPCRs were categorized into nine subtypes. The overall success rate in identifying GPCRs among their nine family classes was about 83.5%. The high success rate suggests that the adaptive K-nearest neighbor algorithm and protein CAI holds very high potential to become a useful tool for understanding the actions of drugs that target GPCRs and designing new medications with fewer side effects and greater efficacy.