Premium
General scores statistics on ranks in the analysis of unbalanced designs
Author(s) -
Alvo Mayer,
Cabilio Paul
Publication year - 2005
Publication title -
canadian journal of statistics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.804
H-Index - 51
eISSN - 1708-945X
pISSN - 0319-5724
DOI - 10.1002/cjs.5540330109
Subject(s) - mathematics , combinatorics , statistic , statistics , similarity (geometry) , ranking (information retrieval) , humanities , philosophy , artificial intelligence , computer science , image (mathematics)
The authors consider the situation of incomplete rankings in which n judges independently rank k i ∈ {2, …, t } objects. They wish to test the null hypothesis that each judge picks the ranking at random from the space of k i ! permutations of the integers 1, …, k i . The statistic considered is a generalization of the Friedman test in which the ranks assigned by each judge are replaced by real‐valued functions a ( j, k i ), 1 ≤ j ≤ k i ≤ t of the ranks. The authors define a measure of pairwise similarity between complete rankings based on such functions, and use averages of such similarities to construct measures of the level of concordance of the judges' rankings. In the complete ranking case, the resulting statistics coincide with those defined by Hájek & Šidák (1967, p. 118), and Sen (1968). These measures of similarity are extended to the situation of incomplete rankings. A statistic is derived in this more general situation and its properties are investigated.