Two novel features selection algorithms based on crowding distance
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
Two novel algorithms for features selection are proposed. The first one is a filter method while the second is wrapper method. Both the proposed algorithms use the crowding distance used in the multiobjective optimization as a metric in order to sort the features. The less crowded features have great effects on the target attribute (class). The experimental results have shown the effectiveness and the robustness of the proposed algorithms.
Cite As
abdesslem layeb (2026). crowded features selection (https://github.com/Layebuniv/crowdedfeatures/releases/tag/1.0.0.2), GitHub. Retrieved .
Abdesslem Layeb:Two novel feature selection algorithms based on crowding distance %https://arxiv.org/abs/2105.05212V3
General Information
- Version 1.0.0.2 (6.32 MB)
-
View License on GitHub
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
| Version | Published | Release Notes | Action |
|---|---|---|---|
| 1.0.0.2 | See release notes for this release on GitHub: https://github.com/Layebuniv/crowdedfeatures/releases/tag/1.0.0.2 |
To view or report issues in this GitHub add-on, visit the GitHub Repository.
To view or report issues in this GitHub add-on, visit the GitHub Repository.
