<HashMap><database>biostudies-literature</database><scores/><additional><omics_type>Unknown</omics_type><volume>9(1)</volume><submitter>Cinelli M</submitter><pubmed_abstract>Networks are real systems modelled through mathematical objects made up of nodes and links arranged into peculiar and deliberate (or partially deliberate) topologies. Studying these real-world topologies allows for several properties of interest to be revealed. In real networks, nodes are also identified by a certain number of non-structural features or metadata. Given the current possibility of collecting massive quantity of such metadata, it becomes crucial to identify automatically which are the most relevant for the observed structure. We propose a new method that, independently from the network size, is able to not only report the relevance of binary node metadata, but also rank them. Such a method can be applied to networks from any domain, and we apply it in two heterogeneous cases:</pubmed_abstract><journal>Scientific reports</journal><pagination>11404</pagination><full_dataset_link>https://www.ebi.ac.uk/biostudies/studies/S-EPMC6684645</full_dataset_link><repository>biostudies-literature</repository><pubmed_title>Evaluating relevance and redundancy to quantify how binary node metadata interplay with the network structure.</pubmed_title><pmcid>PMC6684645</pmcid><pubmed_authors>Cinelli M</pubmed_authors><pubmed_authors>Iovanella A</pubmed_authors><pubmed_authors>Ferraro G</pubmed_authors></additional><is_claimable>false</is_claimable><name>Evaluating relevance and redundancy to quantify how binary node metadata interplay with the network structure.</name><description>Networks are real systems modelled through mathematical objects made up of nodes and links arranged into peculiar and deliberate (or partially deliberate) topologies. Studying these real-world topologies allows for several properties of interest to be revealed. In real networks, nodes are also identified by a certain number of non-structural features or metadata. Given the current possibility of collecting massive quantity of such metadata, it becomes crucial to identify automatically which are the most relevant for the observed structure. We propose a new method that, independently from the network size, is able to not only report the relevance of binary node metadata, but also rank them. Such a method can be applied to networks from any domain, and we apply it in two heterogeneous cases:</description><dates><release>2019-01-01T00:00:00Z</release><publication>2019 Aug</publication><modification>2026-05-07T10:20:00.043Z</modification><creation>2026-04-07T22:47:41.321Z</creation></dates><accession>S-EPMC6684645</accession><cross_references><pubmed>31388045</pubmed><doi>10.1038/s41598-019-47717-0</doi></cross_references></HashMap>