Universal retrieval trees (Q1068838): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0166-218x(85)90031-9 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2042131308 / rank | |||
Normal rank |
Latest revision as of 12:08, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Universal retrieval trees |
scientific article |
Statements
Universal retrieval trees (English)
0 references
1985
0 references
A retrieval tree identifies members of a given set. The redundancy of a tree is defined to be the difference between the maximum length of a path in the tree and the binary logarithm of the cardinality of the set. Given a family \(\{A_{\theta}\}\) of sets, a retrieval tree is developed whose maximum redundancy over the family is minimum. The tree is used to make a biological key. The probabilistic variant of the problem is discussed.
0 references
subgenera of ants
0 references
retrieval tree
0 references
redundancy of a tree
0 references
0 references