.png){kind=icon}
.png){kind=icon}
Return
Large Margin Feature Weighting Method via Linear Programming
.png){kind=icon}
PRE
AI
DOI：10.1109/TKDE.2008.238.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Feature selection
feature weighting
large margin
linear programming
Journal
IF:
10.4
Papers:
6.7K
Citations:
3.2W