On approximate nesting of multiple social network graphs
Proceedings of the 23rd International Database Applications & Engineering Symposium on - IDEAS '19
A fundamental problem in Social Network Analysis is how to move from single-layer to multi-layer,... more 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.
Uploads
Papers by Danilo Montesi