| 基于K近邻分类间隔的特征选择方法研究 |
| |
| 引用本文： | 李云,;张腾飞,;杨文杰.基于K近邻分类间隔的特征选择方法研究[J].南京邮电学院学报(自然科学版),2009(6):68-74. |
| |
| 作者姓名： | 李云 ;张腾飞 ;杨文杰 |
| |
| 作者单位： | [1]南京邮电大学计算机学院,江苏南京210046; [2]南京邮电大学自动化学院,江苏南京210046 |
| |
| 基金项目： | 基金项目：江苏省高校自然科学基金（08KJB520008）和南京邮电大学人才引进启动基金（NY207137,NY207148）资助项目 |
| |
| 摘 要： | 特征选择是机器学习和模式识别领域的一个关键问题。文中详细分析研究一类基于K近邻分类间隔的特征选择算法，并着重讨论当K〉1时，特征选择的评价准则和搜索策略的设计，同时在多个数据集上验证其性能。
|
| 关 键 词： | 特征选择 K近邻 分类间隔 |
Feature Selection Based on Margin of K-Nearest Neighbors |
| |
| Affiliation: | LI Yun1,ZHANG Teng-fei2,YANG Wen-jie1(1.College of Computer,Nanjing University of Posts and Telecommunications,Nanjing 210046,China2.College of Automation,Nanjing University of Posts and Telecommunications,Nanjing 210046,China ) |
| |
| Abstract: | Feature selection is one of key problems in machine learning and pattern recognition.In this paper,a type of feature selection methods based on Margin of K-nearest neighbors is discussed.Furthermore,the feature selection evaluation criterion and search strategy is introduced when the value of k is more than 1.Meanwhile,the experimental results on different data sets are presented. |
| |
| Keywords: | feature selection K-nearest neighbors classification margin |
| 本文献已被 维普 等数据库收录！ |
|
