Alert button
Picture for Yimei Zheng

Yimei Zheng

Alert button

Deep Embedded Clustering with Distribution Consistency Preservation for Attributed Networks

May 28, 2022
Yimei Zheng, Caiyan Jia, Jian Yu, Xuanya Li

Figure 1 for Deep Embedded Clustering with Distribution Consistency Preservation for Attributed Networks
Figure 2 for Deep Embedded Clustering with Distribution Consistency Preservation for Attributed Networks
Figure 3 for Deep Embedded Clustering with Distribution Consistency Preservation for Attributed Networks
Figure 4 for Deep Embedded Clustering with Distribution Consistency Preservation for Attributed Networks

Many complex systems in the real world can be characterized by attributed networks. To mine the potential information in these networks, deep embedded clustering, which obtains node representations and clusters simultaneously, has been paid much attention in recent years. Under the assumption of consistency for data in different views, the cluster structure of network topology and that of node attributes should be consistent for an attributed network. However, many existing methods ignore this property, even though they separately encode node representations from network topology and node attributes meanwhile clustering nodes on representation vectors learnt from one of the views. Therefore, in this study, we propose an end-to-end deep embedded clustering model for attributed networks. It utilizes graph autoencoder and node attribute autoencoder to respectively learn node representations and cluster assignments. In addition, a distribution consistency constraint is introduced to maintain the latent consistency of cluster distributions of two views. Extensive experiments on several datasets demonstrate that the proposed model achieves significantly better or competitive performance compared with the state-of-the-art methods. The source code can be found at https://github.com/Zhengymm/DCP.

* 28 pages, 5 figures 
Viaarxiv icon

A Generative Node-attribute Network Model for Detecting Generalized Structure

Jun 05, 2021
Wei Liu, Zhenhai Chang, Caiyan Jia, Yimei Zheng

Figure 1 for A Generative Node-attribute Network Model for Detecting Generalized Structure
Figure 2 for A Generative Node-attribute Network Model for Detecting Generalized Structure
Figure 3 for A Generative Node-attribute Network Model for Detecting Generalized Structure
Figure 4 for A Generative Node-attribute Network Model for Detecting Generalized Structure

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.

Viaarxiv icon