Computing a ranking network with confidence bounds from a graph-based beta random field (Q2901822)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6062310
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing a ranking network with confidence bounds from a graph-based beta random field |
scientific article; zbMATH DE number 6062310 |
Statements
31 July 2012
0 references
beta random field
0 references
information transitivity
0 references
nonlinear ranking hierarchy
0 references
paired comparison
0 references
rhesus macaque
0 references
Computing a ranking network with confidence bounds from a graph-based beta random field (English)
0 references
0.713944137096405
0 references
0.7097936868667603
0 references
0.6877236366271973
0 references
0.6856271624565125
0 references
0.6839265823364258
0 references
