Probabilistic Embedding of Knowledge Graphs with Box Lattice Measures

meeting of the association for computational linguistics, Volume abs/1805.06627, 2018.

被引用45|浏览90
EI

摘要

Embedding methods which enforce a partial order or lattice structure over the concept space, such as Order Embeddings (OE) (Vendrov et al., 2016), are a natural way to model transitive relational data (e.g. entailment graphs). However, OE learns a deterministic knowledge base, limiting expressiveness of queries and the ability to use unce...更多

代码

数据

下载 PDF 全文
引用
您的评分 :
0

 

标签
评论