Predicting cryptic links in host-parasite networks

Tad Dallas, Andrew W Park and John M Drake

PLOS Computational Biology, 2017, vol. 13, issue 5, 1-15

Abstract: Networks are a way to represent interactions among one (e.g., social networks) or more (e.g., plant-pollinator networks) classes of nodes. The ability to predict likely, but unobserved, interactions has generated a great deal of interest, and is sometimes referred to as the link prediction problem. However, most studies of link prediction have focused on social networks, and have assumed a completely censused network. In biological networks, it is unlikely that all interactions are censused, and ignoring incomplete detection of interactions may lead to biased or incorrect conclusions. Previous attempts to predict network interactions have relied on known properties of network structure, making the approach sensitive to observation errors. This is an obvious shortcoming, as networks are dynamic, and sometimes not well sampled, leading to incomplete detection of links. Here, we develop an algorithm to predict missing links based on conditional probability estimation and associated, node-level features. We validate this algorithm on simulated data, and then apply it to a desert small mammal host-parasite network. Our approach achieves high accuracy on simulated and observed data, providing a simple method to accurately predict missing links in networks without relying on prior knowledge about network structure.Author summary: The majority of host-parasite associations are poorly understood or not known at all because the number of associations is so vast. Further, interactions may shift seasonally, or as a function of changing host densities. Consequently, host-parasite networks may be poorly characterized since effects of cryptic host-parasite associations on network structure are unknown. To address this, we developed theory and applied it to empirical data to test the ability of a simple algorithm to predict interactions between hosts and parasites. The algorithm uses host and parasite trait data to train predictive probabilistic models of host-parasite interaction. We tested the accuracy of our approach using simulated networks that vary greatly in their properties, demonstrating high accuracy and robustness. We then applied this algorithm to data on a small mammal host-parasite network, estimated model accuracy, identified host and parasite traits important to prediction, and quantified expected changes to structural properties of the network as a result of link relabeling.

Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1005557 (text/html)
https://journals.plos.org/ploscompbiol/article/fil ... 05557&type=printable (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:plo:pcbi00:1005557

DOI: 10.1371/journal.pcbi.1005557

Access Statistics for this article

More articles in PLOS Computational Biology from Public Library of Science
Bibliographic data for series maintained by ploscompbiol ().