arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2110.00701cs.ITmath.IT
收藏

图压缩及其在模型选择中的应用

Graph Compression with Application to Model Selection

Mojtaba Abolfazli, Anders Host-Madsen, June Zhang, Andras Bratincsak

摘要:

许多多变量数据,如社会和生物数据,表现出复杂的依赖关系,最好用图来表征。与顺序数据不同,图通常是无序结构。这意味着我们不能再对这些基于图形的数据使用经典的、基于顺序的压缩方法。因此,有必要开发新的图形压缩方法。在本文中,我们提出了通用的信源编码方法的无损压缩的无权,无向,无标号图。我们的编码分为两步:1)将图转换成一个有根二叉树,2)使用图的统计编码的根二叉树。我们的编码器表现出更好的压缩性能比其他信源编码方法的合成和现实世界的图形。然后,我们应用我们的图编码方法的高斯图模型的模型选择使用最小描述长度(MDL)的原则,找到条件独立图的描述长度。在合成数据上的实验表明,该方法比常用的模型选择方法具有更好的性能。我们还将我们的方法应用于心电图(ECG)数据,以探讨两组受试者的图形模型之间的差异。

英文摘要:

Many multivariate data such as social and biological data exhibit complex dependencies that are best characterized by graphs. Unlike sequential data, graphs are, in general, unordered structures. This means we can no longer use classic, sequential-based compression methods on these graph-based data. Therefore, it is necessary to develop new methods for graph compression. In this paper, we present universal source coding methods for the lossless compression of unweighted, undirected, unlabelled graphs. We encode in two steps: 1) transforming graph into a rooted binary tree, 2) the encoding rooted binary tree using graph statistics. Our coders showed better compression performance than other source coding methods on both synthetic and real-world graphs. We then applied our graph coding methods for model selection of Gaussian graphical models using minimum description length (MDL) principle finding the description length of the conditional independence graph. Experiments on synthetic data show that our approach gives better performance compared to common model selection methods. We also applied our approach to electrocardiogram (ECG) data in order to explore the differences between graph models of two groups of subjects.

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

↑