{"title":"Deep attribute graph clustering based on bisymmetric network information fusion and mutual influence","authors":"Shuqiu Tan, Lei Zhang, Yahui Liu, Jianxun Zhang","doi":"10.1007/s10489-025-06295-7","DOIUrl":null,"url":null,"abstract":"<div><p>Deep attribute graph clustering has always been a challenging task and an important research topic for real-world data. In recent years, there has been a growing trend in using multi-network information fusion for deep attributed graph clustering. However, existing methods in deep attributed graph clustering have not effectively integrated representations learned from multiple networks and failed to construct a joint loss function that could impact the overall network model, resulting in poor clustering results. To address the aforementioned issues, we proposed AGC-BNIFI, an attribute graph clustering method based on dual symmetric network information fusion and mutual influence. The network of this method consists of a symmetric graph autoencoder and an autoencoder. The two different encoders are combined to improve the attribute learning ability. First, a symmetric graph autoencoder with a symmetric structure is proposed to capture complex linear and adapt to complex graph structure relationships and propagate heterogeneous information of joint embedding and structural features, and can reconstruct the attribute matrix and adjacency matrix; secondly, a layer-by-layer adaptive dynamic fusion module is designed to adaptively fuse the representations learned by each layer of the two encoders, and then learn a better joint representation for clustering tasks; finally, a multi-distribution self-supervision module with soft clustering assignments obtained from different networks that learn from each other and influence each other is proposed, which integrates representation learning and clustering tasks into an end-to-end framework, and jointly optimizes representation learning and clustering tasks by designing a joint loss function. Extensive experimental results on four graph datasets demonstrate the superiority of AGC-BNIFI over state-of-the-art methods. On the Coauthor-Physics dataset, compared to MBN, AGC-BNIFI achieved improvements of 2.6%, 1.1%, 4.3%, and 6.3% in four clustering metrics, respectively.</p></div>","PeriodicalId":8041,"journal":{"name":"Applied Intelligence","volume":"55 7","pages":""},"PeriodicalIF":3.4000,"publicationDate":"2025-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10489-025-06295-7.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Intelligence","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s10489-025-06295-7","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
Deep attribute graph clustering has always been a challenging task and an important research topic for real-world data. In recent years, there has been a growing trend in using multi-network information fusion for deep attributed graph clustering. However, existing methods in deep attributed graph clustering have not effectively integrated representations learned from multiple networks and failed to construct a joint loss function that could impact the overall network model, resulting in poor clustering results. To address the aforementioned issues, we proposed AGC-BNIFI, an attribute graph clustering method based on dual symmetric network information fusion and mutual influence. The network of this method consists of a symmetric graph autoencoder and an autoencoder. The two different encoders are combined to improve the attribute learning ability. First, a symmetric graph autoencoder with a symmetric structure is proposed to capture complex linear and adapt to complex graph structure relationships and propagate heterogeneous information of joint embedding and structural features, and can reconstruct the attribute matrix and adjacency matrix; secondly, a layer-by-layer adaptive dynamic fusion module is designed to adaptively fuse the representations learned by each layer of the two encoders, and then learn a better joint representation for clustering tasks; finally, a multi-distribution self-supervision module with soft clustering assignments obtained from different networks that learn from each other and influence each other is proposed, which integrates representation learning and clustering tasks into an end-to-end framework, and jointly optimizes representation learning and clustering tasks by designing a joint loss function. Extensive experimental results on four graph datasets demonstrate the superiority of AGC-BNIFI over state-of-the-art methods. On the Coauthor-Physics dataset, compared to MBN, AGC-BNIFI achieved improvements of 2.6%, 1.1%, 4.3%, and 6.3% in four clustering metrics, respectively.
期刊介绍:
With a focus on research in artificial intelligence and neural networks, this journal addresses issues involving solutions of real-life manufacturing, defense, management, government and industrial problems which are too complex to be solved through conventional approaches and require the simulation of intelligent thought processes, heuristics, applications of knowledge, and distributed and parallel processing. The integration of these multiple approaches in solving complex problems is of particular importance.
The journal presents new and original research and technological developments, addressing real and complex issues applicable to difficult problems. It provides a medium for exchanging scientific research and technological achievements accomplished by the international community.