nondeterministicRanking

The "degree of determinism" of the ranking to create.


Create a permutation of the sequence <code>s</code> = <code>1:l</code> representing a ranking.
If <code>p</code> = 1, the ranking will be completely deterministic, i.e. equal to
<code>1:l</code>. If <code>p</code> = 0, the ranking will be completely random. If
0 < <code>p</code> < 1, the places in the ranking will be determined by iterative
weighted sampling without replacement from the sequence <code>s</code> := <code>1:l</code>.
At each step of this iterated weighted sampling, the first remaining element of
<code>s</code> will be selected with probability <code>p</code>, the second element with
probability <code>p * (1 - p)</code>, the third element with probability
<code>p * (1 - p) ^ 2</code>, and so forth.


RGP is a simple modular Genetic Programming (GP) system build in
pure R. In addition to general GP tasks, the system supports Symbolic
Regression by GP through the familiar R model formula interface. GP
individuals are represented as R expressions, an (optional) type system
enables domain-specific function sets containing functions of diverse
domain- and range types. A basic set of genetic operators for variation
(mutation and crossover) and selection is provided.

nondeterministicRanking: Create a nondeterministic ranking

Description

Usage

Arguments

Value