K-nearest neighbor (KNN) rule is a well-known non-parametric classifier that is widely used in pattern recognition. However, the sensitivity of the neighborhood size k always seriously degrades the KNN-based classification performance, especially in the case of the small sample size with the existing outliers. To overcome this issue, in this article we propose a generalized mean distance-based k-nearest neighbor classifier (GMDKNN) by introducing multi-generalized mean distances and the nested generalized mean distance that are based on the characteristic of the generalized mean. In the proposed method, multi-local mean vectors of the given query sample in each class are calculated by adopting its class-specific k nearest neighbors. Using the achieved k local mean vectors per class, the corresponding k generalized mean distances are calculated and then used to design the categorical nested generalized mean distance. In the classification phase, the categorical nested generalized mean distance is used as the classification decision rule and the query sample is classified into the class with the minimum nested generalized mean distance among all the classes. Extensive experiments on the UCI and KEEL data sets, synthetic data sets, the KEEL noise data sets and the UCR time series data sets are conducted by comparing the proposed method to the state-of-art KNN-based methods. The experimental results demonstrate that the proposed GMDKNN performs better and has the less sensitiveness to k. Thus, our proposed GMDKNN with the robust and effective classification performance could be a promising method for pattern recognition in some expert and intelligence systems.

A generalized mean distance-based k-nearest neighbor classifier

Diseases is an unusual circumstance that affects single or more parts of a human’s body. Because of lifestyle and patrimonial, different kinds of disease are increasing day by day. Among all those ...

Coronary Artery Heart Disease Prediction: A Comparative Study of Computational Intelligence Techniques

Although there are many attempts to build an optimal model for feature selection in Big Data applications, the complex nature of processing such kind of data makes it still a big challenge. Accordingly, the data mining process may be obstructed due to the high dimensionality and complexity of huge data sets. For the most informative features and classification accuracy optimization, the feature selection process constitutes a mandatory pre-processing phase to reduce dataset dimensionality. The exhaustive search for the relevant features is time-consuming. In this paper, a new binary variant of the wrapper feature selection grey wolf optimization and particle swarm optimization is proposed. The K-nearest neighbor classifier with Euclidean separation matrices is used to find the optimal solutions. A tent chaotic map helps in avoiding the algorithm from locked to the local optima problem. The sigmoid function employed for converting the search space from a continuous vector to a binary one to be suitable to the problem of feature selection. Cross-validation K-fold is used to overcome the overfitting issue. A variety of comparisons have been made with well-known and common algorithms, such as the particle swarm optimization algorithm, and the grey wolf optimization algorithm. Twenty datasets are used for the experiments, and statistical analyses are conducted to approve the performance and the effectiveness and of the proposed model with measures like selected features ratio, classification accuracy, and computation time. The cumulative features picked through the twenty datasets were 196 out of 773, as opposed to 393 and 336 in the GWO and the PSO, respectively. The overall accuracy is 90% relative to other algorithms ' 81.6 and 86.8. The total processing time for all datasets equals 184.3 seconds, wherein GWO and PSO equal 272 and 245.6, respectively.

Improved Feature Selection Model for Big Data Analytics

An adaptive ECMS with driving style recognition for energy optimization of parallel hybrid electric buses

Acoustic fault analysis of three commutator motors

k-Nearest neighbor (KNN) rule is a very simple and powerful classification algorithm. In this article, we propose a new KNN-based classifier, called the local mean-based pseudo nearest neighbor (LMPNN) rule. It is motivated by the local mean-based k-nearest neighbor (LMKNN) rule and the pseudo nearest neighbor (PNN) rule, with the aim of improving the classification performance. In the proposed LMPNN, the k nearest neighbors from each class are searched as the class prototypes, and then the local mean vectors of the neighbors are yielded. Subsequently, we attempt to find the local mean-based pseudo nearest neighbor per class by employing the categorical k local mean vectors, and classify the unknown query patten according to the distances between the query and the pseudo nearest neighbors. To assess the classification performance of the proposed LMPNN, it is compared with the competing classifiers, such as LMKNN and PNN, in terms of the classification error on thirty-two real UCI data sets, four artificial data sets and three image data sets. The comprehensively experimental results suggest that the proposed LMPNN classifier is a promising algorithm in pattern recognition.

Improved pseudo nearest neighbor classification

In this paper, we propose a multi-local means based nearest neighbor classifier (MLMNN). In the MLMNN, k categorical nearest neighbors of a query sample are first found and used to calculate the corresponding k categorical multi-local mean vectors which can represent different local class-specific sample distributions. Then, the query sample is represented by a linear combination of k categorical local mean vectors and the representation coefficient of each local mean vector as the contribution to representing and classifying the query sample is obtained. Finally, the class-specific representation-based distance (i.e. reconstruction residual) between the query sample and k categorical multi-local mean vectors is adopted to determine the class label of the query sample. The experimental results on three popular face databases show that the proposed MLMNN method outperforms the related competitive KNN-based methods.

A Multi-local Means Based Nearest Neighbor Classifier

K-nearest neighbor (KNN) rule is a simple and effective classifier in pattern recognition. In this paper, we propose a new nearest neighbor classifier based on multi-harmonic mean distances, in order to overcome the sensitivity of the neighborhood size k and improve the classification performance. The proposed method is called a harmonic mean distance-based k-nearest neighbor classifier (HMDKNN). It mainly designs the multi-harmonic mean distances based on the multi-local mean vectors calculated by utilizing k nearest neighbors of the given query sample in each class. Using the multi-harmonic mean distances per class, a new nested harmonic mean distance in each class is designed as the classification decision and the query sample is classified into the class with the closest nested harmonic mean distance among all classes. The experimental results on the UCI data sets show that the proposed HMDKNN performs better with the less sensitiveness to k, compared to the state-of-art KNN-based methods.

A new nearest neighbor classifier based on multi-harmonic mean distances

Recently, the combination of remote sensing image processing and deep learning methods is an increasingly popular trend. In this paper, we combine the existing instance segmentation model Mask R-CNN and the target detection algorithm Softer-NMS, and propose a model based on the improved Mask R-CNN. The model can capture the edges well, thereby segmenting the target more accurately. The experimental results also verify the effectiveness of our method. Compared with the prototype Mask R-CNN, our method improves the overall segmentation accuracy, and the loss function of the mask branch and the loss function of the candidate frame of the RPN drop faster than the original model. Incidentally, there is also a good improvement in the accuracy of detection.

Yunbo Rao

Papers

A generalized mean distance-based k-nearest neighbor classifier

Improved pseudo nearest neighbor classification

A Multi-local Means Based Nearest Neighbor Classifier

A new nearest neighbor classifier based on multi-harmonic mean distances

Using the Improved Mask R-cnn and Softer-nms for Target Segmentation of Remote Sensing Image