On approximate nesting of multiple social network graphs: a preliminary study
On approximate nesting of multiple social network graphs: a preliminary study
复制标题
多个社交网络图的近似嵌套：初步研究
DOI：
--
复制
发表时间：
2019
期刊：
影响因子：
--
通讯作者：
D. Montesi
中科院分区：
文献类型：
--
作者：
Giacomo Bergami;Flavio Bertini;D. Montesi
社会网络分析的一个基本问题是如何从单层过渡到多层，从而提供一个整体的观点。用户配置文件解析已经受到了相当大的关注，因为它允许在不同的在线社交网络（osn）上匹配用户。然而，据我们所知，还没有研究关注合并osn图的嵌套操作。这项工作是朝着定义数据模型和算法的方向迈出的第一步，该模型和算法可以基于用户特征对多个osn图进行近似嵌套。我们提供基于合成数据的初步实验证据。
A fundamental problem in Social Network Analysis is how to move from single-layer to multi-layer, which provide a holistic view. User profiles resolution has received considerable attention since it allows to match users on different online social networks (OSNs). However, to the best of our knowledge, no study has focused on nesting operation for merging OSNs graphs. This work is a first step in the direction of defining the data model and the algorithm to perform approximate nesting of multiple OSNs graphs, based on user features. We provide initial experimental evidence based on synthetic data.