A graph-based sparse filter feature selection method for multi-class and ordinal data

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Feature selection is a common pre-processing step for high-dimensional datasets. Filter-based methods rank feature relevance independently of specific classifiers. This work proposes a graph-based filter method for multi-class classification, aiming to drastically reduce features while retaining valuable class-separability information. The approach combines the Jeffries-Matusita distance with diffusion maps for nonlinear dimensionality reduction. Features are eliminated based on their distribution in the low-dimensional space, selecting a small subset with complementary separation strengths. In addition, we propose a modified version to address the case of ordinal feature selection. Experimental results on public tabular and time-series datasets demonstrate the method's effectiveness compared to existing filter-based techniques.

Original languageEnglish
Title of host publicationInternational Joint Conference on Neural Networks, IJCNN 2025 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9798331510428
DOIs
StatePublished - 2025
Event2025 International Joint Conference on Neural Networks, IJCNN 2025 - Rome, Italy
Duration: 30 Jun 20255 Jul 2025

Publication series

NameProceedings of the International Joint Conference on Neural Networks
ISSN (Print)2161-4393
ISSN (Electronic)2161-4407

Conference

Conference2025 International Joint Conference on Neural Networks, IJCNN 2025
Country/TerritoryItaly
CityRome
Period30/06/255/07/25

Bibliographical note

Publisher Copyright:
© 2025 IEEE.

Keywords

  • dimension reduction
  • feature selection
  • ordinal data
  • time series

Fingerprint

Dive into the research topics of 'A graph-based sparse filter feature selection method for multi-class and ordinal data'. Together they form a unique fingerprint.

Cite this