[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/3067695.3082494acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
research-article

Variable selection as a non-completely decomposable problem: a case study in multivariate calibration

Published: 15 July 2017 Publication History

Abstract

Variable selection is a procedure used to choose a subset of features in order to extract information from them. It has been widely used in multivariate calibration together with statistical techniques to build a model from which it is possible to be interpreted by users. Genetic algorithms (GAs) have been successfully utilized as a variable selection method in multivariate calibration models. However, GAs solve a problem by trying different decompositions, and the variable selection problem usually can not be properly decomposed when there is considerable correlation among variables. Consequently GAs tend to lead to a poor variable selection performance if the variables interdepence is strong. This work comes from a doctoral thesis, which is still in development and aims to (not only) demonstrate that selecting variables in multivariate calibration is a non-completely decomposable problem. Based on the preliminary results, we are able to claim the viability of our initial hypothesis.

References

[1]
Chang Wook Ahn. 2006. Advances in evolutionary algorithms. Springer.
[2]
Michael Patrick Allen. 2004. The Problem of Multicollinearity In: Understanding Regression Analysis. Springer Science and Business Media.
[3]
Edward I. George. 2000. The variable selection problem. J. Amer. Statist. Assoc. 95, 452 (2000), 1304--1308.
[4]
John Kalivas. 1993. Mathematical analysis of spectral orthogonality. Vol. 17. CRC Press.
[5]
Harald Martens. 1991. Multivariate calibration. John Wiley & Sons.
[6]
Ali Niazi and Riccardo Leardi. 2012. Genetic algorithms in chemometrics. Journal of Chemometrics 26, 6 (2012), 345--351.
[7]
Lauro Cassio Martins Paula, Anderson Soares, Telma Lima, and Clarimar Coelho. 2016. Feature Selection using Genetic Algorithm: An Analysis of the Bias-Property for One-Point Crossover. In Proceedings of the 2016 on Genetic and Evolutionary Computation Conference Companion. ACM, 1461--1462.
[8]
Lauro Cassio Martins Paula, Anderson Silva Soares, Telma W. Lima, Clarimar Jose Coelho, and Arlindo R. G. Filho. 2016. Variable Selection for Multivariate Calibration in Chemometrics: A Real-World Application with Building Blocks Disruption Problem. In Proceedings of the 2016 on Genetic and Evolutionary Computation Conference (GECCO). ACM, 1031--1034.
[9]
Lauro Cassio Martins Paula, Anderson Silva Soares, Telma W. Lima, Alexandre C. B. Delbem, Clarimar J. Coelho, and Arlindo R. G. Filho. 2014. A GPU-Based Implementation of the Firefly Algorithm for Variable Selection in Multivariate Calibration Problems. Plos One 9, 12 (2014), e114145.
[10]
Martin Pelikan, David E Goldberg, and Erick Cantu-Paz. 2000. Linkage problem, distribution estimation, and Bayesian networks. Evolutionary computation 8, 3 (2000), 311--340.
[11]
Franz Rothlauf. 2011. Design of modern heuristics: principles and application. Springer Science & Business Media.
[12]
Richard A Watson, Gregory S Hornby, and Jordan B Pollack. 1998. Modeling building-block interdependency. In Int. Conf. on Parallel Problem Solving from Nature. Springer, 97--106.
[13]
Huirong Xu and Bing Qi. 2012. Var. selec. in vis. and NIR spectra: Appl. to on-line determ. of sugar content in pears. Journal of Food Engin. 109, 1 (2012), 142--147.

Cited By

View all
  1. Variable selection as a non-completely decomposable problem: a case study in multivariate calibration

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    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
    Permission to make digital or hard copies of all or part 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 components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 15 July 2017

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. decomposability
    2. genetic algorithms
    3. multivariate calibration
    4. variable selection

    Qualifiers

    • Research-article

    Funding Sources

    • FAPEG
    • CNPq
    • CAPES

    Conference

    GECCO '17
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)1
    • Downloads (Last 6 weeks)1
    Reflects downloads up to 01 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media