IDEAS home Printed from https://ideas.repec.org/a/plo/pcbi00/1005557.html
   My bibliography  Save this article

Predicting cryptic links in host-parasite networks

Author

Listed:
  • Tad Dallas
  • Andrew W Park
  • John M Drake

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.

Suggested Citation

  • Tad Dallas & Andrew W Park & John M Drake, 2017. "Predicting cryptic links in host-parasite networks," PLOS Computational Biology, Public Library of Science, vol. 13(5), pages 1-15, May.
  • Handle: RePEc:plo:pcbi00:1005557
    DOI: 10.1371/journal.pcbi.1005557
    as

    Download full text from publisher

    File URL: https://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1005557
    Download Restriction: no

    File URL: https://journals.plos.org/ploscompbiol/article/file?id=10.1371/journal.pcbi.1005557&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pcbi.1005557?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. David Liben‐Nowell & Jon Kleinberg, 2007. "The link‐prediction problem for social networks," Journal of the American Society for Information Science and Technology, Association for Information Science & Technology, vol. 58(7), pages 1019-1031, May.
    2. Matthias Schmid & Florian Wickler & Kelly O Maloney & Richard Mitchell & Nora Fenske & Andreas Mayr, 2013. "Boosted Beta Regression," PLOS ONE, Public Library of Science, vol. 8(4), pages 1-15, April.
    3. Hayfield, Tristen & Racine, Jeffrey S., 2008. "Nonparametric Econometrics: The np Package," Journal of Statistical Software, Foundation for Open Access Statistics, vol. 27(i05).
    4. Phillip P. A. Staniczenko & Jason C. Kopp & Stefano Allesina, 2013. "The ghost of nestedness in ecological networks," Nature Communications, Nature, vol. 4(1), pages 1-6, June.
    5. Lü, Linyuan & Zhou, Tao, 2011. "Link prediction in complex networks: A survey," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(6), pages 1150-1170.
    6. Olaf R. P. Bininda-Emonds & Marcel Cardillo & Kate E. Jones & Ross D. E. MacPhee & Robin M. D. Beck & Richard Grenyer & Samantha A. Price & Rutger A. Vos & John L. Gittleman & Andy Purvis, 2007. "The delayed rise of present-day mammals," Nature, Nature, vol. 446(7135), pages 507-512, March.
    7. Alex James & Jonathan W. Pitchford & Michael J. Plank, 2012. "Disentangling nestedness from models of ecological complexity," Nature, Nature, vol. 487(7406), pages 227-230, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Pavel B. Klimov & Qixin He, 2024. "Predicting host range expansion in parasitic mites using a global mammalian-acarine dataset," Nature Communications, Nature, vol. 15(1), pages 1-14, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Karimi, Fatemeh & Lotfi, Shahriar & Izadkhah, Habib, 2021. "Community-guided link prediction in multiplex networks," Journal of Informetrics, Elsevier, vol. 15(4).
    2. Xu, Hua & Wang, Minggang & Jiang, Shumin & Yang, Weiguo, 2020. "Carbon price forecasting with complex network and extreme learning machine," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 545(C).
    3. Andreas Spitz & Anna Gimmler & Thorsten Stoeck & Katharina Anna Zweig & Emőke-Ágnes Horvát, 2016. "Assessing Low-Intensity Relationships in Complex Networks," PLOS ONE, Public Library of Science, vol. 11(4), pages 1-17, April.
    4. Qiaoran Yang & Zhiliang Dong & Yichi Zhang & Man Li & Ziyi Liang & Chao Ding, 2021. "Who Will Establish New Trade Relations? Looking for Potential Relationship in International Nickel Trade," Sustainability, MDPI, vol. 13(21), pages 1-15, October.
    5. Aslan, Serpil & Kaya, Buket & Kaya, Mehmet, 2019. "Predicting potential links by using strengthened projections in evolving bipartite networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 525(C), pages 998-1011.
    6. Leto Peel & Tiago P. Peixoto & Manlio De Domenico, 2022. "Statistical inference links data and theory in network science," Nature Communications, Nature, vol. 13(1), pages 1-15, December.
    7. Rafiee, Samira & Salavati, Chiman & Abdollahpouri, Alireza, 2020. "CNDP: Link prediction based on common neighbors degree penalization," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 539(C).
    8. Lee, Yan-Li & Zhou, Tao, 2021. "Collaborative filtering approach to link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 578(C).
    9. Liu, Zhenfeng & Feng, Jian & Uden, Lorna, 2023. "Technology opportunity analysis using hierarchical semantic networks and dual link prediction," Technovation, Elsevier, vol. 128(C).
    10. Shugang Li & Ziming Wang & Beiyan Zhang & Boyi Zhu & Zhifang Wen & Zhaoxu Yu, 2022. "The Research of “Products Rapidly Attracting Users” Based on the Fully Integrated Link Prediction Algorithm," Mathematics, MDPI, vol. 10(14), pages 1-19, July.
    11. Chengjun Zhang & Jin Liu & Yanzhen Qu & Tianqi Han & Xujun Ge & An Zeng, 2018. "Enhancing the robustness of recommender systems against spammers," PLOS ONE, Public Library of Science, vol. 13(11), pages 1-14, November.
    12. Kai Yang & Yuan Liu & Zijuan Zhao & Xingxing Zhou & Peijin Ding, 2023. "Graph attention network via node similarity for link prediction," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 96(3), pages 1-10, March.
    13. Mungo, Luca & Lafond, François & Astudillo-Estévez, Pablo & Farmer, J. Doyne, 2023. "Reconstructing production networks using machine learning," Journal of Economic Dynamics and Control, Elsevier, vol. 148(C).
    14. Aaldering, Lukas Jan & Leker, Jens & Song, Chie Hoon, 2019. "Uncovering the dynamics of market convergence through M&A," Technological Forecasting and Social Change, Elsevier, vol. 138(C), pages 95-114.
    15. Zhou, Tao & Lee, Yan-Li & Wang, Guannan, 2021. "Experimental analyses on 2-hop-based and 3-hop-based link prediction algorithms," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 564(C).
    16. Mika J. Straka & Guido Caldarelli & Tiziano Squartini & Fabio Saracco, 2017. "From Ecology to Finance (and Back?): Recent Advancements in the Analysis of Bipartite Networks," Papers 1710.10143, arXiv.org.
    17. Yu, Jiating & Wu, Ling-Yun, 2022. "Multiple Order Local Information model for link prediction in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 600(C).
    18. Hao Liao & Xiao-Min Huang & Xing-Tong Wu & Ming-Kai Liu & Alexandre Vidmer & Mingyang Zhou & Yi-Cheng Zhang, 2019. "Enhancing countries' fitness with recommender systems on the international trade network," Papers 1904.02412, arXiv.org.
    19. Wang, Feifei & Dong, Jiaxin & Lu, Wanzhao & Xu, Shuo, 2023. "Collaboration prediction based on multilayer all-author tripartite citation networks: A case study of gene editing," Journal of Informetrics, Elsevier, vol. 17(1).
    20. Guan-Nan Wang & Hui Gao & Lian Chen & Dennis N A Mensah & Yan Fu, 2015. "Predicting Positive and Negative Relationships in Large Social Networks," PLOS ONE, Public Library of Science, vol. 10(6), pages 1-14, June.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pcbi00:1005557. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ploscompbiol (email available below). General contact details of provider: https://journals.plos.org/ploscompbiol/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.