A generative model for exploring structure regularities in attributed networks

DOI10.1016/J.INS.2019.07.084zbMATH Open1461.62246arXiv1901.08696OpenAlexW2963189409WikidataQ127436878 ScholiaQ127436878MaRDI QIDQ2656752FDOQ2656752

Authors: Zhenhai Chang, Caiyan Jia, Yimei Zheng, Xian-Jun Yin 

Publication date: 16 March 2021

Published in: Information Sciences (Search for Journal in Brave)

Abstract: Many real-world networks known as attributed networks contain two types of information: topology information and node attributes. It is a challenging task on how to use these two types of information to explore structural regularities. In this paper, by characterizing potential relationship between link communities and node attributes, a principled statistical model named PSB_PG that generates link topology and node attributes is proposed. This model for generating links is based on the stochastic blockmodels following a Poisson distribution. Therefore, it is capable of detecting a wide range of network structures including community structures, bipartite structures and other mixture structures. The model for generating node attributes assumes that node attributes are high dimensional and sparse and also follow a Poisson distribution. This makes the model be uniform and the model parameters can be directly estimated by expectation-maximization (EM) algorithm. Experimental results on artificial networks and real networks containing various structures have shown that the proposed model PSB_PG is not only competitive with the state-of-the-art models, but also provides good semantic interpretation for each community via the learned relationship between the community and its related attributes.

Full work available at URL: https://arxiv.org/abs/1901.08696

Recommendations

• Network structure exploration in networks with node attributes
• Attributed graph clustering with subspace stochastic block model
• Overlapping communities and roles in networks with node attributes: probabilistic graphical modeling, Bayesian formulation and variational inference
• Structure-guided attributed network embedding with ``centroid enhancement
• Attributed network embedding via subspace discovery

zbMATH Keywords

stochastic block modelcommunity detectionexpectation-maximization (EM) algorithmgeneral structureattributed network

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of graph theory (05C90) Applications of graph theory to circuits and networks (94C15) Topological data analysis (62R40)

Cites Work

• Title not available (Why is that?)
• On the convergence properties of the EM algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• Mixture models and exploratory analysis in networks
• Community structure in social and biological networks
• Overlapping community detection in heterogeneous social networks via the user model
• Networks
• Network structure exploration in networks with node attributes
• Dense community detection in multi-valued attributed networks

Cited In (2)

• Network structure exploration in networks with node attributes
• A multi-level generative framework for community detection in attributed networks

Uses Software

• SA-cluster

This page was built for publication: A generative model for exploring structure regularities in attributed networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2656752)