An information theoretical algorithm for analyzing supersaturated designs for a binary response

DOI10.1007/s00184-011-0373-5OpenAlexW2093931098MaRDI QIDQ1938876

C. Parpoula, Christos Koukouvinos, Narayanaswamy Balakrishnan

Publication date: 25 February 2013

Published in: Metrika (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00184-011-0373-5

zbMATH Keywords

entropygeneralized linear modelsROCinformation gainerror ratesfactor screeningsymmetrical uncertainty

Mathematics Subject Classification ID

Statistics (62-XX)

Related Items

Analyzing supersaturated designs for discrete responses via generalized linear models ⋮ On the analysis of unbalanced two-level supersaturated designs via generalized linear models

Cites Work

• Unnamed Item
• Unnamed Item
• Analysis of supersaturated designs via the Dantzig selector
• Data analysis in supersaturated designs.
• Possible generalization of Boltzmann-Gibbs statistics.
• The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
• Bayesian D-optimal supersaturated designs
• \(E(s^{2})\)-optimal and minimax-optimal cyclic supersaturated designs via multi-objective simulated annealing
• An Analysis for Unreplicated Fractional Factorials
• A method for constructing supersaturated designs and its Es² optimality
• A Bayesian Variable-Selection Approach for Analyzing Designed Experiments with Complex Aliasing
• An Interpretation for the ROC Curve and Inference Using GLM Procedures
• Generating Systematic Supersaturated Designs