Abstract

AbstractMulti-label learning is a machine learning subclass that aims to assign more than one label simultaneously for each instance. Many real-world tasks include high-dimensional data which reduces the performance of machine learning methods. To solve this issue, a filter and multi-label feature selection is proposed in this paper. The main idea of the proposed method is to choose highly relevant and non-redundant features with the lowest information loss. The proposed method first uses a novel graph-based density peaks clustering to group similar features to reach this goal. It then uses the ant colony optimization search process to rank features based on their relevancy to a set of labels and also their redundancy with the other features. A graph first represents the feature space, and then a novel density peaks clustering is used to group similar features. Then, the ants are searched through the graph to select a set of non-similar features by remaining in the clusters with a low probability and jumping among the clusters with a high probability. Moreover, in this paper, to evaluate the solutions found by the ants, a novel criterion based on mutual information was used to assign a high pheromone value to highly relevant and non-redundant features. Finally, the final features are chosen based on their pheromone values. The results of experiments on a set of real-world datasets show the superiority of the proposed method over a set of baseline and state-of-the-art methods.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.