Privacy-preserving data publishing using bipartite graph
用二分图实现数据发布的隐私保护*

It could implement privacy protection based on the table storage and data publication, but the records were independent each other. It made entities relationships miss in the publication and influenced the effectiveness of the publication data. With bipartite graph publishing data, divided the vertexes into two categories. Grouped the vertexes with a label by clustering method. Another vertex set implemented maximum matching group according to it. By hiding mappings between individual and vertex, it ensured relationships between two classes of individual security release. The maximum match group based on the cluster not only realizes the privacy protection but also increases the published data effectiveness.