文件名称:
Embedding Logical Queries on Knowledge Graphs.pdf
开发工具:
文件大小: 1mb
下载次数: 0
上传时间: 2020-03-29
详细说明:Learning low-dimensional embeddings of knowledge graphs is a powerful approach used to predict unobserved or missing edges between entities. However,
an open challenge in this area is developing techniques that can go beyond simple
edge prediction and handle more complex logical queries, which might involve
multiple unobserved edges, entities, and variables. For instance, given an incomplete biological knowledge graph, we might want to predict what drugs are likely
to target proteins involved with both diseases X and Y?—a query that requires
reasoning about all possible proteins that might interact with diseases X and Y.
Here we introduce a framework to efficiently make predictions about conjunctive
logical queries—a flexible but tractable subset of first-order logic—on incomplete
knowledge graphs. In our approach, we embed graph nodes in a low-dimensional
space and represent logical operators as learned geometric operations (e.g., translation, rotation) in this embedding space. By performing logical operations within a
low-dimensional embedding space, our approach achieves a time complexity that
is linear in the number of query variables, compared to the exponential complexity
required by a naive enumeration-based approach. We demonstrate the utility of
this framework in two application studies on real-world datasets with millions
of relations: predicting logical relationships in a network of drug-gene-disease
interactions and in a graph-based representation of social interactions derived from
a popular web forum.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
相关说明
- 本站资源为会员上传分享交流与学习,如有侵犯您的权益,请联系我们删除.
- 本站是交换下载平台,提供交流渠道,下载内容来自于网络,除下载问题外,其它问题请自行百度。
- 本站已设置防盗链,请勿用迅雷、QQ旋风等多线程下载软件下载资源,下载后用WinRAR最新版进行解压.
- 如果您发现内容无法下载,请稍后再次尝试;或者到消费记录里找到下载记录反馈给我们.
- 下载后发现下载的内容跟说明不相乎,请到消费记录里找到下载记录反馈给我们,经确认后退回积分.
- 如下载前有疑问,可以通过点击"提供者"的名字,查看对方的联系方式,联系对方咨询.