Attributed Graph Clustering via Deep Adaptive Graph Maximization

Bahare Fatemi, Soheila Molaei, Hadi Zare, H. Veisi
{"title":"Attributed Graph Clustering via Deep Adaptive Graph Maximization","authors":"Bahare Fatemi, Soheila Molaei, Hadi Zare, H. Veisi","doi":"10.1109/ICCKE50421.2020.9303694","DOIUrl":null,"url":null,"abstract":"Due to the increasing popularity of the social networks, the detection and discovery of the hidden building blocks and their community structures are considered as the primary tasks on the graph (network) based data structures. Graph clustering is considered as a challenging task as it requires contribution of input graph’s topological and content data jointly. Graph Convolutional Neural Networks (GCNs) have demonstrated remarkable power in the domain of graph representation learning by merging both structural and content information of networks. While GCN based clustering methods are being used as the state-of-the-art alternative solution for graph clustering, these methods fail to capture global structural information of networks, considering a local neighborhood of each node. Here we propose an integrated novel graph convolutional clustering approach that enables us to extract the local and global structures of the graph based data along with the nodes content. Experimental studies on three real-world benchmark information networks approve our approach and confirm that our proposed method outperforms baseline methods significantly in graph clustering and link prediction tasks.","PeriodicalId":402043,"journal":{"name":"2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCKE50421.2020.9303694","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Due to the increasing popularity of the social networks, the detection and discovery of the hidden building blocks and their community structures are considered as the primary tasks on the graph (network) based data structures. Graph clustering is considered as a challenging task as it requires contribution of input graph’s topological and content data jointly. Graph Convolutional Neural Networks (GCNs) have demonstrated remarkable power in the domain of graph representation learning by merging both structural and content information of networks. While GCN based clustering methods are being used as the state-of-the-art alternative solution for graph clustering, these methods fail to capture global structural information of networks, considering a local neighborhood of each node. Here we propose an integrated novel graph convolutional clustering approach that enables us to extract the local and global structures of the graph based data along with the nodes content. Experimental studies on three real-world benchmark information networks approve our approach and confirm that our proposed method outperforms baseline methods significantly in graph clustering and link prediction tasks.
基于深度自适应图最大化的属性图聚类
由于社交网络的日益普及,隐藏构建块及其社区结构的检测和发现被认为是基于图(网络)的数据结构的主要任务。图的聚类是一项具有挑战性的任务,因为它需要输入图的拓扑数据和内容数据的共同贡献。图卷积神经网络(GCNs)通过融合网络的结构信息和内容信息,在图表示学习领域展示了非凡的能力。虽然基于GCN的聚类方法被用作图聚类的最先进的替代解决方案,但由于考虑到每个节点的局部邻域,这些方法无法捕获网络的全局结构信息。在这里,我们提出了一种集成的新颖的图卷积聚类方法,使我们能够提取基于图的数据的局部和全局结构以及节点内容。在三个现实世界基准信息网络上的实验研究证实了我们的方法,并证实我们提出的方法在图聚类和链接预测任务中显著优于基线方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信