Attributed multiplex graph clustering: A heuristic clustering-aware network embedding approach

Beibei Han, Yingmei Wei, Lai Kang, Qingyong Wang and Suru Feng

Physica A: Statistical Mechanics and its Applications, 2022, vol. 592, issue C

Abstract: Attributed multiplex graph clustering, which partitions graph nodes from different relationships into different clusters with each cluster retaining structure closeness and attribute homogeneity simultaneously, is a fundamental graph data analysis task. Although network embedding has shown to be useful in a variety of graph analysis tasks, research dedicated to the attributed multiplex graph clustering, an important aspect of graph network analysis, is limited. Some efforts have been made for multiplex graph networks with network embedding techniques. However, most of this work has overlooked the clustering-aware information, which has not been fully explored. To solve these issues, we propose a fast method with sequenced-based network embedding for attributed multiplex graph clustering, namely NEAMC, to efficiently capture the clustering-aware information between nodes and different relationships and place them into a uniform vector space. A novel and heuristic clustering-aware across multi-relationship random walk node sampling strategy is proposed, which can not only select the relationship to proceed according to the information level of each relationship to retain the clustering-aware relationship and interaction among different relationships, but also leverage the node similarity to sample node sequences to retain the clustering-aware interactive information between nodes. Therefore, NEAMC can improve the attributed multiplex graph clustering to maintain the structure closeness and attribute homogeneity of the cluster. NEAMC is evaluated on five datasets, and the results demonstrate that it outperforms existing competitive baselines.

Keywords: Attributed multiplex graph clustering; Sequence-based network embedding; Heuristic clustering-aware across multi-relationship random walk node sampling; Structure closeness; Attribute homogeneity (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437121009699
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:592:y:2022:i:c:s0378437121009699

DOI: 10.1016/j.physa.2021.126794

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().