PP-DBLP:用DBLP建模和生成属性化的公私网络
PP-DBLP: Modeling and Generating Attributed Public-Private Networks with DBLP
摘要:
在许多在线社交网络(例如,Facebook、Google+、Twitter和Instagram),用户更喜欢隐藏她/他的部分或全部关系,这使得这种私人关系对公共用户甚至朋友不可见。这导致了一个新的图形模型,称为公共-私有网络,其中每个用户都有自己的网络视角,包括私有连接。最近,公私网络分析在文献中引起了极大的研究兴趣。大量重要的图计算问题(例如,最短路径、中心性、PageRank和可达性树)。然而,由于有限的数据源和隐私问题,所提出的方法没有在真实世界的数据集上进行测试,而是通过随机选择顶点作为私有顶点来在合成数据集上进行测试。因此,现实世界的数据集的公私网络是必不可少的,迫切需要这样的算法的效率和有效性的评估。在本文中,我们从真实世界的DBLP记录中生成四个公私网络,称为PPDBLP。我们将已发表的文章视为公开信息,将正在进行的合作视为隐藏信息,只有作者才知道。我们发布的PPDBLP数据集提供了以公平的方式验证各种有效的公私分析算法的前景。此外,受广泛存在的属性图的启发,我们提出了一个高级的属性公私图模型,其中顶点不仅有私有边,而且还有私有属性。我们还讨论了公开的问题,属性的公私图。在我们生成的真实世界数据集上的初步实验结果验证了公私模型和最先进算法的有效性和效率。
英文摘要:
In many online social networks (e.g., Facebook, Google+, Twitter, and Instagram), users prefer to hide her/his partial or all relationships, which makes such private relationships not visible to public users or even friends. This leads to a new graph model called public-private networks, where each user has her/his own perspective of the network including the private connections. Recently, public-private network analysis has attracted significant research interest in the literature. A great deal of important graph computing problems (e.g., shortest paths, centrality, PageRank, and reachability tree) has been studied. However, due to the limited data sources and privacy concerns, proposed approaches are not tested on real-world datasets, but on synthetic datasets by randomly selecting vertices as private ones. Therefore, real-world datasets of public-private networks are essential and urgently needed for such algorithms in the evaluation of efficiency and effectiveness. In this paper, we generate four public-private networks from real-world DBLP records, called PPDBLP. We take published articles as public information and regard ongoing collaborations as the hidden information, which is only known by the authors. Our released datasets of PPDBLP offer the prospects for verifying various kinds of efficient public-private analysis algorithms in a fair way. In addition, motivated by widely existing attributed graphs, we propose an advanced model of attributed public-private graphs where vertices have not only private edges but also private attributes. We also discuss open problems on attributed public-private graphs. Preliminary experimental results on our generated real-world datasets verify the effectiveness and efficiency of public-private models and state-of-the-art algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。