arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1605.00686cs.AIcs.DB
收藏

数据图上可扩展边发现任务的自适应候选生成

Adaptive Candidate Generation for Scalable Edge-discovery Tasks on Data Graphs

Information Sciences Institute(信息科学研究所);USC Viterbi School of Engineering(南加州大学维特比工程学院)

Mayank Kejriwal

摘要:

已知基于图的数据模型上的几个“边发现”应用在节点中具有最坏情况的二次时间复杂度,即使发现的边是稀疏的。一个例子是两个图之间的通用链接发现问题,这已经在几个社区引起了研究兴趣。这个问题的具体版本包括社交网络中的链接预测、元数据丰富的RDF数据之间的本体对齐、近似连接以及实例丰富的数据之间的实体解析。随着大型数据集的不断增加,降低二次复杂度以使任务实用化是一个重要的研究问题。在实体解析社区中,这个问题通常被称为阻塞。一类特殊的可学习分块方案被称为析取范式(DNF)分块方案,并且已经成为同构(即相同模式)表格数据的最新技术。尽管这些计划的承诺,一个形式主义或学习框架还没有为他们开发时,输入数据实例是通用的,属性图拥有节点和边缘的异质性。随着这种发展,DNF方案的复杂性降低范围变得适用于各种问题,包括异构图之间的实体解析和类型对齐,以及表示为属性图的网络中的链接预测。本文提出了一种图论形式的DNF计划,并研究其学习的优化框架。我们还简要描述了一个经验性的案例研究封装本文中的一些原则。

英文摘要:

Several `edge-discovery' applications over graph-based data models are known to have worst-case quadratic time complexity in the nodes, even if the discovered edges are sparse. One example is the generic link discovery problem between two graphs, which has invited research interest in several communities. Specific versions of this problem include link prediction in social networks, ontology alignment between metadata-rich RDF data, approximate joins, and entity resolution between instance-rich data. As large datasets continue to proliferate, reducing quadratic complexity to make the task practical is an important research problem. Within the entity resolution community, the problem is commonly referred to as blocking. A particular class of learnable blocking schemes is known as Disjunctive Normal Form (DNF) blocking schemes, and has emerged as state-of-the art for homogeneous (i.e. same-schema) tabular data. Despite the promise of these schemes, a formalism or learning framework has not been developed for them when input data instances are generic, attributed graphs possessing both node and edge heterogeneity. With such a development, the complexity-reducing scope of DNF schemes becomes applicable to a variety of problems, including entity resolution and type alignment between heterogeneous graphs, and link prediction in networks represented as attributed graphs. This paper presents a graph-theoretic formalism for DNF schemes, and investigates their learnability in an optimization framework. We also briefly describe an empirical case study encapsulating some of the principles in this paper.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑