Number of the records: 1  

On Locally Most Powerful Sequential Rank Tests

  1. 1.
    SYSNO ASEP0471297
    Document TypeJ - Journal Article
    R&D Document TypeJournal Article
    Subsidiary JČlánek ve WOS
    TitleOn Locally Most Powerful Sequential Rank Tests
    Author(s) Kalina, Jan (UIVT-O) RID, SAI, ORCID
    Source TitleSequential Analysis - ISSN 0747-4946
    Roč. 36, č. 1 (2017), s. 111-125
    Number of pages15 s.
    Languageeng - English
    CountryUS - United States
    Keywordsnonparametric tests ; sequential ranks ; stopping variable
    Subject RIVBA - General Mathematics
    OECD categoryPure mathematics
    R&D ProjectsGA17-07384S GA ČR - Czech Science Foundation (CSF)
    Institutional supportUIVT-O - RVO:67985807
    UT WOS000395716300012
    EID SCOPUS85014910914
    DOI10.1080/07474946.2016.1275501
    AnnotationSequential ranks are defined as ranks of such observations, which have been observed so far in a sequential design. This paper studies hypotheses tests based on sequential ranks for different situations. The locally most powerful sequential rank test is derived for the hypothesis of randomness against a general alternative, including the two-sample difference in location or regression in location as special cases for the alternative hypothesis. Further, the locally most powerful sequential rank tests are derived for the one-sample problem and for independence of two samples in an analogous spirit as the classical results of Hájek and Šidák (1967) for (classical) ranks. The locally most powerful tests are derived for a fixed sample size and the results bring arguments in favor of existing tests. In addition, we propose a sequential testing procedure based on these statistics of the locally most powerful tests. Principles of such sequential testing are explained on the two-sample Wilcoxon test based on sequential ranks.
    WorkplaceInstitute of Computer Science
    ContactTereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800
    Year of Publishing2018
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.