View in EDS HTML Full Text PDF Full Text

Feature selection, construction and search space reduction based on genetic programming for high-dimensional datasets.

Saved in:
Bibliographic Details
Title: Feature selection, construction and search space reduction based on genetic programming for high-dimensional datasets.
Authors: Herrera-Sánchez, David1 (AUTHOR) hersan19@hotmail.es, Mezura-Montes, Efrén1 (AUTHOR) emezura@uv.mx, Acosta-Mesa, Héctor-Gabriel1 (AUTHOR) heacosta@uv.mx, Márquez-Grajales, Aldo1 (AUTHOR) li.aldomg@gmail.com
Source: Neural Computing & Applications. Nov2025, Vol. 37 Issue 33, p27557-27574. 18p.
Subjects: Feature selection, Genetic programming, Heuristic, Classification
Abstract: Nowadays, analyzing high-dimensional data containing thousands of features is utmost importance. As a result, the classification task has become challenging due to the computational cost necessary to achieve competitive accuracy levels. However, feature selection and construction have emerged as solutions to this problem during preprocessing. The primary objective of these techniques is to identify the most pertinent features from the dataset, which diminishes the run-time during the learning process and improves the classification accuracy. Genetic programming can efficiently handle these preprocessing techniques automatically and cohesively by utilizing tree representation. This paper outlines a method for narrowing the search space in high-dimensional datasets through a simple heuristic that eliminates irrelevant features during the search process. This approach reduces the search area, ensuring that only the most representative features for the chosen classifier are selected. The paper uses twelve datasets. The first subset ranges from three hundred to seven thousand features. The second subset ranges from ten thousand to twenty-four thousand features, and the third subset only contains a dataset with more than one hundred thirty thousand features. The findings indicate that the search area can be decreased by over 50% without impacting the classification accuracy. Furthermore, the convergence of the optimal solutions using the heuristic is improved regardless of not using it, achieving values of accuracy higher than 95% of classification. [ABSTRACT FROM AUTHOR]
Copyright of Neural Computing & Applications is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Full text is not displayed to guests.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: egs
DbLabel: Engineering Source
An: 189054789
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Feature selection, construction and search space reduction based on genetic programming for high-dimensional datasets.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Herrera-Sánchez%2C+David%22">Herrera-Sánchez, David</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> hersan19@hotmail.es</i><br /><searchLink fieldCode="AR" term="%22Mezura-Montes%2C+Efrén%22">Mezura-Montes, Efrén</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> emezura@uv.mx</i><br /><searchLink fieldCode="AR" term="%22Acosta-Mesa%2C+Héctor-Gabriel%22">Acosta-Mesa, Héctor-Gabriel</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> heacosta@uv.mx</i><br /><searchLink fieldCode="AR" term="%22Márquez-Grajales%2C+Aldo%22">Márquez-Grajales, Aldo</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> li.aldomg@gmail.com</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Neural+Computing+%26+Applications%22">Neural Computing & Applications</searchLink>. Nov2025, Vol. 37 Issue 33, p27557-27574. 18p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Feature+selection%22">Feature selection</searchLink><br /><searchLink fieldCode="DE" term="%22Genetic+programming%22">Genetic programming</searchLink><br /><searchLink fieldCode="DE" term="%22Heuristic%22">Heuristic</searchLink><br /><searchLink fieldCode="DE" term="%22Classification%22">Classification</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Nowadays, analyzing high-dimensional data containing thousands of features is utmost importance. As a result, the classification task has become challenging due to the computational cost necessary to achieve competitive accuracy levels. However, feature selection and construction have emerged as solutions to this problem during preprocessing. The primary objective of these techniques is to identify the most pertinent features from the dataset, which diminishes the run-time during the learning process and improves the classification accuracy. Genetic programming can efficiently handle these preprocessing techniques automatically and cohesively by utilizing tree representation. This paper outlines a method for narrowing the search space in high-dimensional datasets through a simple heuristic that eliminates irrelevant features during the search process. This approach reduces the search area, ensuring that only the most representative features for the chosen classifier are selected. The paper uses twelve datasets. The first subset ranges from three hundred to seven thousand features. The second subset ranges from ten thousand to twenty-four thousand features, and the third subset only contains a dataset with more than one hundred thirty thousand features. The findings indicate that the search area can be decreased by over 50% without impacting the classification accuracy. Furthermore, the convergence of the optimal solutions using the heuristic is improved regardless of not using it, achieving values of accuracy higher than 95% of classification. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Neural Computing & Applications is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=189054789
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s00521-024-10567-7
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 18
        StartPage: 27557
    Subjects:
      – SubjectFull: Feature selection
        Type: general
      – SubjectFull: Genetic programming
        Type: general
      – SubjectFull: Heuristic
        Type: general
      – SubjectFull: Classification
        Type: general
    Titles:
      – TitleFull: Feature selection, construction and search space reduction based on genetic programming for high-dimensional datasets.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Herrera-Sánchez, David
      – PersonEntity:
          Name:
            NameFull: Mezura-Montes, Efrén
      – PersonEntity:
          Name:
            NameFull: Acosta-Mesa, Héctor-Gabriel
      – PersonEntity:
          Name:
            NameFull: Márquez-Grajales, Aldo
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 21
              M: 11
              Text: Nov2025
              Type: published
              Y: 2025
          Identifiers:
            – Type: issn-print
              Value: 09410643
          Numbering:
            – Type: volume
              Value: 37
            – Type: issue
              Value: 33
          Titles:
            – TitleFull: Neural Computing & Applications
              Type: main
ResultId 1