A Generative Node-attribute Network Model for Detecting Generalized Structure

• URL: http://arxiv.org/abs/2106.02878v1
• Date: Sat, 5 Jun 2021 12:07:04 GMT
• Title: A Generative Node-attribute Network Model for Detecting Generalized Structure
• Authors: Wei Liu and Zhenhai Chang and Caiyan Jia and Yimei Zheng
• Abstract summary: We propose a principle model (named GNAN) which can generate both topology information and attribute information. The new model can detect not only community structure, but also a range of other types of structure in networks. Experiments on both synthetic and real-world networks show that the new model is competitive with other state-of-the-art models.
• Score: 6.151348127802708
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Exploring meaningful structural regularities embedded in networks is a key to understanding and analyzing the structure and function of a network. The node-attribute information can help improve such understanding and analysis. However, most of the existing methods focus on detecting traditional communities, i.e., groupings of nodes with dense internal connections and sparse external ones. In this paper, based on the connectivity behavior of nodes and homogeneity of attributes, we propose a principle model (named GNAN), which can generate both topology information and attribute information. The new model can detect not only community structure, but also a range of other types of structure in networks, such as bipartite structure, core-periphery structure, and their mixture structure, which are collectively referred to as generalized structure. The proposed model that combines topological information and node-attribute information can detect communities more accurately than the model that only uses topology information. The dependency between attributes and communities can be automatically learned by our model and thus we can ignore the attributes that do not contain useful information. The model parameters are inferred by using the expectation-maximization algorithm. And a case study is provided to show the ability of our model in the semantic interpretability of communities. Experiments on both synthetic and real-world networks show that the new model is competitive with other state-of-the-art models.

Related papers

• Learning Invariant Representations of Graph Neural Networks via Cluster Generalization [58.68231635082891]
  Graph neural networks (GNNs) have become increasingly popular in modeling graph-structured data. In this paper, we experimentally find that the performance of GNNs drops significantly when the structure shift happens. We propose the Cluster Information Transfer (CIT) mechanism, which can learn invariant representations for GNNs.
  arXiv  Detail & Related papers  (2024-03-06T10:36:56Z)
• Inferring community structure in attributed hypergraphs using stochastic block models [3.335932527835653]
  We develop a statistical framework that incorporates node attribute data into the learning of community structure in a hypergraph. We demonstrate that our model, which we refer to as HyperNEO, enhances the learning of community structure in synthetic and empirical hypergraphs. We expect that our framework will broaden the investigation and understanding of higher-order community structure in real-world complex systems.
  arXiv  Detail & Related papers  (2024-01-01T07:31:32Z)
• Exact Recovery and Bregman Hard Clustering of Node-Attributed Stochastic Block Model [0.16385815610837165]
  This paper presents an information-theoretic criterion for the exact recovery of community labels. It shows how network and attribute information can be exchanged in order to have exact recovery. It also presents an iterative clustering algorithm that maximizes the joint likelihood.
  arXiv  Detail & Related papers  (2023-10-30T16:46:05Z)
• Hierarchical clustering with dot products recovers hidden tree structure [53.68551192799585]
  In this paper we offer a new perspective on the well established agglomerative clustering algorithm, focusing on recovery of hierarchical structure. We recommend a simple variant of the standard algorithm, in which clusters are merged by maximum average dot product and not, for example, by minimum distance or within-cluster variance. We demonstrate that the tree output by this algorithm provides a bona fide estimate of generative hierarchical structure in data, under a generic probabilistic graphical model.
  arXiv  Detail & Related papers  (2023-05-24T11:05:12Z)
• Bayesian Detection of Mesoscale Structures in Pathway Data on Graphs [0.0]
  mesoscale structures are integral part of the abstraction and analysis of complex systems. They can represent communities in social or citation networks, roles in corporate interactions, or core-periphery structures in transportation networks. We derive a Bayesian approach that simultaneously models the optimal partitioning of nodes in groups and the optimal higher-order network dynamics.
  arXiv  Detail & Related papers  (2023-01-16T12:45:33Z)
• Adaptive Attribute and Structure Subspace Clustering Network [49.040136530379094]
  We propose a novel self-expressiveness-based subspace clustering network. We first consider an auto-encoder to represent input data samples. Then, we construct a mixed signed and symmetric structure matrix to capture the local geometric structure underlying data. We perform self-expressiveness on the constructed attribute structure and matrices to learn their affinity graphs.
  arXiv  Detail & Related papers  (2021-09-28T14:00:57Z)
• CoANE: Modeling Context Co-occurrence for Attributed Network Embedding [10.609715843964263]
  Attributed network embedding (ANE) is to learn low-dimensional vectors so that not only the network structure but also node attributes can be preserved. We propose a novel ANE model, Context Co-occurrence-aware Attributed Network Embedding (CoANE) The learning of context co-occurrence can capture the latent social circles of each node.
  arXiv  Detail & Related papers  (2021-06-17T04:31:02Z)
• Neural Production Systems [90.75211413357577]
  Visual environments are structured, consisting of distinct objects or entities. To partition images into entities, deep-learning researchers have proposed structural inductive biases. We take inspiration from cognitive science and resurrect a classic approach, which consists of a set of rule templates. This architecture achieves a flexible, dynamic flow of control and serves to factorize entity-specific and rule-based information.
  arXiv  Detail & Related papers  (2021-03-02T18:53:20Z)
• Anomaly Detection on Attributed Networks via Contrastive Self-Supervised Learning [50.24174211654775]
  We present a novel contrastive self-supervised learning framework for anomaly detection on attributed networks. Our framework fully exploits the local information from network data by sampling a novel type of contrastive instance pair. A graph neural network-based contrastive learning model is proposed to learn informative embedding from high-dimensional attributes and local structure.
  arXiv  Detail & Related papers  (2021-02-27T03:17:20Z)
• On the use of local structural properties for improving the efficiency of hierarchical community detection methods [77.34726150561087]
  We study how local structural network properties can be used as proxies to improve the efficiency of hierarchical community detection. We also check the performance impact of network prunings as an ancillary tactic to make hierarchical community detection more efficient.
  arXiv  Detail & Related papers  (2020-09-15T00:16:12Z)
• Struct-MMSB: Mixed Membership Stochastic Blockmodels with Interpretable Structured Priors [13.712395104755783]
  Mixed membership blockmodel (MMSB) is a popular framework for community detection and network generation. We present a flexible MMSB model, textitStruct-MMSB, that uses a recently developed statistical relational learning model, hinge-loss Markov random fields (HL-MRFs) Our model is capable of learning latent characteristics in real-world networks via meaningful latent variables encoded as a complex combination of observed features and membership distributions.
  arXiv  Detail & Related papers  (2020-02-21T19:32:32Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.