Node metadata can produce predictability transitions in network inference problems
Network inference is the process of learning the properties of complex networks from data. Besides using information about known links in the network, node attributes and other forms of network metadata can help to solve network inference problems. Indeed, several approaches have been proposed to introduce metadata into probabilistic network models and to use them to make better inferences. However, we know little about the effect of such metadata in the inference process. Here, we investigate this issue. We find that, rather than affecting inference gradually, adding metadata causes abrupt transitions in the inference process and in our ability to make accurate predictions, from a situation in which metadata does not play any role to a situation in which metadata completely dominates the inference process. When network data and metadata are partly correlated, metadata optimally contributes to the inference process at the transition between data-dominated and metadata-dominated regimes.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
IM-META: Influence Maximization Using Node Metadata in Networks With Unknown Topology
Since the structure of complex networks is often unknown, we may identify the most influential seed nodes by exploring only a part of the underlying network, given a small budget for node queries. We propose IM-META, a s…
How Predictable are Symptoms in Psychopathological Networks? A Reanalysis of 18 Published Datasets
Background Network analyses on psychopathological data focus on the network structure and its derivatives such as node centrality. One conclusion one can draw from centrality measures is that the node with the highest ce…
Structure and inference in annotated networks
For many networks of scientific interest we know both the connections of the network and information about the network nodes, such as the age or gender of individuals in a social network, geographic location of nodes in …
Community DetectionMetadata Predictability Is Not Evidence Dependence: An Intervention-Based Audit for Weak-Label Benchmarks
We study a protocol-level test for weak-label benchmarks: whether benchmark outputs change when the provided evidence is intervened on. Metadata-only shortcut checks answer a different question, namely whether outputs ar…
A Neural Turing~Machine for Conditional Transition Graph Modeling
Graphs are an essential part of many machine learning problems such as analysis of parse trees, social networks, knowledge graphs, transportation systems, and molecular structures. Applying machine learning in these area…
BIG-bench Machine LearningInformation RetrievalKnowledge GraphsRetrieval