.png){kind=icon}
返回
Large Margin Feature Weighting Method via Linear Programming
.png){kind=icon}
PRE
AI
DOI：10.1109/TKDE.2008.238.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The problem of feature selection is a difficult combinatorial task in machine learning and of high practical relevance. In this paper, we consider feature selection method for multimodally distributed data, and present a large margin feature weighting method for k-nearest neighbor (kNN) classifiers. The method learns the feature weighting factors by minimizing a cost function, which aims at separating different classes by large local margins and pulling closer together points from the same class, based on using as few features as possible. The consequent optimization problem can be efficiently solved by Linear Programming. Finally, the proposed approach is assessed through a series of experiments with UCI and microarray data sets, as well as a more specific and challenging task, namely, radar high-resolution range profiles (HRRP) automatic target recognition (ATR). The experimental results demonstrate the effectiveness of the proposed algorithms.
Keyword:
Feature selection
feature weighting
large margin
linear programming
期刊
IF:
10.4
论文数:
6.9K
被引数:
3.2W
机构
引用论文
Logarithm bispectrum-based approach to radar range profile for automatic target recognition基于对数双谱的雷达距离剖面自动目标识别方法.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏Local structural change in GaCrN grown by radio frequency plasma-assisted molecular-beam epitaxy
PREAI
分享收藏
Quantitative approach to hückel rule the relations between the cycles of a molecular graph and the thermodynamic stability of a conjugated moleculeTetrahedron
TetrahedronIF0
PREAI
分享收藏
查看更多内容