Incremental methods for community detection in both fully and growing dynamic networks

IF 0.3 Q4 COMPUTER SCIENCE, THEORY & METHODS Acta Universitatis Sapientiae Informatica Pub Date : 2021-12-01 DOI:10.2478/ausi-2021-0010
Fariza Bouhatem, Ali Aït El Hadj, F. Souam, A. Dafeur
{"title":"Incremental methods for community detection in both fully and growing dynamic networks","authors":"Fariza Bouhatem, Ali Aït El Hadj, F. Souam, A. Dafeur","doi":"10.2478/ausi-2021-0010","DOIUrl":null,"url":null,"abstract":"Abstract In recent years, community detection in dynamic networks has received great interest. Due to its importance, many surveys have been suggested. In these surveys, the authors present and detail a number of methods that identify a community without taking into account the incremental methods which, in turn, also take an important place in dynamic community detection methods. In this survey, we provide a review of incremental approaches to community detection in both fully and growing dynamic networks. To do this, we have classified the methods according to the type of network. For each type of network, we describe three main approaches: the first one is based on modularity optimization; the second is based on density; finally, the third is based on label propagation. For each method, we list the studies available in the literature and state their drawbacks and advantages.","PeriodicalId":41480,"journal":{"name":"Acta Universitatis Sapientiae Informatica","volume":"20 1","pages":"220 - 250"},"PeriodicalIF":0.3000,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Universitatis Sapientiae Informatica","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/ausi-2021-0010","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 2

Abstract

Abstract In recent years, community detection in dynamic networks has received great interest. Due to its importance, many surveys have been suggested. In these surveys, the authors present and detail a number of methods that identify a community without taking into account the incremental methods which, in turn, also take an important place in dynamic community detection methods. In this survey, we provide a review of incremental approaches to community detection in both fully and growing dynamic networks. To do this, we have classified the methods according to the type of network. For each type of network, we describe three main approaches: the first one is based on modularity optimization; the second is based on density; finally, the third is based on label propagation. For each method, we list the studies available in the literature and state their drawbacks and advantages.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
完全动态网络和增长动态网络中社区检测的增量方法
近年来,动态网络中的社区检测受到了广泛关注。由于它的重要性,人们建议进行许多调查。在这些调查中,作者提出并详细介绍了许多识别社区的方法,而不考虑增量方法,增量方法反过来在动态社区检测方法中也占有重要地位。在本调查中,我们回顾了在完全动态网络和不断增长的动态网络中进行社区检测的增量方法。为此,我们根据网络的类型对方法进行了分类。对于每种类型的网络,我们描述了三种主要方法:第一种是基于模块化优化;第二种是基于密度;第三种是基于标签传播的方法。对于每种方法,我们列出了文献中可用的研究,并说明了它们的缺点和优点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Acta Universitatis Sapientiae Informatica
Acta Universitatis Sapientiae Informatica COMPUTER SCIENCE, THEORY & METHODS-
自引率
0.00%
发文量
9
期刊最新文献
E-super arithmetic graceful labelling of Hi(m, m), Hi(1) (m, m) and chain of even cycles On agglomeration-based rupture degree in networks and a heuristic algorithm On domination in signed graphs Connected certified domination edge critical and stable graphs Eccentric connectivity index in transformation graph Gxy+
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1