ranking: Rankings

In relations: Data Structures and Algorithms for Relations

Rankings

Description

Creates a ranking object.

Usage

ranking(x, domain = NULL, decreasing = TRUE, complete = FALSE)
as.ranking(x, ...)
is.ranking(x)

Arguments

x	For ranking(): either an atomic vector interpreted as labels of the ranked objects, or as their scores in case of a named numeric vector (with the names giving the labels), or a list of atomic vectors representing equivalence classes of labels. For as.ranking(): an R object coercible to a ranking object (including relation objects).
domain	object coercible to a set, from which the labels usable in x are derived. If NULL, it is created from x.
decreasing	logical indicating whether the ranking orders objects from the best to the worst (TRUE), or the other way round.
complete	logical specifying whether missing values should be imputed, if any. Missing elements are those from domain not used in x. If decreasing is TRUE (FALSE), all missings are ranked tied behind (ahead) the worst (best) ranked object.
...	currently not used.

Value

An object of class ranking.

See Also

relation()

Examples

## simple rankings
OBJECTS <- c("Apples", "Bananas", "Oranges", "Lemons")
print(R <- ranking(OBJECTS))
ranking(OBJECTS[2:4], domain = OBJECTS)
ranking(OBJECTS[2:4], domain = OBJECTS, complete = TRUE)

## ranking with ties (weak orders)
ranking(list(c("PhD", "MD"), "MSc", c("BSc", "BA")))

## ranking A > B ~ C with D missing:
ranking(c(A = 1, B = 2, C = 2, D = NA))

## coercion functions
identical(as.ranking(as.relation(R)), R)

relations documentation built on March 7, 2023, 8:01 p.m.