A review of relational machine learning for knowledge graphs

M Nickel, K Murphy, V Tresp… - Proceedings of the …, 2015 - ieeexplore.ieee.org
Relational machine learning studies methods for the statistical analysis of relational, or
graph-structured, data. In this paper, we provide a review of how such statistical models can …

Network geometry

M Boguna, I Bonamassa, M De Domenico… - Nature Reviews …, 2021 - nature.com
Networks are finite metric spaces, with distances defined by the shortest paths between
nodes. However, this is not the only form of network geometry: two others are the geometry …

Size-invariant graph representations for graph classification extrapolations

B Bevilacqua, Y Zhou, B Ribeiro - … Conference on Machine …, 2021 - proceedings.mlr.press
In general, graph representation learning methods assume that the train and test data come
from the same distribution. In this work we consider an underexplored area of an otherwise …

Janossy pooling: Learning deep permutation-invariant functions for variable-size inputs

RL Murphy, B Srinivasan, V Rao, B Ribeiro - arxiv preprint arxiv …, 2018 - arxiv.org
We consider a simple and overarching representation for permutation-invariant functions of
sequences (or multiset functions). Our approach, which we call Janossy pooling, expresses …

Probabilistic symmetries and invariant neural networks

B Bloem-Reddy, Y Whye - Journal of Machine Learning Research, 2020 - jmlr.org
Treating neural network inputs and outputs as random variables, we characterize the
structure of neural networks that can be used to model data that are invariant or equivariant …

Deep models of interactions across sets

J Hartford, D Graham, K Leyton-Brown… - International …, 2018 - proceedings.mlr.press
We use deep learning to model interactions across two or more sets of objects, such as user
{–} movie ratings or protein {–} drug bindings. The canonical representation of such …

The many facets of community detection in complex networks

MT Schaub, JC Delvenne, M Rosvall… - Applied network …, 2017 - Springer
Community detection, the decomposition of a graph into essential building blocks, has been
a core research topic in network science over the past years. Since a precise notion of what …

Sparse graphs using exchangeable random measures

F Caron, EB Fox - Journal of the Royal Statistical Society Series …, 2017 - academic.oup.com
Statistical network modelling has focused on representing the graph as a discrete structure,
namely the adjacency matrix. When assuming exchangeability of this array—which can aid …

Using aggregated relational data to feasibly identify network structure without network data

E Breza, AG Chandrasekhar, TH McCormick… - American Economic …, 2020 - aeaweb.org
Social network data are often prohibitively expensive to collect, limiting empirical network
research. We propose an inexpensive and feasible strategy for network elicitation using …

Scene graph prediction with limited labels

VS Chen, P Varma, R Krishna… - Proceedings of the …, 2019 - openaccess.thecvf.com
Visual knowledge bases such as Visual Genome power numerous applications in computer
vision, including visual question answering and captioning, but suffer from sparse …