Feature selection by reordering

  • Authors:
  • Marcel Jirina;Marcel Jirina

  • Affiliations:
  • Institute of Computer Science, Prague 8 – Liben, Czech Republic;Center of Applied Cybernetics, FEE, CTU Prague, Prague 6 – Dejvice, Czech Republic

  • Venue:
  • SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Feature selection serves for both reduction of the total amount of available data (removing of valueless data) and improvement of the whole behavior of a given induction algorithm (removing data that cause deterioration of the results). A method of proper selection of features for an inductive algorithm is discussed. The main idea consists in proper descending ordering of features according to a measure of new information contributing to previous valuable set of features. The measure is based on comparing of statistical distributions of individual features including mutual correlation. A mathematical theory of the approach is described. Results of the method applied to real-life data are shown.