All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Genetic algorithm for entropy-based feature subset selection

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F16%3A86099084" target="_blank" >RIV/61989100:27240/16:86099084 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1109/CEC.2016.7744360" target="_blank" >http://dx.doi.org/10.1109/CEC.2016.7744360</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/CEC.2016.7744360" target="_blank" >10.1109/CEC.2016.7744360</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Genetic algorithm for entropy-based feature subset selection

  • Original language description

    The data-driven society of today generates very large volumes of high-dimensional data. Its efficient processing by established methods represents an increasing challenge and novel advanced approaches are needed. Feature selection is a traditional data pre-processing strategy that can be used to reduce the volume and complexity of data. It selects a subset of data features so that data volume is reduced but its information content maintained. Evolutionary feature selection methods have already shown good ability to identify in very-high-dimensional data sets feature subsets according to selected criteria. Their efficiency depends, among others, on feature subset representation and objective function definition. This work employs a recent genetic algorithm for fixed-length subset selection to find feature subsets on the basis of their entropy, estimated by a fast data compression method. The reasonability of this new fitness criterion and the usefulness of selected feature subsets for practical data mining is evaluated using well-known data sets and several widely-used classification algorithms. (C) 2016 IEEE.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GJ16-25694Y" target="_blank" >GJ16-25694Y: Multi-paradigm data mining algorithms based on information retrieval, fuzzy, and bio-inspired methods</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2016

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    2016 IEEE Congress on Evolutionary Computation, CEC 2016

  • ISBN

    978-1-5090-0622-9

  • ISSN

  • e-ISSN

  • Number of pages

    8

  • Pages from-to

    4486-4493

  • Publisher name

    Institute of Electrical and Electronics Engineers

  • Place of publication

    New York

  • Event location

    Vancouver

  • Event date

    Jul 24, 2016

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000390749104088