Lataa...
Computing a ranking network with confidence bounds from a graph-based Beta random field
We address two largely overlooked, fundamental issues in computing a ranking hierarchy within a society: which information in the network is relevant, and what effect chance has on the hierarchy. To properly account for uncertainty from limited data, we construct a random field in a matrix form havi...
Tallennettuna:
| Julkaisussa: | Proc Math Phys Eng Sci |
|---|---|
| Päätekijät: | , , |
| Aineistotyyppi: | Artigo |
| Kieli: | Inglês |
| Julkaistu: |
The Royal Society Publishing
2011
|
| Aiheet: | |
| Linkit: | https://ncbi.nlm.nih.gov/pmc/articles/PMC4457085/ https://ncbi.nlm.nih.gov/pubmed/26052245 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1098/rspa.2011.0268 |
| Tagit: |
Lisää tagi
Ei tageja, Lisää ensimmäinen tagi!
|