IDEAS home Printed from https://ideas.repec.org/a/eee/csdana/v122y2018icp1-17.html
   My bibliography  Save this article

Optimal exact tests for multiple binary endpoints

Author

Listed:
  • Ristl, Robin
  • Xi, Dong
  • Glimm, Ekkehard
  • Posch, Martin

Abstract

In confirmatory clinical trials with small sample sizes, hypothesis tests based on asymptotic distributions are often not valid and exact non-parametric procedures are applied instead. However, the latter are based on discrete test statistics and can become very conservative, even more so, if adjustments for multiple testing as the Bonferroni correction are applied. Improved exact multiple testing procedures are proposed for the setting where two parallel groups are compared in multiple binary endpoints. Based on the joint conditional distribution of test statistics of Fisher’s exact tests, optimal rejection regions for intersection hypothesis tests are constructed utilizing different objective functions. Depending on the optimization objective, the optimal test yields maximal power under a specific alternative, maximal exhaustion of the nominal type I error rate, or the largest possible rejection region controlling the type I error rate. To efficiently search the large space of possible rejection regions, an optimization algorithm based on constrained optimization and integer linear programming is proposed. Applying the closed testing principle, optimized multiple testing procedures with strong familywise error rate control are constructed. Furthermore, a computationally efficient greedy algorithm for nearly optimal tests is proposed. The unconditional power of the optimized procedures is numerically compared to the power of alternative approaches and the optimal tests are illustrated with a clinical trial example in a rare disease. The described methods are implemented in the R package multfisher.

Suggested Citation

  • Ristl, Robin & Xi, Dong & Glimm, Ekkehard & Posch, Martin, 2018. "Optimal exact tests for multiple binary endpoints," Computational Statistics & Data Analysis, Elsevier, vol. 122(C), pages 1-17.
  • Handle: RePEc:eee:csdana:v:122:y:2018:i:c:p:1-17
    DOI: 10.1016/j.csda.2018.01.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167947318300021
    Download Restriction: Full text for ScienceDirect subscribers only.

    File URL: https://libkey.io/10.1016/j.csda.2018.01.001?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Fortemps, Ph. & Ost, Ch. & Pirlot, M. & Teghem, J. & Tuyttens, D., 1996. "Using metaheuristics for solving a production scheduling problem in a chemical firm. A case study," International Journal of Production Economics, Elsevier, vol. 46(1), pages 13-26, December.
    2. B. Klingenberg & A. Solari & L. Salmaso & F. Pesarin, 2009. "Testing Marginal Homogeneity Against Stochastic Order in Multivariate Ordinal Data," Biometrics, The International Biometric Society, vol. 65(2), pages 452-462, June.
    3. Fortunato Pesarin, 2015. "Some Elementary Theory of Permutation Tests," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 44(22), pages 4880-4892, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. De Keyser, Arne & Bart, Yakov & Gu, Xian & Liu, Stephanie Q. & Robinson, Stacey G. & Kannan, P.K., 2021. "Opportunities and challenges of using biometrics for business: Developing a research agenda," Journal of Business Research, Elsevier, vol. 136(C), pages 52-62.
    2. Keskiner, Hilal & Gür, Bekir S., 2023. "Questioning merit-based scholarships at nonprofit private universities: Lessons from Turkey," International Journal of Educational Development, Elsevier, vol. 97(C).
    3. Wang, Li, 2022. "New testing procedures with k-FWER control for discrete data," Statistics & Probability Letters, Elsevier, vol. 180(C).
    4. Ruth Heller & Abba Krieger & Saharon Rosset, 2023. "Optimal multiple testing and design in clinical trials," Biometrics, The International Biometric Society, vol. 79(3), pages 1908-1919, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Arboretti, Rosa & Bonnini, Stefano & Corain, Livio & Salmaso, Luigi, 2014. "A permutation approach for ranking of multivariate populations," Journal of Multivariate Analysis, Elsevier, vol. 132(C), pages 39-57.
    2. Winker, Peter & Gilli, Manfred, 2004. "Applications of optimization heuristics to estimation and modelling problems," Computational Statistics & Data Analysis, Elsevier, vol. 47(2), pages 211-223, September.
    3. Portmann, M. -C. & Vignier, A. & Dardilhac, D. & Dezalay, D., 1998. "Branch and bound crossed with GA to solve hybrid flowshops," European Journal of Operational Research, Elsevier, vol. 107(2), pages 389-400, June.
    4. Rosa Arboretti & Fortunato Pesarin & Luigi Salmaso, 2021. "A unified approach to permutation testing for equivalence," Statistical Methods & Applications, Springer;Società Italiana di Statistica, vol. 30(3), pages 1033-1052, September.
    5. Jesse Hemerik & Jelle J. Goeman, 2021. "Another Look at the Lady Tasting Tea and Differences Between Permutation Tests and Randomisation Tests," International Statistical Review, International Statistical Institute, vol. 89(2), pages 367-381, August.
    6. Jesse Hemerik & Jelle J. Goeman & Livio Finos, 2020. "Robust testing in generalized linear models by sign flipping score contributions," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 82(3), pages 841-864, July.
    7. Ho, Nhu Binh & Tay, Joc Cing & Lai, Edmund M.-K., 2007. "An effective architecture for learning and evolving flexible job-shop schedules," European Journal of Operational Research, Elsevier, vol. 179(2), pages 316-333, June.
    8. Seongoh Park & Johan Lim & Xinlei Wang & Sanghan Lee, 2019. "Permutation based testing on covariance separability," Computational Statistics, Springer, vol. 34(2), pages 865-883, June.
    9. Allahverdi, Ali & Soroush, H.M., 2008. "The significance of reducing setup times/setup costs," European Journal of Operational Research, Elsevier, vol. 187(3), pages 978-984, June.
    10. Nait Tahar, Djamel & Yalaoui, Farouk & Chu, Chengbin & Amodeo, Lionel, 2006. "A linear programming approach for identical parallel machine scheduling with job splitting and sequence-dependent setup times," International Journal of Production Economics, Elsevier, vol. 99(1-2), pages 63-73, February.
    11. Li, Hui-Qiong & Tian, Guo-Liang & Jiang, Xue-Jun & Tang, Nian-Sheng, 2016. "Testing hypothesis for a simple ordering in incomplete contingency tables," Computational Statistics & Data Analysis, Elsevier, vol. 99(C), pages 25-37.
    12. Peter H. Westfall & James F. Troendle & Gene Pennello, 2010. "Multiple McNemar Tests," Biometrics, The International Biometric Society, vol. 66(4), pages 1185-1191, December.
    13. Jesse Hemerik & Jelle Goeman, 2018. "Exact testing with random permutations," TEST: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 27(4), pages 811-825, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:csdana:v:122:y:2018:i:c:p:1-17. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/csda .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.