节点文献

一种序列的加权kNN分类方法

A Sequential Weighted k-Nearest Neighbor Classification Method

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 朱明旱罗大庸易励群

【Author】 ZHU Ming-han1,2,LUO Da-yong1,YI Li-qun3(1.College of Information Science and Engineering,Central South University,Changsha,Hunan,410083,China;2.College of Communication and Electric Engineering,Hunan University of Arts and Science,Changde,Hunan 415000,China;3.Modern Education Technology Center,Hunan University of Arts and Science,Changde,Hunan 415000,China)

【机构】 中南大学信息科学与工程学院湖南文理学院电气与信息工程学院湖南文理学院现代教育技术中心

【摘要】 针对加权kNN(k-Nearest Neighbor)方法在对样本进行分类时,仅仅只利用了它的k近邻点来进行分类决策的不足,提出了一种序列的加权kNN分类方法.该方法在对某个测试样本进行分类时,除了利用它k近邻点所提供的类别信息外,还有效地利用了前面已分类样本的类别信息,这使得测试样本的分类决策更加合理和有效.在Cohn-Kanade人脸库上进行的表情识别实验表明,在序列样本分类的场合,该方法的分类效果比加权kNN方法更好.

【Abstract】 Aim at the defect that weighted k-nearest neighbor method classifies one test sample only using the class information of its k-nearest samples,a sequential weighted k-nearest neighbor classification method is proposed in this paper.Not only the class information offered by k-nearest neighbor points of test sample but also the class information of previous test sample is used for classification in the proposed method.So its decision-making processing is more reasonable and effective.The experimental results of facial expression recognition in Cohn-Kanade face database show the method is better than weighted k-nearest neighbor method for the classification of sequential samples.

【基金】 湖南省教育厅科研项目(No.08C606);国家自然科学基金项目(No.60776834)
  • 【文献出处】 电子学报 ,Acta Electronica Sinica , 编辑部邮箱 ,2009年11期
  • 【分类号】TP391.41
  • 【被引频次】31
  • 【下载频次】512
节点文献中: 

本文链接的文献网络图示:

本文的引文网络