Difference between revisions of "Character selection algorithms"
From Species-ID
m |
|||
| Line 4: | Line 4: | ||
* [[Character Entropy]] | * [[Character Entropy]] | ||
| − | * [[BEST - | + | * [[BEST - Dallwitz 1974]] |
* [[Information Gain]] | * [[Information Gain]] | ||
* [[Disconnectivity]] | * [[Disconnectivity]] | ||
Latest revision as of 20:49, 5 April 2011
In a multi-access identification key ("matrix key", e.g. DELTA, Lucid, or xper2), the user selects from a list of all characters or features. However, selecting a good character from a long list of alphabetically or hierarchically ordered characters is a significant task. Character selection is therefore often algorithmically supported. Similarly, where a single-access key (= dichotomous or polytomous) is created from a matrix, a selection of best characters is necessary. This page gives an overview over some suitable algorithms.
Please contribute with more information on the read links not elaborated yet, or adding further algorithms!
