Simulated Annealing Model Search for Subset Selection in Screening Experiments

被引:16
|
作者
Wolters, Mark A. [1 ]
Bingham, Derek [2 ]
机构
[1] Univ Western Ontario, Dept Stat & Actuarial Sci, London, ON N6A 5B7, Canada
[2] Simon Fraser Univ, Dept Stat & Actuarial Sci, Burnaby, BC V5A 1S6, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Linear regression; Model selection; Nonregular factorial design; BAYESIAN VARIABLE-SELECTION; DESIGNED EXPERIMENTS;
D O I
10.1198/TECH.2011.08157
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
The analysis of screening experiments based on nonregular designs can lead to a model selection problem in which the number of variables is large, the number of trials is small, and there are constraints on model structure. Common subset selection methods do not perform well in this setting. We propose a new approach particularly well suited to screening. The method uses an intentionally nonconvergent stochastic search to generate a large set of well-fitting models, each with the same number of variables. Model selection is then viewed as a feature extraction problem from this set. An easy-to-use graphical method and an automatic approach are proposed to determine the best models. Computer code and additional supplementary materials are available online.
引用
收藏
页码:225 / 237
页数:13
相关论文
共 50 条
  • [1] A simulated annealing approach to subset selection for the identification of epistasis
    Wilcox, MA
    Patel, N
    Faraone, SV
    Su, J
    Tsuang, MT
    AMERICAN JOURNAL OF MEDICAL GENETICS, 2001, 105 (07): : 643 - 643
  • [2] Feature Subset Selection within a Simulated Annealing Data Mining Algorithm
    Debuse J.C.W.
    Rayward-Smith V.J.
    Journal of Intelligent Information Systems, 1997, 9 (1) : 57 - 81
  • [3] Classical model selection via simulated annealing
    Brooks, SP
    Friel, N
    King, R
    JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-STATISTICAL METHODOLOGY, 2003, 65 : 503 - 520
  • [4] Subset selection in multiple linear regression models: A hybrid of genetic and simulated annealing algorithms
    Orkcu, H. Hasan
    APPLIED MATHEMATICS AND COMPUTATION, 2013, 219 (23) : 11018 - 11028
  • [5] Program Search with Simulated Annealing
    Miki, Mitsunori
    Hashimoto, Masafumi
    Fujita, Yoshihisa
    GECCO 2007: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOL 1 AND 2, 2007, : 1754 - 1754
  • [6] Subset selection of best simulated systems
    Alrefaei, Mahmoud H.
    Almomani, Mohammad
    JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 2007, 344 (05): : 495 - 506
  • [7] Experiments on Greedy and Local Search Heuristics for d-dimensional Hypervolume Subset Selection
    Basseur, Matthieu
    Derbel, Bilel
    Goeffon, Adrien
    Liefooghe, Arnaud
    GECCO'16: PROCEEDINGS OF THE 2016 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2016, : 541 - 548
  • [8] EXPERIMENTS IN PROJECTION AND CLUSTERING BY SIMULATED ANNEALING
    KLEIN, RW
    DUBES, RC
    PATTERN RECOGNITION, 1989, 22 (02) : 213 - 220
  • [9] Simulated annealing for supervised gene selection
    Filippone, Maurizio
    Masulli, Francesco
    Rovetta, Stefano
    SOFT COMPUTING, 2011, 15 (08) : 1471 - 1482
  • [10] Solvent subset selection for polymorph screening
    Alleso, Morten
    Rantanen, Jukka
    Aaltonen, Jaakko
    Cornett, Claus
    van den Berg, Frans
    JOURNAL OF CHEMOMETRICS, 2008, 22 (11-12) : 621 - 631