skip to main content
10.1145/3067695.3076020acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
poster

Feature selection using geometric semantic genetic programming

Authors Info & Claims
Published:15 July 2017Publication History

ABSTRACT

Feature selection concerns the task of finding the subset of features that are most relevant to some specific problem in the context of machine learning. During the last years, the problem of feature selection has been modeled as an optimization task, where the idea is to find the subset of features that maximize some fitness function, which can be a given classifier's accuracy or even some measure concerning the samples' separability in the feature space, for instance. In this paper, we introduced Geometric Semantic Genetic Programming (GSGP) in the context of feature selection, and we experimentally showed it can work properly with both conic and non-conic fitness landscapes.

References

  1. Fevzi Alimoglu and Ethem Alpaydin. 1996. Methods of combining multiple classifiers based on different representations for pen-based handwritten digit recognition. In Proceedings of the Fifth Turkish Artificial Intelligence and Artificial Neural Networks Symposium (TAINN 96. Citeseer.Google ScholarGoogle Scholar
  2. M. Castelli, R. Henriques, and L. Vanneschi. 2015. A geometric semantic genetic programming system for the electoral redistricting problem. Neurocomputing 154(2015), 200--207. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. R. A. Davis, A. J. Charlton, S. Oehlschlager, and J. C. Wilson. 2006. Novel feature selection method for genetic programming using metabolomic 1H {NMR} data. Chemometrics and Intelligent Laboratory Systems 81, 1 (2006), 50--59.Google ScholarGoogle ScholarCross RefCross Ref
  4. Chih-Wei Hsu and Chih-Jen Lin. 2002. A comparison of methods for multiclass support vector machines. IEEE transactions on Neural Networks 13, 2 (2002), 415--425. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. J.R. Koza. 1992. Genetic programming: on the programming of computers by means of natural selection. The MIT Press, Cambridge, USA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. J.-Y. Lin, H.-R. Ke, B.-C. Chien, and W.-P. Yang. 2008. Classifier Design with Feature Selection and Feature Extraction Using Layered Genetic Programming. Expert Systems with Applications: An International Journal 34, 2 (Feb. 2008), 1384--1393. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. A. Moraglio, K. Krawiec, and C. G. Johnson. 2012. Geometric Semantic Genetic Programming. Springer Berlin Heidelberg, Berlin, Heidelberg, 21--31. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. J. P. Papa, A. X. Falcão, V. H. C. Albuquerque, and J. M. R. S. Tavares. 2012. Efficient supervised optimum-path forest classification for large datasets. Pattern Recognition 45, 1 (2012), 512--520. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. J. P. Papa, A. X. Falcão, and C. T. N. Suzuki. 2009. Supervised pattern classification based on optimum-path forest. International Journal of Imaging Systems and Technology 19, 2 (2009), 120--131. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Ramirez R. and Puiggros M. 2007. A Genetic Programming Approach to Feature Selection and Classification of Instantaneous Cognitive States. Springer Berlin Heidelberg, Berlin, Heidelberg, 311--319. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. D. Rodrigues, X.-S. Yang, A. N. Souza, and J. P. Papa. 2015. Recent Advances in Swarm Intelligence and Evolutionary Computation. Springer International Publishing, Cham, Chapter Binary Flower Pollination Algorithm and Its Application to Feature Selection, 85--100.Google ScholarGoogle Scholar
  12. L. Vanneschi, S. Silva, M. Castelli, and L. Manzoni. 2014. Geometric Semantic Genetic Programming for Real Life Applications. Springer New York, New York, NY, 191--209.Google ScholarGoogle Scholar
  13. F. Wilcoxon. 1945. Individual Comparisons by Ranking Methods. Biometrics Bulletin 1, 6 (1945), 80--83.Google ScholarGoogle ScholarCross RefCross Ref
  14. J. Yang and V. G. Honavar. 1998. Feature Subset Selection Using a Genetic Algorithm. IEEE Intelligent Systems 13, 2 (March 1998), 44--49. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Feature selection using geometric semantic genetic programming

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      GECCO '17: Proceedings of the Genetic and Evolutionary Computation Conference Companion
      July 2017
      1934 pages
      ISBN:9781450349390
      DOI:10.1145/3067695

      Copyright © 2017 Owner/Author

      Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 15 July 2017

      Check for updates

      Qualifiers

      • poster

      Acceptance Rates

      Overall Acceptance Rate1,669of4,410submissions,38%

      Upcoming Conference

      GECCO '24
      Genetic and Evolutionary Computation Conference
      July 14 - 18, 2024
      Melbourne , VIC , Australia
    • Article Metrics

      • Downloads (Last 12 months)4
      • Downloads (Last 6 weeks)0

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader