Symmetry Structure Research of Complex Community from Disconnection Vertexes Perspective

Duo Zhai, Jing Shan, Jiaying Wang, Mingyang Shao, Jianzhao Cao
{"title":"Symmetry Structure Research of Complex Community from Disconnection Vertexes Perspective","authors":"Duo Zhai, Jing Shan, Jiaying Wang, Mingyang Shao, Jianzhao Cao","doi":"10.1109/IUCC/DSCI/SmartCNS.2019.00078","DOIUrl":null,"url":null,"abstract":"With the development of social network, current research on social network is analyzed by graph theory. According to the topology, studies can determine the social network, and analyze many practical problems, such as social ties, group cooperation, team influence, hot spread node of overlapping community and so on. Now, available research for community mining establishes algorithms widely by analyzing the section topology of neighbor vertexes. However, little consider topology formability or symmetries. For the research, we propose an algorithm, in which the complex graphs are considered as some isolated vertexes through the model of granular graph. This paper proposes an approach to mine outliers based on graph adjacency matrix and combinatorial mathematics, then analyses the symmetries of outliers for overall structure.","PeriodicalId":410905,"journal":{"name":"2019 IEEE International Conferences on Ubiquitous Computing & Communications (IUCC) and Data Science and Computational Intelligence (DSCI) and Smart Computing, Networking and Services (SmartCNS)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE International Conferences on Ubiquitous Computing & Communications (IUCC) and Data Science and Computational Intelligence (DSCI) and Smart Computing, Networking and Services (SmartCNS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IUCC/DSCI/SmartCNS.2019.00078","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

With the development of social network, current research on social network is analyzed by graph theory. According to the topology, studies can determine the social network, and analyze many practical problems, such as social ties, group cooperation, team influence, hot spread node of overlapping community and so on. Now, available research for community mining establishes algorithms widely by analyzing the section topology of neighbor vertexes. However, little consider topology formability or symmetries. For the research, we propose an algorithm, in which the complex graphs are considered as some isolated vertexes through the model of granular graph. This paper proposes an approach to mine outliers based on graph adjacency matrix and combinatorial mathematics, then analyses the symmetries of outliers for overall structure.
基于断连顶点的复杂群落对称结构研究
随着社会网络的发展,本文从图论的角度分析了社会网络的研究现状。根据拓扑图,研究可以确定社会网络,并分析许多实际问题,如社会关系、群体合作、团队影响、重叠社区的热传播节点等。目前,已有的社区挖掘研究大多是通过分析邻近顶点的截面拓扑来建立算法的。然而,很少考虑拓扑可成形性或对称性。在研究中,我们提出了一种算法,该算法通过颗粒图模型将复图视为一些孤立的顶点。提出了一种基于图邻接矩阵和组合数学的离群点挖掘方法,分析了离群点在整体结构上的对称性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信