Mining Essential Relationships under Multiplex Networks
arXiv:1511.09134
Abstract
In big data times, massive datasets often carry different relationships among the same group of nodes, analyzing on these heterogeneous relationships may give us a window to peek the essential relationships among nodes. In this paper, first of all we propose a new metric "similarity rate" in order to capture the changing rate of similarities between node-pairs though all networks; secondly, we try to use this new metric to uncover essential relationships between node-pairs which essential relationships are often hidden and hard to get. From experiments study of Indonesian Terrorists dataset, this new metric similarity rate function well for giving us a way to uncover essential relationships from lots of appearances.
5 pages, 6 figures
References in corpus (6)
- Fast unfolding of communities in large networks
- Modularity and community structure in networks
- Uncovering the overlapping community structure of complex networks in nature and society
- Predicting Missing Links via Local Information
- Size reduction of complex networks preserving modularity
- Communities unfolding in multislice networks