A DC programming approach for finding communities in networks
Automatic discovery of community structures in complex networks is a fundamental task in many disciplines, including physics, biology, and the social sciences. The most used criterion for characterizing the existence of a community structure in a network is modularity, a quantitative measure propose...
Gespeichert in:
| Veröffentlicht in: | Neural computation Jg. 26; H. 12; S. 2827 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
United States
01.12.2014
|
| Schlagworte: | |
| ISSN: | 1530-888X, 1530-888X |
| Online-Zugang: | Weitere Angaben |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Automatic discovery of community structures in complex networks is a fundamental task in many disciplines, including physics, biology, and the social sciences. The most used criterion for characterizing the existence of a community structure in a network is modularity, a quantitative measure proposed by Newman and Girvan (2004). The discovery community can be formulated as the so-called modularity maximization problem that consists of finding a partition of nodes of a network with the highest modularity. In this letter, we propose a fast and scalable algorithm called DCAM, based on DC (difference of convex function) programming and DCA (DC algorithms), an innovative approach in nonconvex programming framework for solving the modularity maximization problem. The special structure of the problem considered here has been well exploited to get an inexpensive DCA scheme that requires only a matrix-vector product at each iteration. Starting with a very large number of communities, DCAM furnishes, as output results, an optimal partition together with the optimal number of communities [Formula: see text]; that is, the number of communities is discovered automatically during DCAM's iterations. Numerical experiments are performed on a variety of real-world network data sets with up to 4,194,304 nodes and 30,359,198 edges. The comparative results with height reference algorithms show that the proposed approach outperforms them not only on quality and rapidity but also on scalability. Moreover, it realizes a very good trade-off between the quality of solutions and the run time. |
|---|---|
| AbstractList | Automatic discovery of community structures in complex networks is a fundamental task in many disciplines, including physics, biology, and the social sciences. The most used criterion for characterizing the existence of a community structure in a network is modularity, a quantitative measure proposed by Newman and Girvan (2004). The discovery community can be formulated as the so-called modularity maximization problem that consists of finding a partition of nodes of a network with the highest modularity. In this letter, we propose a fast and scalable algorithm called DCAM, based on DC (difference of convex function) programming and DCA (DC algorithms), an innovative approach in nonconvex programming framework for solving the modularity maximization problem. The special structure of the problem considered here has been well exploited to get an inexpensive DCA scheme that requires only a matrix-vector product at each iteration. Starting with a very large number of communities, DCAM furnishes, as output results, an optimal partition together with the optimal number of communities [Formula: see text]; that is, the number of communities is discovered automatically during DCAM's iterations. Numerical experiments are performed on a variety of real-world network data sets with up to 4,194,304 nodes and 30,359,198 edges. The comparative results with height reference algorithms show that the proposed approach outperforms them not only on quality and rapidity but also on scalability. Moreover, it realizes a very good trade-off between the quality of solutions and the run time.Automatic discovery of community structures in complex networks is a fundamental task in many disciplines, including physics, biology, and the social sciences. The most used criterion for characterizing the existence of a community structure in a network is modularity, a quantitative measure proposed by Newman and Girvan (2004). The discovery community can be formulated as the so-called modularity maximization problem that consists of finding a partition of nodes of a network with the highest modularity. In this letter, we propose a fast and scalable algorithm called DCAM, based on DC (difference of convex function) programming and DCA (DC algorithms), an innovative approach in nonconvex programming framework for solving the modularity maximization problem. The special structure of the problem considered here has been well exploited to get an inexpensive DCA scheme that requires only a matrix-vector product at each iteration. Starting with a very large number of communities, DCAM furnishes, as output results, an optimal partition together with the optimal number of communities [Formula: see text]; that is, the number of communities is discovered automatically during DCAM's iterations. Numerical experiments are performed on a variety of real-world network data sets with up to 4,194,304 nodes and 30,359,198 edges. The comparative results with height reference algorithms show that the proposed approach outperforms them not only on quality and rapidity but also on scalability. Moreover, it realizes a very good trade-off between the quality of solutions and the run time. Automatic discovery of community structures in complex networks is a fundamental task in many disciplines, including physics, biology, and the social sciences. The most used criterion for characterizing the existence of a community structure in a network is modularity, a quantitative measure proposed by Newman and Girvan (2004). The discovery community can be formulated as the so-called modularity maximization problem that consists of finding a partition of nodes of a network with the highest modularity. In this letter, we propose a fast and scalable algorithm called DCAM, based on DC (difference of convex function) programming and DCA (DC algorithms), an innovative approach in nonconvex programming framework for solving the modularity maximization problem. The special structure of the problem considered here has been well exploited to get an inexpensive DCA scheme that requires only a matrix-vector product at each iteration. Starting with a very large number of communities, DCAM furnishes, as output results, an optimal partition together with the optimal number of communities [Formula: see text]; that is, the number of communities is discovered automatically during DCAM's iterations. Numerical experiments are performed on a variety of real-world network data sets with up to 4,194,304 nodes and 30,359,198 edges. The comparative results with height reference algorithms show that the proposed approach outperforms them not only on quality and rapidity but also on scalability. Moreover, it realizes a very good trade-off between the quality of solutions and the run time. |
| Author | Dinh, Tao Pham Nguyen, Manh Cuong Le Thi, Hoai An |
| Author_xml | – sequence: 1 givenname: Hoai An surname: Le Thi fullname: Le Thi, Hoai An email: hoai-an.le-thi@univ-lorraine.fr organization: Laboratory of Theoretical and Applied Computer Science, University of Lorraine, Ile du Saulcy, 57045 Metz, France hoai-an.le-thi@univ-lorraine.fr – sequence: 2 givenname: Manh Cuong surname: Nguyen fullname: Nguyen, Manh Cuong – sequence: 3 givenname: Tao Pham surname: Dinh fullname: Dinh, Tao Pham |
| BackLink | https://www.ncbi.nlm.nih.gov/pubmed/25248085$$D View this record in MEDLINE/PubMed |
| BookMark | eNpNkL1PwzAQxS1URD9gY0YeWQJnJ06cgaFKy4dU0aUDW-Q6djHETrATIf57jCgS0907_fT03s3RxHVOIXRJ4IaQnN4-r6ttLWqAvEhP0IywFBLO-cvk3z5F8xDeIDIE2BmaUkYzDpzN0N0Sryrc--7ghbXGHbDooxLyFevOY21c83OUnbWjM4NRARuHnRo-O_8eztGpFm1QF8e5QLv79a56TDbbh6dquUlkVhRDImNQWTLFiJaFYMBKELkUWUpAUp1yRUUmebmXjJRQQgqEca01AMt0QwVdoOtf25jsY1RhqK0JUrWtcKobQx3fQGM1BkVEr47ouLeqqXtvrPBf9V9j-g2pCFjD |
| CitedBy_id | crossref_primary_10_1007_s10489_016_0778_y crossref_primary_10_1007_s10898_023_01272_1 crossref_primary_10_1016_j_cor_2016_11_003 crossref_primary_10_1162_NECO_a_00836 crossref_primary_10_1007_s10472_021_09732_8 crossref_primary_10_1007_s11590_020_01696_8 crossref_primary_10_1007_s10898_018_0698_y crossref_primary_10_1007_s10915_025_02900_6 crossref_primary_10_3233_JIFS_181501 crossref_primary_10_1007_s10107_018_1235_y crossref_primary_10_1007_s11081_017_9359_0 |
| ContentType | Journal Article |
| DBID | CGR CUY CVF ECM EIF NPM 7X8 |
| DOI | 10.1162/NECO_a_00673 |
| DatabaseName | Medline MEDLINE MEDLINE (Ovid) MEDLINE MEDLINE PubMed MEDLINE - Academic |
| DatabaseTitle | MEDLINE Medline Complete MEDLINE with Full Text PubMed MEDLINE (Ovid) MEDLINE - Academic |
| DatabaseTitleList | MEDLINE - Academic MEDLINE |
| Database_xml | – sequence: 1 dbid: NPM name: PubMed url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 2 dbid: 7X8 name: MEDLINE - Academic url: https://search.proquest.com/medline sourceTypes: Aggregation Database |
| DeliveryMethod | no_fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1530-888X |
| ExternalDocumentID | 25248085 |
| Genre | Research Support, Non-U.S. Gov't Journal Article |
| GroupedDBID | --- -~X .4S .DC 0R~ 123 36B 4.4 41~ 53G 6IK AAFWJ AAJGR AALMD ABAZT ABDBF ABDNZ ABEFU ABIVO ABJNI ABVLG ACGFO ACUHS ACYGS ADIYS ADMLS AEGXH AEILP AENEX AIAGR ALMA_UNASSIGNED_HOLDINGS AMVHM ARCSS AVWKF AZFZN BEFXN BFFAM BGNUA BKEBE BPEOZ CAG CGR COF CS3 CUY CVF DU5 EAP EAS EBC EBD EBS ECM ECS EDO EIF EJD EMB EMK EMOBN EPL EPS EST ESX F5P FEDTE FNEHJ HVGLF HZ~ H~9 I-F IPLJI JAVBF MCG MINIK MKJ NPM O9- OCL P2P PK0 PQQKQ RMI SV3 TUS WG8 WH7 XJE ZWS 7X8 |
| ID | FETCH-LOGICAL-c477t-c116c95e51fc7a50590a6ca4310c2f38e2a4c89bc51909030158fff0054fd2a2 |
| IEDL.DBID | 7X8 |
| ISICitedReferencesCount | 17 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000344921400006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1530-888X |
| IngestDate | Wed Oct 01 13:45:29 EDT 2025 Mon Jul 21 05:57:20 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 12 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c477t-c116c95e51fc7a50590a6ca4310c2f38e2a4c89bc51909030158fff0054fd2a2 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| PMID | 25248085 |
| PQID | 1622061507 |
| PQPubID | 23479 |
| ParticipantIDs | proquest_miscellaneous_1622061507 pubmed_primary_25248085 |
| PublicationCentury | 2000 |
| PublicationDate | 2014-12-01 |
| PublicationDateYYYYMMDD | 2014-12-01 |
| PublicationDate_xml | – month: 12 year: 2014 text: 2014-12-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | United States |
| PublicationPlace_xml | – name: United States |
| PublicationTitle | Neural computation |
| PublicationTitleAlternate | Neural Comput |
| PublicationYear | 2014 |
| SSID | ssj0006105 |
| Score | 2.2223308 |
| Snippet | Automatic discovery of community structures in complex networks is a fundamental task in many disciplines, including physics, biology, and the social sciences.... |
| SourceID | proquest pubmed |
| SourceType | Aggregation Database Index Database |
| StartPage | 2827 |
| SubjectTerms | Algorithms Community Networks Humans Models, Theoretical |
| Title | A DC programming approach for finding communities in networks |
| URI | https://www.ncbi.nlm.nih.gov/pubmed/25248085 https://www.proquest.com/docview/1622061507 |
| Volume | 26 |
| WOSCitedRecordID | wos000344921400006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV09T8MwELWAMrBQvilfMhKr1dTxVwaEqtKKhdChQ7bIcWypA2khhd_POU7UCQmJJUOURMnpzn7xPb-H0IPjWnIaMZJYHhNWWkq0cIpwyYT2Mj-sNI3ZhExTlWXJvF1wq1taZTcmNgN1uTJ-jXw4EpQ26uXyaf1BvGuU7662Fhq7qBcDlPGFKbOtWrgIFEYo6ojAn17WEd8FHabTyVuu88an5Xdw2Uwys_5_X-8IHbbwEo9DPhyjHVudoH5n3YDbSj5Fj2P8PMEtOesdpi_ciYtjQLG46WTDSRO2j3jRVbyscBU44_UZWsymi8kLaZ0UiGFSboiBbzYJt3zkjNTcbzjVwmgAD5GhLlaWamZUUhjAc37hBjCCcs55POdKquk52qtWlb1E2LBE6ih2ynLLBHMqLgpZRBouTAQ8Z4Duu_jkkKi--6Aru_qq822EBugiBDlfB0WNnHLKFIC_qz_cfY0OALSwQCm5QT0HZWpv0b753izrz7smA-CYzl9_AD70ukg |
| linkProvider | ProQuest |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+DC+programming+approach+for+finding+communities+in+networks&rft.jtitle=Neural+computation&rft.au=Le+Thi%2C+Hoai+An&rft.au=Nguyen%2C+Manh+Cuong&rft.au=Dinh%2C+Tao+Pham&rft.date=2014-12-01&rft.eissn=1530-888X&rft.volume=26&rft.issue=12&rft.spage=2827&rft_id=info:doi/10.1162%2FNECO_a_00673&rft_id=info%3Apmid%2F25248085&rft_id=info%3Apmid%2F25248085&rft.externalDocID=25248085 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1530-888X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1530-888X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1530-888X&client=summon |