A New K-Nearest Neighbor Classification Method Based on Belief Functions in Wireless Sensor Networks

A New K-Nearest Neighbor Classification Method Based on Belief Functions in Wireless Sensor Networks

In wireless sensor networks, the classification of uncertain data reported by sensor nodes is an open issue because the given attribute information can be insufficient for making a correct specific classification of the objects. Although the traditional Evidential k-Nearest Neighbor (EkNN) algorithm can effectively model the uncertainty, it is easy to misjudge the target data to the incorrect class when the observed sample data is located in the feature overlapping region of training samples of different classes. In this paper, a novel Evidential k- Nearest Neighbor (NEkNN) algorithm is proposed based on the evidential editing method. The main idea of NEkNN algorithm is to consider the expected value and standard deviation of various training sample data sets, and use normalized Euclidean distance to assign class labels with basic belief assignment (BBA) structure to each training sample, so that training samples in overlapping region can offer more abundant and diverse class information. Further, EkNN classification of the observation sample data is carried out in the training sample sets of various classes, and mass functions of the target to be tested under this class are obtained, and Redistribute Conflicting Mass Proportionally Rule 5 (PCR5) combination rule is used to conduct global fusion, thus obtaining the global fusion results of the targets. The experimental results show that this algorithm has better performance than other classification methods based on knearest neighbor. Several experiments using both simulation and real data sets are presented at the end of this paper. The results indicate that the NEK-NN algorithm can effectively improve the classification accuracy.