Dynamic k-nearest-neighbor naive bayes with attribute weighted

  • Authors:
  • Liangxiao Jiang;Harry Zhang;Zhihua Cai

  • Affiliations:
  • Faculty of Computer Science, China University of Geosciences, Wuhan, Hubei, P.R. China;Faculty of Computer Science, University of New Brunswick, Fredericton, NB, Canada;Faculty of Computer Science, China University of Geosciences, Wuhan, Hubei, P.R. China

  • Venue:
  • FSKD'06 Proceedings of the Third international conference on Fuzzy Systems and Knowledge Discovery
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

K-Nearest-Neighbor (KNN) has been widely used in classification problems. However, there exist three main problems confronting KNN according to our observation: 1) KNN's accuracy is degraded by a simple vote; 2) KNN's accuracy is typically sensitive to the value of K; 3) KNN's accuracy may be dominated by some irrelevant attributes. In this paper, we presented an improved algorithm called Dynamic K-Nearest-Neighbor Naive Bayes with Attribute Weighted (DKNAW) . We experimentally tested its accuracy, using the whole 36 UCI data sets selected by Weka[1], and compared it to NB, KNN, KNNDW, and LWNB[2]. The experimental results show that DKNAW significantly outperforms NB, KNN, and KNNDW and slightly outperforms LWNB.