pith. sign in

arxiv: 1811.00198 · v1 · pith:W6VIMU2Ynew · submitted 2018-11-01 · 💻 cs.CL · cs.AI· cs.LG· cs.NE

MOHONE: Modeling Higher Order Network Effects in KnowledgeGraphs via Network Infused Embeddings

classification 💻 cs.CL cs.AIcs.LGcs.NE
keywords networkgraphknowledgelocalmethodssimilarityaspectsdifferent
0
0 comments X
read the original abstract

Many knowledge graph embedding methods operate on triples and are therefore implicitly limited by a very local view of the entire knowledge graph. We present a new framework MOHONE to effectively model higher order network effects in knowledge-graphs, thus enabling one to capture varying degrees of network connectivity (from the local to the global). Our framework is generic, explicitly models the network scale, and captures two different aspects of similarity in networks: (a) shared local neighborhood and (b) structural role-based similarity. First, we introduce methods that learn network representations of entities in the knowledge graph capturing these varied aspects of similarity. We then propose a fast, efficient method to incorporate the information captured by these network representations into existing knowledge graph embeddings. We show that our method consistently and significantly improves the performance on link prediction of several different knowledge-graph embedding methods including TRANSE, TRANSD, DISTMULT, and COMPLEX(by at least 4 points or 17% in some cases).

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. HONEM: Learning Embedding for Higher Order Networks

    cs.LG 2019-08 unverdicted novelty 6.0

    HONEM learns embeddings for higher-order networks capturing non-Markovian dependencies and outperforms baselines on node classification, reconstruction, link prediction, and visualization.