A Comparison of Overlapping Community Detection in Large Complex Network

Khyati Fatania, D. Joshi, T. Patalia, Yasmin Jejani
{"title":"A Comparison of Overlapping Community Detection in Large Complex Network","authors":"Khyati Fatania, D. Joshi, T. Patalia, Yasmin Jejani","doi":"10.1109/ICRAECC43874.2019.8994969","DOIUrl":null,"url":null,"abstract":"Many large scale network contains community structure, that nodes are densely connected with own group and less connected to other groups. Community contains users those having similar characteristics from other groups or community. Now days, more number of people are paying attention on social network for information, news, comments, likes etc. Due to this social network sites generates large number of data. These issues often make social network data very complex to analyze manually. In network, there may be possibilities that one node may belongs to one or more than one groups that is called overlapping of nodes. Possibility of overlapping community is high in real world network. There are many fields in which community detection is necessary for example in politics, business, news, and social network like Facebook, Twitter, and LinkedIn etc. In social network large number of overlapping community is available, for analysis of this type of communities or groups in network is tedious task. Therefore research work is based on a heuristic approach to discover overlapped community in large complex network.","PeriodicalId":137313,"journal":{"name":"2019 International Conference on Recent Advances in Energy-efficient Computing and Communication (ICRAECC)","volume":"197 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on Recent Advances in Energy-efficient Computing and Communication (ICRAECC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICRAECC43874.2019.8994969","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Many large scale network contains community structure, that nodes are densely connected with own group and less connected to other groups. Community contains users those having similar characteristics from other groups or community. Now days, more number of people are paying attention on social network for information, news, comments, likes etc. Due to this social network sites generates large number of data. These issues often make social network data very complex to analyze manually. In network, there may be possibilities that one node may belongs to one or more than one groups that is called overlapping of nodes. Possibility of overlapping community is high in real world network. There are many fields in which community detection is necessary for example in politics, business, news, and social network like Facebook, Twitter, and LinkedIn etc. In social network large number of overlapping community is available, for analysis of this type of communities or groups in network is tedious task. Therefore research work is based on a heuristic approach to discover overlapped community in large complex network.
大型复杂网络中重叠社区检测方法的比较
许多大型网络都包含社区结构,即节点与本组的连接密集,与其他组的连接较少。社区包含来自其他组或社区的具有相似特征的用户。现在,越来越多的人关注社交网络的信息,新闻,评论,喜欢等。因此,社交网站产生了大量的数据。这些问题通常会使社交网络数据变得非常复杂,难以手工分析。在网络中,一个节点可能属于一个或多个组,这种情况称为节点重叠。在现实网络中,社区重叠的可能性很高。在许多领域,社区检测是必要的,例如在政治、商业、新闻和社交网络,如Facebook、Twitter和LinkedIn等。在社会网络中存在着大量的重叠社区,对网络中这种类型的社区或群体进行分析是一项繁琐的任务。因此,研究工作是基于启发式方法来发现大型复杂网络中的重叠社区。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信