Entropy Dependency-based Unsupervised Feature Selection

Machine-learning techniques often face significant challenges with high-dimensional data due to extensive memory requirements and higher processing times. In this paper, a novel unsupervised feature selection method called Entropy Dependency-based Un-supervised Feature Selection (EDUFS) is proposed. This method aims to select an appropriate and concise subset of features while minimizing redundancy by evaluating and considering entropy of each feature during optimization. EDUFS employs entropy, an information theory concept, to measure the correlation between features. By calculating the entropy for each feature and eliminating redundant ones, our method reduces the feature set while preserving essential information in the form of Laplacian from the original dataset. Experimental evaluations across six datasets and seven different entropy measures demonstrate that our proposed approach is efficient and outperforms state-of-the-art unsupervised feature selection methods in most cases.

Authors

Institutions

Publication Details

Journal
Procedia Computer Science
Published
2025-01-01
DOI
https://doi.org/10.1016/j.procs.2025.04.357
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

Entropy Dependency-based Unsupervised Feature Selection

Reshma Rastogi, Era Aich
Procedia Computer Science
Face and Expression Recognition
article

Entropy Dependency-based Unsupervised Feature Selection

Reshma Rastogi, Era Aich
article en

Abstract

Machine-learning techniques often face significant challenges with high-dimensional data due to extensive memory requirements and higher processing times. In this paper, a novel unsupervised feature selection method called Entropy Dependency-based Un-supervised Feature Selection (EDUFS) is proposed. This method aims to select an appropriate and concise subset of features while minimizing redundancy by evaluating and considering entropy of each feature during optimization. EDUFS employs entropy, an information theory concept, to measure the correlation between features. By calculating the entropy for each feature and eliminating redundant ones, our method reduces the feature set while preserving essential information in the form of Laplacian from the original dataset. Experimental evaluations across six datasets and seven different entropy measures demonstrate that our proposed approach is efficient and outperforms state-of-the-art unsupervised feature selection methods in most cases.

Procedia Computer ScienceVol. 258
South Asian University (IN)
Reduced inequalities
Openalex Percentile: Top 92%
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.

Entropy Dependency-based Unsupervised Feature Selection — Reshma Rastogi, Era Aich · Procedia Computer Science (2025) | TGRS Research Map | TGRS