Skip to main navigation Skip to search Skip to main content

KNN algorithm improving based on Cloud Model

  • Yu Liu*
  • , Gui Sheng Chen
  • *Corresponding author for this work
  • CAS - Institute of Electronics

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

KNN algorithm is particularly sensitive to outliers and noise contained in the training data set. In this paper, we use the reverse cloud algorithm to map the training samples into clouds. Each attribute is mapped to a cloud vector. Reverse cloud algorithm is not sensitive to the noise on data sets and it can eliminate the impact of noise on classification effectively. By comparing the similarity of clouds in the cloud vector, we can calculate the attributes weights. For those attributes with a low weight of properties, we find out merger them to a new attribute which can generate more significant attribute weight than original ones. We present a new KNN algorithm based on Cloud Model and compare our algorithm with classic KNN algorithms and other well-known improved KNN algorithms using 10 data sets. Experiments show that our approach could achieve a better or at least a comparable classification accuracy with other algorithms.

Original languageEnglish
Title of host publicationProceedings - 2nd IEEE International Conference on Advanced Computer Control, ICACC 2010
Pages63-66
Number of pages4
DOIs
StatePublished - 2010
Event2010 IEEE International Conference on Advanced Computer Control, ICACC 2010 -
Duration: 27 Mar 201029 Mar 2010

Publication series

NameProceedings - 2nd IEEE International Conference on Advanced Computer Control, ICACC 2010
Volume2

Conference

Conference2010 IEEE International Conference on Advanced Computer Control, ICACC 2010
Period27/03/1029/03/10

Keywords

  • Attribute weight learning
  • Classification
  • Cloud model
  • KNN
  • Similarity

Fingerprint

Dive into the research topics of 'KNN algorithm improving based on Cloud Model'. Together they form a unique fingerprint.

Cite this