A novel robust memetic algorithm for dynamic community structures detection in complex networks
Networks in the real world are dynamic and evolving. The most critical process in networks is to determine the structure of the community, based on which we can detect hidden communities in a complex network. The design of strong network structures is of great importance, meaning that a system must...
Gespeichert in:
Veröffentlicht in: | World wide web (Bussum) 2024, Vol.27 (1), p.3, Article 3 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | 1 |
container_start_page | 3 |
container_title | World wide web (Bussum) |
container_volume | 27 |
creator | Ranjkesh, Somayeh Masoumi, Behrooz Hashemi, Seyyed Mohsen |
description | Networks in the real world are dynamic and evolving. The most critical process in networks is to determine the structure of the community, based on which we can detect hidden communities in a complex network. The design of strong network structures is of great importance, meaning that a system must maintain its function in the face of attacks and failures and have a strong community structure. In this paper, we proposed the robust memetic algorithm and used the idea to optimize the detection of dynamic communities in complex networks called RDMA_NET (Robust Dynamic Memetic Algorithm). In this method, we work on dynamic data that affects the two main parts of the initial population value and the calculation of the evaluation function of each population, and there is no need to determine the number of communities in advance. We used two sets of real-world networks and the LFR dataset. The results show that our proposed method, RDMA_Net, can find a better solution than modern approaches and provide near-optimal performance in search of network topologies with a strong community structure. |
doi_str_mv | 10.1007/s11280-024-01238-7 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2915813615</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2915813615</sourcerecordid><originalsourceid>FETCH-LOGICAL-c319t-b7fce18d87db328d8713892e21d9485a54eb59fc0045bfde7d4d1b3dcc812b8c3</originalsourceid><addsrcrecordid>eNp9kE9LxDAQxYMouK5-AU8Bz9VM0mzT47L4DwQvCt5Cm0zXrm2zJqm6396sFbx5msfw3pvhR8g5sEtgrLgKAFyxjPE8Y8CFyooDMgNZiAxyEIdJC7VIWr4ck5MQNoyxhShhRvSSDu4DO-pdPYZIe-wxtoZW3dr5Nr72tHGe2t1Q9WlrXN-PQxt3NEQ_mjh6DNRiRBNbN9B22Du2HX7RAeOn82_hlBw1VRfw7HfOyfPN9dPqLnt4vL1fLR8yI6CMWV00BkFZVdha8P1MD5ccOdgyV7KSOdaybAxjuawbi4XNLdTCGqOA18qIObmYerfevY8Yot640Q_ppOYlSAViATK5-OQy3oXgsdFb3_aV32lgeg9STyB1Aql_QOoihcQUCsk8rNH_Vf-T-gbrmXhW</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2915813615</pqid></control><display><type>article</type><title>A novel robust memetic algorithm for dynamic community structures detection in complex networks</title><source>SpringerNature Journals</source><creator>Ranjkesh, Somayeh ; Masoumi, Behrooz ; Hashemi, Seyyed Mohsen</creator><creatorcontrib>Ranjkesh, Somayeh ; Masoumi, Behrooz ; Hashemi, Seyyed Mohsen</creatorcontrib><description>Networks in the real world are dynamic and evolving. The most critical process in networks is to determine the structure of the community, based on which we can detect hidden communities in a complex network. The design of strong network structures is of great importance, meaning that a system must maintain its function in the face of attacks and failures and have a strong community structure. In this paper, we proposed the robust memetic algorithm and used the idea to optimize the detection of dynamic communities in complex networks called RDMA_NET (Robust Dynamic Memetic Algorithm). In this method, we work on dynamic data that affects the two main parts of the initial population value and the calculation of the evaluation function of each population, and there is no need to determine the number of communities in advance. We used two sets of real-world networks and the LFR dataset. The results show that our proposed method, RDMA_Net, can find a better solution than modern approaches and provide near-optimal performance in search of network topologies with a strong community structure.</description><identifier>ISSN: 1386-145X</identifier><identifier>EISSN: 1573-1413</identifier><identifier>DOI: 10.1007/s11280-024-01238-7</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Algorithms ; Computer Science ; Database Management ; Information Systems Applications (incl.Internet) ; Network topologies ; Operating Systems ; Optimization ; Robustness</subject><ispartof>World wide web (Bussum), 2024, Vol.27 (1), p.3, Article 3</ispartof><rights>The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c319t-b7fce18d87db328d8713892e21d9485a54eb59fc0045bfde7d4d1b3dcc812b8c3</citedby><cites>FETCH-LOGICAL-c319t-b7fce18d87db328d8713892e21d9485a54eb59fc0045bfde7d4d1b3dcc812b8c3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s11280-024-01238-7$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s11280-024-01238-7$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,41488,42557,51319</link.rule.ids></links><search><creatorcontrib>Ranjkesh, Somayeh</creatorcontrib><creatorcontrib>Masoumi, Behrooz</creatorcontrib><creatorcontrib>Hashemi, Seyyed Mohsen</creatorcontrib><title>A novel robust memetic algorithm for dynamic community structures detection in complex networks</title><title>World wide web (Bussum)</title><addtitle>World Wide Web</addtitle><description>Networks in the real world are dynamic and evolving. The most critical process in networks is to determine the structure of the community, based on which we can detect hidden communities in a complex network. The design of strong network structures is of great importance, meaning that a system must maintain its function in the face of attacks and failures and have a strong community structure. In this paper, we proposed the robust memetic algorithm and used the idea to optimize the detection of dynamic communities in complex networks called RDMA_NET (Robust Dynamic Memetic Algorithm). In this method, we work on dynamic data that affects the two main parts of the initial population value and the calculation of the evaluation function of each population, and there is no need to determine the number of communities in advance. We used two sets of real-world networks and the LFR dataset. The results show that our proposed method, RDMA_Net, can find a better solution than modern approaches and provide near-optimal performance in search of network topologies with a strong community structure.</description><subject>Algorithms</subject><subject>Computer Science</subject><subject>Database Management</subject><subject>Information Systems Applications (incl.Internet)</subject><subject>Network topologies</subject><subject>Operating Systems</subject><subject>Optimization</subject><subject>Robustness</subject><issn>1386-145X</issn><issn>1573-1413</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><recordid>eNp9kE9LxDAQxYMouK5-AU8Bz9VM0mzT47L4DwQvCt5Cm0zXrm2zJqm6396sFbx5msfw3pvhR8g5sEtgrLgKAFyxjPE8Y8CFyooDMgNZiAxyEIdJC7VIWr4ck5MQNoyxhShhRvSSDu4DO-pdPYZIe-wxtoZW3dr5Nr72tHGe2t1Q9WlrXN-PQxt3NEQ_mjh6DNRiRBNbN9B22Du2HX7RAeOn82_hlBw1VRfw7HfOyfPN9dPqLnt4vL1fLR8yI6CMWV00BkFZVdha8P1MD5ccOdgyV7KSOdaybAxjuawbi4XNLdTCGqOA18qIObmYerfevY8Yot640Q_ppOYlSAViATK5-OQy3oXgsdFb3_aV32lgeg9STyB1Aql_QOoihcQUCsk8rNH_Vf-T-gbrmXhW</recordid><startdate>2024</startdate><enddate>2024</enddate><creator>Ranjkesh, Somayeh</creator><creator>Masoumi, Behrooz</creator><creator>Hashemi, Seyyed Mohsen</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>2024</creationdate><title>A novel robust memetic algorithm for dynamic community structures detection in complex networks</title><author>Ranjkesh, Somayeh ; Masoumi, Behrooz ; Hashemi, Seyyed Mohsen</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c319t-b7fce18d87db328d8713892e21d9485a54eb59fc0045bfde7d4d1b3dcc812b8c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Algorithms</topic><topic>Computer Science</topic><topic>Database Management</topic><topic>Information Systems Applications (incl.Internet)</topic><topic>Network topologies</topic><topic>Operating Systems</topic><topic>Optimization</topic><topic>Robustness</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ranjkesh, Somayeh</creatorcontrib><creatorcontrib>Masoumi, Behrooz</creatorcontrib><creatorcontrib>Hashemi, Seyyed Mohsen</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>World wide web (Bussum)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ranjkesh, Somayeh</au><au>Masoumi, Behrooz</au><au>Hashemi, Seyyed Mohsen</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A novel robust memetic algorithm for dynamic community structures detection in complex networks</atitle><jtitle>World wide web (Bussum)</jtitle><stitle>World Wide Web</stitle><date>2024</date><risdate>2024</risdate><volume>27</volume><issue>1</issue><spage>3</spage><pages>3-</pages><artnum>3</artnum><issn>1386-145X</issn><eissn>1573-1413</eissn><abstract>Networks in the real world are dynamic and evolving. The most critical process in networks is to determine the structure of the community, based on which we can detect hidden communities in a complex network. The design of strong network structures is of great importance, meaning that a system must maintain its function in the face of attacks and failures and have a strong community structure. In this paper, we proposed the robust memetic algorithm and used the idea to optimize the detection of dynamic communities in complex networks called RDMA_NET (Robust Dynamic Memetic Algorithm). In this method, we work on dynamic data that affects the two main parts of the initial population value and the calculation of the evaluation function of each population, and there is no need to determine the number of communities in advance. We used two sets of real-world networks and the LFR dataset. The results show that our proposed method, RDMA_Net, can find a better solution than modern approaches and provide near-optimal performance in search of network topologies with a strong community structure.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s11280-024-01238-7</doi></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1386-145X |
ispartof | World wide web (Bussum), 2024, Vol.27 (1), p.3, Article 3 |
issn | 1386-145X 1573-1413 |
language | eng |
recordid | cdi_proquest_journals_2915813615 |
source | SpringerNature Journals |
subjects | Algorithms Computer Science Database Management Information Systems Applications (incl.Internet) Network topologies Operating Systems Optimization Robustness |
title | A novel robust memetic algorithm for dynamic community structures detection in complex networks |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T02%3A24%3A46IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20novel%20robust%20memetic%20algorithm%20for%20dynamic%20community%20structures%20detection%20in%20complex%20networks&rft.jtitle=World%20wide%20web%20(Bussum)&rft.au=Ranjkesh,%20Somayeh&rft.date=2024&rft.volume=27&rft.issue=1&rft.spage=3&rft.pages=3-&rft.artnum=3&rft.issn=1386-145X&rft.eissn=1573-1413&rft_id=info:doi/10.1007/s11280-024-01238-7&rft_dat=%3Cproquest_cross%3E2915813615%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2915813615&rft_id=info:pmid/&rfr_iscdi=true |