2021
DOI: 10.1002/int.22546
|View full text |Cite
|
Sign up to set email alerts
|

Scalable feature selection using ReliefF aided by locality‐sensitive hashing

Abstract: Feature selection algorithms, such as ReliefF, are very important for processing high‐dimensionality data sets. However, widespread use of popular and effective such algorithms is limited by their computational cost. We describe an adaptation of the ReliefF algorithm that simplifies the costliest of its step by approximating the nearest neighbor graph using locality‐sensitive hashing (LSH). The resulting ReliefF‐LSH algorithm can process data sets that are too large for the original ReliefF, a capability furth… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 16 publications
(3 citation statements)
references
References 31 publications
0
3
0
Order By: Relevance
“…ReliefF is not a metric, but an algorithm [ 9 ]. The ReliefF algorithm estimates the quality of features based on how well the feature can differentiate between similar instances.…”
Section: Materials and Methodsmentioning
confidence: 99%
“…ReliefF is not a metric, but an algorithm [ 9 ]. The ReliefF algorithm estimates the quality of features based on how well the feature can differentiate between similar instances.…”
Section: Materials and Methodsmentioning
confidence: 99%
“…In general, the feature selection algorithms are classified into three: embedded scheme, filter‐based scheme as well as wrapper scheme. In this article, a modified relief technique is employed to select optimal features thereby performing better classification 39 . The modified relief technique is highly robust and can deal with both real time and noisy data.…”
Section: Proposed Methodologymentioning
confidence: 99%
“…In this article, a modified relief technique is employed to select optimal features thereby performing better classification. 39 The modified relief technique is highly robust and can deal with both real time and noisy data. At first, in modified relief algorithm, random selection of instances takes place for the k-nearest neighbor.…”
Section: Feature Selection Process Using Modified Relief Algorithmmentioning
confidence: 99%