Submit

Login Login

Register Register

Home / Journals / CMC / Online First / doi:10.32604/cmc.2026.085049
Journal Menu
Special Issues
Table of Content

All issues

Online First

2026

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

Open Access

ARTICLE

A Hybrid Genetic Algorithm with Information-Theoretic Local Search for Unsupervised Feature Selection

Seyeon Son1, Hyunki Lim2,*
1 Division of Business Administration, Kyonggi University, Suwon, Republic of Korea
2 Division of AI Computer Science and Engineering, Kyonggi University, Suwon, Republic of Korea
* Corresponding Author: Hyunki Lim. Email: email

Computers, Materials & Continua https://doi.org/10.32604/cmc.2026.085049

Received 04 May 2026; Accepted 31 July 2026; Published online 18 August 2026

Abstract

Feature selection (FS) plays a crucial role in machine learning by reducing data dimensionality and improving learning efficiency. In many real-world scenarios, label information is unavailable, making unsupervised FS particularly important. While Genetic Algorithm (GA) offers a powerful global search mechanism for subset selection, it often suffers from premature convergence and struggles to refine solutions in complex search spaces. To address these limitations, we propose a hybrid GA that integrates an information-theoretic local search strategy for unsupervised FS. The proposed method integrates an information-theoretic local refinement procedure, consisting of DEL and ADD operations based on joint entropy, into a conventional GA framework. Unlike conventional evolutionary methods, our approach leverages information-theoretic measures not merely for evaluation, but as a guiding mechanism for fine-grained local exploration within the GA framework. By incorporating mutual information-based local refinement, the proposed method effectively overcomes the convergence bottlenecks of standard GAs, ensuring a more robust exploitation of feature dependencies. Experimental results on five datasets demonstrate that the proposed method consistently achieves higher clustering performance compared with conventional methods. These results imply that the proposed information-theoretic local refinement effectively mitigates the premature convergence problem of conventional GAs and improves search efficiency and solution quality compared to traditional heuristic and evolutionary approaches. It provides a promising framework for handling high-dimensional data in scenarios where label information is unavailable.

Keywords

Unsupervised learning; feature selection; mutual information; genetic algorithm; particle swarm optimization

  • 119

    View

  • 31

    Download

  • 0

    Like

Related articles
Copyright© 2026 Tech Science Press
© 1997-2026 TSP (Henderson, USA) unless otherwise stated

Share Link