CONMI_MFS: A New Filter Feature Selection Algorithm

Feature selection is crucial in machine learning and data mining. Existing feature selection algorithms often use single evaluation metrics for assessing relationships between variables or have high computational complexity. Taking into account the intricacies of how features interact with each other, we have developed a novel Improved feature selection evaluation function known as CONMIS. This function combines the Pearson correlation coefficient, which measures linear relationships, with maximized mutual information, which captures nonlinear dependencies, to provide a thorough characterization of the inter dependencies between features and the target class variables. Building on this, we introduce the CONMI_MFS algorithm designed to identify an optimal feature subset that is both highly relevant to the class variables and exhibits minimal redundancy. Through comparative experiments with four alternative methods across ten datasets, our results indicate that CONMI_MFS can achieve a maximum reduction rate of 67.63%. This underscores the competitive edge of the CONMI_MFS algorithm in terms of performance.

Authors

Institutions

Publication Details

Published
2024-11-01
DOI
https://doi.org/10.1109/isdh64927.2024.00051
Primary Topic
Face and Expression Recognition
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

CONMI_MFS: A New Filter Feature Selection Algorithm

Liwen Zhang, Xiaoshu Zhu, Ji Li
Face and Expression Recognition
article

CONMI_MFS: A New Filter Feature Selection Algorithm

Liwen Zhang, Xiaoshu Zhu, Ji Li
article en

Abstract

Feature selection is crucial in machine learning and data mining. Existing feature selection algorithms often use single evaluation metrics for assessing relationships between variables or have high computational complexity. Taking into account the intricacies of how features interact with each other, we have developed a novel Improved feature selection evaluation function known as CONMIS. This function combines the Pearson correlation coefficient, which measures linear relationships, with maximized mutual information, which captures nonlinear dependencies, to provide a thorough characterization of the inter dependencies between features and the target class variables. Building on this, we introduce the CONMI_MFS algorithm designed to identify an optimal feature subset that is both highly relevant to the class variables and exhibits minimal redundancy. Through comparative experiments with four alternative methods across ten datasets, our results indicate that CONMI_MFS can achieve a maximum reduction rate of 67.63%. This underscores the competitive edge of the CONMI_MFS algorithm in terms of performance.

Guilin University of Electronic Technology (CN)
Openalex Percentile: Top 72%
Face and Expression Recognition
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.