Weighted KNN Classification Algorithm Based on Mean Distance of Category
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    In this paper, an improved KNN classification algorithm is proposed by using characteristics that the points distributed in the same category of sample collection are in close distance as an assistant to classify KNN algorithm. The way to deal with the k-nearest neighboring sample points is calculating the average distance between categories that the sample points belong to and the differences of unspecified sample points respectively. If the data calculated is greater than a certain threshold, delete this sample point from k-nearest neighboring samples, then determine the categories of unspecified sample points through majority voting. The improved KNN algorithm enhances the precision of classification and maintains the same time complexity as the traditional KNN algorithm.

    Reference
    Related
    Cited by
Get Citation

严晓明.基于类别平均距离的加权KNN分类算法.计算机系统应用,2014,23(2):128-132

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:July 07,2013
  • Revised:August 19,2013
  • Adopted:
  • Online: January 27,2014
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063