最小编辑树形图问题及其在压缩图集合中的应用[扩展版]
The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections [Extended Version]
摘要:
在一组对象内的最小生成树状图的推断是一个普遍的问题,其转化为许多特定于应用的无监督学习任务。我们引入了一个统一的和通用的结构,称为编辑树形图,依赖于在一个集合中的数据之间的编辑路径,以及最小编辑树形图问题,它要求一个编辑树形图,最大限度地减少其内部编辑路径的成本之和。通过使用合适的成本函数,这个通用的框架允许模拟各种问题。特别是,我们表明,通过引入编码大小保持编辑成本,它可以被用来作为一个有效的方法,压缩标记图的集合。在各种图数据集上的实验,与标准压缩工具的比较,显示了我们的方法的潜力。
英文摘要:
The inference of minimum spanning arborescences within a set of objects is a general problem which translates into numerous application-specific unsupervised learning tasks. We introduce a unified and generic structure called edit arborescence that relies on edit paths between data in a collection, as well as the Min Edit Arborescence Problem, which asks for an edit arborescence that minimizes the sum of costs of its inner edit paths. Through the use of suitable cost functions, this generic framework allows to model a variety of problems. In particular, we show that by introducing encoding size preserving edit costs, it can be used as an efficient method for compressing collections of labeled graphs. Experiments on various graph datasets, with comparisons to standard compression tools, show the potential of our method.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。