用流匹配生成带复杂关系的多表数据,能捕捉长程依赖。
Graph-Conditional Flow Matching for Relational Data Generation
- 基于外键图结构,用流匹配建模整个数据库内容。
- 生成记录时可受同连通分量内任意记录影响,支持复杂关系。
- 在多个基准数据集上表现领先,适合隐私保护数据合成场景。
数据合成正成为一种增强隐私的技术。尽管单表表格数据生成已取得显著进展,现有用于多表数据的方法往往缺乏灵活性和表达能力,难以捕捉复杂的关联结构,尤其在处理长距离依赖和复杂外键关系(如一个表有多个父表或同一对表间存在多种链接)时表现不佳。本文提出一种面向关系型数据的生成模型,给定外键构成的图结构,生成整个关系型数据集的内容。通过流匹配学习数据库内容的深度生成模型,训练神经网络去噪记录时利用图神经网络获取相邻记录信息。该方法灵活,可支持复杂结构;表达能力强,每个记录的生成可受同连通分量内任意其他记录影响。我们在多个基准数据集上评估,结果表明其在合成数据保真度方面达到当前最优水平。
原文摘要 · Abstract (English)
Data synthesis is gaining momentum as a privacy-enhancing technology. While single-table tabular data generation has seen considerable progress, current methods for multi-table data often lack the flexibility and expressiveness needed to capture complex relational structures. In particular, they struggle with long-range dependencies and complex foreign-key relationships, such as tables with multiple parent tables or multiple types of links between the same pair of tables. We propose a generative model for relational data that generates the content of a relational dataset given the graph formed by the foreign-key relationships. We do this by learning a deep generative model of the content of the whole relational database by flow matching, where the neural network trained to denoise records leverages a graph neural network to obtain information from connected records. Our method is flexible, as it can support relational datasets with complex structures, and expressive, as the generation of each record can be influenced by any other record within the same connected component. We evaluate our method on several benchmark datasets and show that it achieves state-of-the-art performance in terms of synthetic data fidelity.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。