A brief note on a new faster covariate's selection (fCovSel) algorithm

被引:1
|
作者
Mishra, Puneet [1 ]
机构
[1] Wageningen Food & Biobased Res, Bornse Weilanden 9,POB 17, NL-6700 AA Wageningen, Netherlands
关键词
data compression; feature selection; latent space modeling; multivariate; VARIABLE SELECTION; REGRESSION;
D O I
10.1002/cem.3397
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Covariate's selection (CovSel) is a variable selection technique in the domain of chemometrics and is commonly used for extracting variables carrying high covariance with response variables. CovSel is a special case of partial least square analysis, where at each weight estimation step, the weight vector is of the binary form to select the variables. In the earlier algorithm of the CovSel which is identical to the nonlinear iterative partial least square (NIPALS), there is a key step of predictor matrix deflation which makes it a time-consuming approach leading to longer time consumption during tasks such as cross-validation or in multiblock multiway CovSel scenarios where a wide number of variables combinations are usually explored for model optimization. We present a new CovSel algorithm called faster CovSel (fCovSel) which drops the need for predictor matrix deflation. By dropping the predictor matrix deflation step, the method naturally becomes faster than the CovSel based on NIPALS. Mathematical and analytical comparisons of the CovSel and the fCovSel in terms of achieving the same solution and time requirements are presented.
引用
收藏
页数:8
相关论文
共 50 条
  • [1] NEW MUTATION OPERATION FOR FASTER CONVERGENCE IN GENETIC ALGORITHM FEATURE SELECTION
    Yusof, Rubiyah
    Khairuddin, Uswah
    Khalid, Marzuki
    INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2012, 8 (10B): : 7363 - 7379
  • [2] A BRIEF NOTE ON PALLEY'S CRITICISM OF NEW DEVELOPMENTALISM
    Oreiro, Jose Luis
    de Paula, Luiz Fernando
    INVESTIGACION ECONOMICA, 2022, 81 (320): : 3 - 17
  • [3] A NOTE ON A FASTER APPROXIMATION ALGORITHM FOR THE STEINER PROBLEM IN GRAPHS
    FLOREN, R
    INFORMATION PROCESSING LETTERS, 1991, 38 (04) : 177 - 178
  • [4] A BRIEF NOTE ON A NEW BEGINNING
    KNOBLAUCH, SH
    PSYCHOANALYTIC PSYCHOLOGY, 1995, 12 (02) : 297 - 303
  • [5] An improved DNS server selection algorithm for faster lookups
    Deb, Supratim
    Srinivasan, Anand
    Pavan, Sreenivasa Kuppili
    2008 3RD INTERNATIONAL CONFERENCE ON COMMUNICATION SYSTEM SOFTWARE AND MIDDLEWARE AND WORKSHOPS, VOLS 1 AND 2, 2008, : 288 - 295
  • [6] A Faster Clonal Selection Algorithm for Expensive Optimization Problems
    Bernardino, Heder S.
    Barbosa, Helio J. C.
    Fonseca, Leonardo G.
    ARTIFICIAL IMMUNE SYSTEMS, 2010, 6209 : 130 - 143
  • [7] Making path selection faster: a routing algorithm for ONoC
    Zhu, Lijing
    Gu, Huaxi
    Yang, Yintang
    Chen, Yawen
    OPTICS EXPRESS, 2021, 29 (07) : 10221 - 10235
  • [8] Go beyond the limits of genetic algorithm in daily covariate selection practice
    D. Ronchi
    E. M. Tosca
    R. Bartolucci
    P. Magni
    Journal of Pharmacokinetics and Pharmacodynamics, 2024, 51 : 109 - 121
  • [9] Go beyond the limits of genetic algorithm in daily covariate selection practice
    Ronchi, D.
    Tosca, E. M.
    Bartolucci, R.
    Magni, P.
    JOURNAL OF PHARMACOKINETICS AND PHARMACODYNAMICS, 2024, 51 (02) : 109 - 121
  • [10] A new faster sequence pair algorithm
    Lin, C
    Leenaerts, DMW
    ISCAS 2000: IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS - PROCEEDINGS, VOL III: EMERGING TECHNOLOGIES FOR THE 21ST CENTURY, 2000, : 407 - 410