For some applications of k-nearest neighbor classiiers, the best results are obtained at a relatively large value of k. With the majority voting method, these results can be suboptimal. In this paper the performance of various weighted voting methods is tested on a number of machine learning datasets. The results show that weighted voting is often superior to majority voting, and that the linea...

In this paper we get the explicit condition number formulas for the W–weighted Drazin inverse of a rectangular matrix using the Schur decomposition and the spectral norm. We characterize the spectral norm and the Frobenius norm of the relative condition number of the W– weighted Drazin inverse, and the level-2 condition number of the W– weighted Drazin inverse. The sensitivity for the W–weighte...

Different types of aggregation operators such as the ordered weighted quasi-arithmetic mean (Quasi-OWA) operator and the normalized Hamming distance are studied. We introduce the use of the OWA operator in generalized distances such as the quasiarithmetic distance. We will call these new distance aggregation the ordered weighted quasi-arithmetic distance (Quasi-OWAD) operator. We develop a gene...

The paper is devoted to inverse spectral problems for weighted graphs. We give the sharp upper bound reconstruction number of trees and unicyclic