Assessing Low-Intensity Relationships in Complex Networks

Cite This

Files in this item

Checksum: MD5:d6af836361c6e107637cd96527c8204c

SPITZ, Andreas, Anna GIMMLER, Thorsten STOECK, Katharina Anna ZWEIG, Emőke-Ágnes HORVÁT, 2016. Assessing Low-Intensity Relationships in Complex Networks. In: PLoS one. Public Library of Science (PLoS). 11(4), e0152536. eISSN 1932-6203. Available under: doi: 10.1371/journal.pone.0152536

@article{Spitz2016Asses-55361, title={Assessing Low-Intensity Relationships in Complex Networks}, year={2016}, doi={10.1371/journal.pone.0152536}, number={4}, volume={11}, journal={PLoS one}, author={Spitz, Andreas and Gimmler, Anna and Stoeck, Thorsten and Zweig, Katharina Anna and Horvát, Emőke-Ágnes}, note={Article Number: e0152536} }

<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/55361"> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-10-26T07:47:11Z</dcterms:available> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-10-26T07:47:11Z</dc:date> <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by/4.0/"/> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/55361/3/Spitz_2-18e5cstrnqwuy7.pdf"/> <dc:rights>Attribution 4.0 International</dc:rights> <dc:creator>Zweig, Katharina Anna</dc:creator> <dc:creator>Spitz, Andreas</dc:creator> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:language>eng</dc:language> <dc:creator>Gimmler, Anna</dc:creator> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/55361/3/Spitz_2-18e5cstrnqwuy7.pdf"/> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:contributor>Gimmler, Anna</dc:contributor> <dc:creator>Horvát, Emőke-Ágnes</dc:creator> <dc:contributor>Horvát, Emőke-Ágnes</dc:contributor> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/55361"/> <dc:contributor>Zweig, Katharina Anna</dc:contributor> <dc:contributor>Spitz, Andreas</dc:contributor> <dc:contributor>Stoeck, Thorsten</dc:contributor> <dc:creator>Stoeck, Thorsten</dc:creator> <dcterms:issued>2016</dcterms:issued> <dcterms:title>Assessing Low-Intensity Relationships in Complex Networks</dcterms:title> <dcterms:abstract xml:lang="eng">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.</dcterms:abstract> </rdf:Description> </rdf:RDF>

Downloads since Oct 26, 2021 (Information about access statistics)

Spitz_2-18e5cstrnqwuy7.pdf 22

This item appears in the following Collection(s)

Attribution 4.0 International Except where otherwise noted, this item's license is described as Attribution 4.0 International

Search KOPS


Browse

My Account