A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
A Novel Weighted Voting for K-Nearest Neighbor Rule
2011
Journal of Computers
K-nearest neighbor rule (KNN) is the wellknown non-parametric technique in the statistical pattern classification, owing to its simplicity, intuitiveness and effectiveness. In this paper, we firstly review the related works in brief and detailedly analyze the sensitivity issue on the choice of the neighborhood size k, existed in the KNN rule. Motivated by the problem, a novel dual weighted voting scheme for KNN is developed. With the goal of overcoming the sensitivity of the choice of the
doi:10.4304/jcp.6.5.833-840
fatcat:zkboq7q7cjeanksnvw2q3my5ea