.png){kind=icon}
.png){kind=icon}
Return
Maximum distance minimization for feature weighting
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2014.10.003.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present a new feature weighting method to improve k-Nearest-Neighbor (k-NN) classification. The proposed method minimizes the largest distance between equally labeled data tuples, while retaining a minimum distance between data tuples of different classes, with the goal to group equally labeled data together. It can be implemented as a simple linear program, and in contrast to other feature weighting methods, it does not depend on the initial scaling of the data dimensions. Two versions, a hard and a soft one, are evaluated on real-world datasets from the UCI repository. In particular the soft version compares very well with competing methods. Furthermore, an evaluation is done on challenging gene expression data sets, where the method shows its ability to automatically reduce the dimensionality of the data. (C) 2014 Elsevier B.V. All rights reserved
Keywords:
Feature selection
Feature weighting
Metric learning
k-Nearest-Neighbor
Relief
Large Margin Nearest Neighbor Classification
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.3
Papers:
7.8K
Citations:
1.6W