Feature Learning and Network Structure from Noisy Node Activity Data

Abstract

In the studies of network structures, much attention has been devoted to developing approaches to reconstruct networks and predict missing links when edge-related information is given. However, such approaches are not applicable when we are only given noisy node activity data with missing values. This work presents an unsupervised learning framework to learn node vectors and construct networks from such node activity data. First, we design a scheme to generate random node sequences from node context sets, which are generated from node activity data. Then, a three-layer neural network is adopted training the node sequences to obtain node vectors, which allow us to construct networks and capture nodes with synergistic roles. Furthermore, we present an entropy-based approach to select the most meaningful neighbors for each node in the resulting network. Finally, the effectiveness of the method is validated through both synthetic and real data.

References in corpus (12)

• The structure and dynamics of multilayer networks
• ARACNE: An Algorithm for the Reconstruction of Gene Regulatory Networks in a Mammalian Cellular Context
• Stochastic blockmodels and community structure in networks
• Missing and spurious interactions and the reconstruction of complex networks
• Layer aggregation and reducibility of multilayer interconnected networks
• The backbone of the climate network
• Revealing Network Connectivity From Dynamics
• Nonparametric weighted stochastic block models
• Occams Razor for Big Data? On Detecting Quality in Large Unstructured Datasets
• Measuring topological descriptors of complex networks under uncertainty
• Layer reconstruction and missing link prediction of multilayer network with a Maximum A Posteriori estimation
• Clustering of heterogeneous populations of networks