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

Assessing Low-Intensity Relationships in Complex Networks

Author

Listed:
  • Andreas Spitz
  • Anna Gimmler
  • Thorsten Stoeck
  • Katharina Anna Zweig
  • Emőke-Ágnes Horvát

Abstract

Many large network data sets are noisy and contain links representing low-intensity relationships that are difficult to differentiate from random interactions. This is especially relevant for high-throughput data from systems biology, large-scale ecological data, but also for Web 2.0 data on human interactions. In these networks with missing and spurious links, it is possible to refine the data based on the principle of structural similarity, which assesses the shared neighborhood of two nodes. By using similarity measures to globally rank all possible links and choosing the top-ranked pairs, true links can be validated, missing links inferred, and spurious observations removed. While many similarity measures have been proposed to this end, there is no general consensus on which one to use. In this article, we first contribute a set of benchmarks for complex networks from three different settings (e-commerce, systems biology, and social networks) and thus enable a quantitative performance analysis of classic node similarity measures. Based on this, we then propose a new methodology for link assessment called z* that assesses the statistical significance of the number of their common neighbors by comparison with the expected value in a suitably chosen random graph model and which is a consistently top-performing algorithm for all benchmarks. In addition to a global ranking of links, we also use this method to identify the most similar neighbors of each single node in a local ranking, thereby showing the versatility of the method in two distinct scenarios and augmenting its applicability. Finally, we perform an exploratory analysis on an oceanographic plankton data set and find that the distribution of microbes follows similar biogeographic rules as those of macroorganisms, a result that rejects the global dispersal hypothesis for microbes.

Suggested Citation

  • 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.
    • Handle: RePEc:plo:pone00:0152536
    DOI: 10.1371/journal.pone.0152536
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0152536
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0152536&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0152536?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. Vega-Redondo,Fernando, 2007. "Complex Social Networks," Cambridge Books, Cambridge University Press, number 9780521674096.
    2. 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.
    3. Tao Zhou & Linyuan Lü & Yi-Cheng Zhang, 2009. "Predicting missing links via local information," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 71(4), pages 623-630, October.
    4. 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.
    5. Vega-Redondo,Fernando, 2007. "Complex Social Networks," Cambridge Books, Cambridge University Press, number 9780521857406.
    6. Yong-Yeol Ahn & James P. Bagrow & Sune Lehmann, 2010. "Link communities reveal multiscale complexity in networks," Nature, Nature, vol. 466(7307), pages 761-764, August.
    7. Li, Menghui & Fan, Ying & Chen, Jiawei & Gao, Liang & Di, Zengru & Wu, Jinshan, 2005. "Weighted networks of scientific communication: the measurement and topological role of weight," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 350(2), pages 643-656.
    8. Emőke-Ágnes Horvát & Jitao David Zhang & Stefan Uhlmann & Özgür Sahin & Katharina Anna Zweig, 2013. "A Network-Based Method to Assess the Statistical Significance of Mild Co-Regulation Effects," PLOS ONE, Public Library of Science, vol. 8(9), pages 1-14, September.
    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. Alfonso Monaco & Nicola Amoroso & Loredana Bellantuono & Eufemia Lella & Angela Lombardi & Anna Monda & Andrea Tateo & Roberto Bellotti & Sabina Tangaro, 2019. "Shannon entropy approach reveals relevant genes in Alzheimer’s disease," PLOS ONE, Public Library of Science, vol. 14(12), pages 1-29, 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. 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.
    3. 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).
    4. Lee, Yan-Li & Zhou, Tao, 2021. "Collaborative filtering approach to link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 578(C).
    5. 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.
    6. 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.
    7. 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).
    8. 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).
    9. 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).
    10. Yueran Duan & Qing Guan, 2021. "Predicting potential knowledge convergence of solar energy: bibliometric analysis based on link prediction model," Scientometrics, Springer;Akadémiai Kiadó, vol. 126(5), pages 3749-3773, May.
    11. Park, Ji Hwan & Chang, Woojin & Song, Jae Wook, 2020. "Link prediction in the Granger causality network of the global currency market," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 553(C).
    12. Lee, Yan-Li & Dong, Qiang & Zhou, Tao, 2021. "Link prediction via controlling the leading eigenvector," Applied Mathematics and Computation, Elsevier, vol. 411(C).
    13. Jiao, Yang & Wu, Jianshe & Xiang, Peng & Wang, Fang, 2023. "Link prediction from fusion information," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 618(C).
    14. Wang, Jun & Zhang, Qian-Ming & Zhou, Tao, 2019. "Tag-aware link prediction algorithm in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 105-111.
    15. Najari, Shaghayegh & Salehi, Mostafa & Ranjbar, Vahid & Jalili, Mahdi, 2019. "Link prediction in multiplex networks based on interlayer similarity," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 536(C).
    16. Sanda Martinčić-Ipšić & Edvin Močibob & Matjaž Perc, 2017. "Link prediction on Twitter," PLOS ONE, Public Library of Science, vol. 12(7), pages 1-21, July.
    17. Assouli, Nora & Benahmed, Khelifa & Gasbaoui, Brahim, 2021. "How to predict crime — informatics-inspired approach from link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 570(C).
    18. Huang, Lu & Chen, Xiang & Ni, Xingxing & Liu, Jiarun & Cao, Xiaoli & Wang, Changtian, 2021. "Tracking the dynamics of co-word networks for emerging topic identification," Technological Forecasting and Social Change, Elsevier, vol. 170(C).
    19. Zhang, Ting & Zhang, Kun & Li, Xun & Lv, Laishui & Sun, Qi, 2021. "Semi-supervised link prediction based on non-negative matrix factorization for temporal networks," Chaos, Solitons & Fractals, Elsevier, vol. 145(C).
    20. Chen, Xing & Wu, Tao & Xian, Xingping & Wang, Chao & Yuan, Ye & Ming, Guannan, 2020. "Enhancing robustness of link prediction for noisy complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 555(C).

    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:pone00:0152536. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.