Graph-clustering-with-ACO-for-feature-selection

A graph clustering method with ant colony optimization for feature selection
370 Downloads
Updated 27 Feb 2019

View License

A novel feature selection method based on the graph clustering approach and ant colony optimization is proposed for classification problems. The proposed method’s algorithm works in three steps. In the first step, the entire feature set is represented as a graph. In the second step, the features are divided into several clusters using a community detection algorithm and finally in the third step, a novel search strategy based on the ant colony optimization is developed to select the final subset of features. Moreover the selected subset of each ant is evaluated using a supervised filter based method called novel separability index. Thus the proposed method does not need any learning model and can be classified as a filter based feature selection method. The proposed method integrates the community detection algorithm with a modified ant colony based search process for the feature selection problem. Furthermore, the sizes of the constructed subsets of each ant and also size of the final feature subset are determined automatically.

Cite As

desomon yang (2024). Graph-clustering-with-ACO-for-feature-selection (https://www.mathworks.com/matlabcentral/fileexchange/70419-graph-clustering-with-aco-for-feature-selection), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2018b
Compatible with any release
Platform Compatibility
Windows macOS Linux
Tags Add Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Version Published Release Notes
1.0.2

Adjust theme

1.0.1

Adjust grammar

1.0.0