首页 | 本学科首页   官方微博 | 高级检索  
     

核仿射子空间最近点分类算法
引用本文:周晓飞,姜文瀚,杨静宇.核仿射子空间最近点分类算法[J].计算机工程,2008,34(17):23-25.
作者姓名:周晓飞  姜文瀚  杨静宇
作者单位:南京理工大学计算机科学与技术学院,南京,210094
摘    要:受支持向量机的几何解释和最近点问题启发,提出一种新型的模式分类算法——核仿射子空间最近点分类算法。该算法在核空间中,将支持向量机几何模型中的最近点搜索区域由2类训练特征集凸包推广到2类特征样本各自生成的仿射子空间,以仿射子空间作为特征样本分布的粗略估计,通过仿射子空间中的最近的2个点构造平分仿射子空间间隔的最优分类超平面。该算法在ORL人脸识别数据库上的比较实验中取得了较好的识别效果。

关 键 词:模式分类  核函数  支持向量机  核仿射子空间最近点
修稿时间: 

Kernel Affine Subspace Nearest Points Classification Algorithm
ZHOU Xiao-fei,JIANG Wen-han,YANG Jing-yu.Kernel Affine Subspace Nearest Points Classification Algorithm[J].Computer Engineering,2008,34(17):23-25.
Authors:ZHOU Xiao-fei  JIANG Wen-han  YANG Jing-yu
Affiliation:(School of Computer Science and Technology, Nanjing University of Science and Technology, Nanjing 210094)
Abstract:A novel pattern recognition algorithm called Kernel Affine Subspace Nearest Points(KASNP) classification is presented. Inspired by the geometrical explanation of Support Vector Machine(SVM) that the optimal separating plane bisects the closest points within two class convex hulls, KASNP algorithm expands the searching areas of the closest points from the convex hulls to their corresponding class affine subspaces in kernel space. The affine subspaces are taken as the rough estimations of the class feature sample distributions, and their closest points are found. The hyperplane to separate the affine subspaces with the maximal margins is constructed, which is the perpendicular bisector of the line segment joining the two closest points. The test experiments compared with the Nearest Neighbor(1-NN) classifier and SVM on the ORL face recognition database show good performance of this algorithm.
Keywords:pattern classification  kernel function  Support Vector Machine(SVM)  Kernel Affine Subspace Nearest Points(KASNP)
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号