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.