Abstract
Many real-world complex systems have multiple types of relations between their components, and they are popularly modeled as multiplex networks with each type of relation as one layer. Since the fusion analysis of multiplex networks can provide a comprehensive insight, the structural information fusion of multiplex networks has become a crucial issue. However, most of these existing data fusion methods are inappropriate for researchers to apply to complex network analysis directly. The feature-based fusion methods ignore the sharing and complementarity of interlayer structural information. To tackle this problem, we propose a multiplex network structural fusion (MNSF) model, which can construct a network with comprehensive information. It is composed of two modules: the network feature extraction (NFE) module and the network structural fusion (NSF) module. (1) In NFE, MNSF first extracts a low-dimensional vector representation of a node from each layer. Then, we construct a node similarity network based on embedding matrices and K-D tree algorithm. (2) In NSF, we present a nonlinear enhanced iterative fusion (EIF) strategy. EIF can strengthen high-weight edges presented in one (i.e., complementary information) or more (i.e., shared information) networks and weaken low-weight edges (i.e., redundant information). The retention of low-weight edges shared by all layers depends on the tightness of connections of their K-order proximity. The usage of higher-order proximity in EIF alleviates the dependence on the quality of node embedding. Besides, the fused network can be easily exploited by traditional single-layer network analysis methods. Experiments on real-world networks demonstrate that MNSF outperforms the state-of-the-art methods in tasks link prediction and shared community detection.
Highlights
Many real-world complex systems have multiple types of relations between their components, and they are popularly modeled as multiplex networks with each type of relation as one layer
enhanced iterative fusion (EIF) can strengthen high-weight edges presented in one or more networks and weaken low-weight edges. e retention of low-weight edges shared by all layers depends on the tightness of connections of their K-order proximity. e usage of higher-order proximity in EIF alleviates the dependence on the quality of node embedding
We propose a deep structural fusion framework of multiplex networks, named multiplex network structural fusion (MNSF), which is based on network representation learning and enhanced iterative fusion (EIF)
Summary
Many real-world complex systems have multiple types of relations between their components, and they are popularly modeled as multiplex networks with each type of relation as one layer. Since the fusion analysis of multiplex networks can provide a comprehensive insight, the structural information fusion of multiplex networks has become a crucial issue Most of these existing data fusion methods are inappropriate for researchers to apply to complex network analysis directly. E featurebased fusion methods ignore the sharing and complementarity of interlayer structural information To tackle this problem, we propose a multiplex network structural fusion (MNSF) model, which can construct a network with comprehensive information. E first category mainly utilizes a network embedding method for multiplex networks to fuse the multiple features of each node into a comprehensive feature/tensor. If the loss information is complementary, it causes the loss of information
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.