Pith. sign in

REVIEW

Is a Single Embedding Enough? Learning Node Representations that Capture Multiple Social Contexts

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1905.02138 v1 pith:DWTPUJU7 submitted 2019-05-06 cs.SI cs.LGstat.ML

classification cs.SIcs.LGstat.ML
keywords graphlearningnodenodesrepresentationrepresentationssingleallow
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Recent interest in graph embedding methods has focused on learning a single representation for each node in the graph. But can nodes really be best described by a single vector representation? In this work, we propose a method for learning multiple representations of the nodes in a graph (e.g., the users of a social network). Based on a principled decomposition of the ego-network, each representation encodes the role of the node in a different local community in which the nodes participate. These representations allow for improved reconstruction of the nuanced relationships that occur in the graph -- a phenomenon that we illustrate through state-of-the-art results on link prediction tasks on a variety of graphs, reducing the error by up to $90\%$. In addition, we show that these embeddings allow for effective visual analysis of the learned community structure.

Discussion (0). Continue with ORCID to comment.

Pith tools