본문 바로가기
  • Home

Information Theoretic Local Refinement for Genetic Algorithm based Unsupervised Feature Selection

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2026, 31(1), pp.69~76
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science
  • Received : November 26, 2025
  • Accepted : December 22, 2025
  • Published : January 30, 2026

Hyunki Lim 1

1경기대학교

Accredited

ABSTRACT

Unsupervised feature selection (UFS) aims to identify a compact subset of features that preserves the intrinsic structure of high-dimensional data without relying on label information. However, the search space of feature subsets is combinatorially large and the evaluation criteria are often non-differentiable, making heuristic and evolutionary search approaches particularly suitable. In this paper, we propose a novel wrapper-based UFS method that integrates a genetic algorithm (GA) with an information-theoretic refinement mechanism. The proposed DEL and ADD operators adaptively remove or add features based on entropy and mutual information criteria, enabling each chromosome to evolve toward a more informative and compact subset. This hybrid strategy effectively combines GA’s global exploration capability with principled local adjustments. Experimental results on multiple benchmark datasets demonstrate that the proposed method outperforms existing GA-based UFS methods in terms of structure preservation, subset compactness, and overall clustering performance.

Citation status

* References for papers published after 2024 are currently being built.