Scalable and Accurate Graph Clustering and Community Structure Detection
| dc.contributor.author | Onus, Melih | |
| dc.contributor.author | Djidjev, Hristo N. | |
| dc.contributor.authorID | 103658 | tr_TR |
| dc.date.accessioned | 2020-05-15T08:57:51Z | |
| dc.date.accessioned | 2025-09-18T16:07:51Z | |
| dc.date.available | 2020-05-15T08:57:51Z | |
| dc.date.available | 2025-09-18T16:07:51Z | |
| dc.date.issued | 2013 | |
| dc.description | Djidjev, Hristo/0000-0001-9286-8824 | en_US |
| dc.description.abstract | One of the most useful measures of cluster quality is the modularity of the partition, which measures the difference between the number of the edges joining vertices from the same cluster and the expected number of such edges in a random graph. In this paper, we show that the problem of finding a partition maximizing the modularity of a given graph G can be reduced to a minimum weighted cut (MWC) problem on a complete graph with the same vertices as G. We then show that the resulting minimum cut problem can be efficiently solved by adapting existing graph partitioning techniques. Our algorithm finds clusterings of a comparable quality and is much faster than the existing clustering algorithms. | en_US |
| dc.description.publishedMonth | 5 | |
| dc.description.sponsorship | Department of Energy [W-705-ENG-36] | en_US |
| dc.description.sponsorship | The authors would like to thank the developers of METIS for making their source code publicly available and to Mark Newman, Jorg Reichardt, and Roger Guimera for providing the codes of their algorithms and for helpful comments. A preliminary version of this paper was presented at Fourth Workshop on Algorithms and Models for the Web-Graph (WAW 2006). This work has been supported by the Department of Energy under contract W-705-ENG-36. | en_US |
| dc.identifier.citation | Djidjev, HN.; Onus, Melih, "Scalable and accurate graph clustering and community structure detection" Ieee Transactions On Parallel And Distributed Systems, Vol.24, No.5, pp.1022-1029, (2013) | en_US |
| dc.identifier.doi | 10.1109/TPDS.2012.57 | |
| dc.identifier.issn | 1045-9219 | |
| dc.identifier.issn | 1558-2183 | |
| dc.identifier.scopus | 2-s2.0-84875756212 | |
| dc.identifier.uri | https://doi.org/10.1109/TPDS.2012.57 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12416/14871 | |
| dc.language.iso | en | en_US |
| dc.publisher | Ieee Computer Soc | en_US |
| dc.rights | info:eu-repo/semantics/closedAccess | en_US |
| dc.subject | Graph Clustering | en_US |
| dc.subject | Community Detection | en_US |
| dc.subject | Graph Partitioning | en_US |
| dc.subject | Multilevel Algorithms | en_US |
| dc.subject | Modularity | en_US |
| dc.title | Scalable and Accurate Graph Clustering and Community Structure Detection | en_US |
| dc.title | Scalable and accurate graph clustering and community structure detection | tr_TR |
| dc.type | Article | en_US |
| dspace.entity.type | Publication | |
| gdc.author.id | Djidjev, Hristo/0000-0001-9286-8824 | |
| gdc.author.institutional | Onuş, Melih | |
| gdc.author.scopusid | 6601961018 | |
| gdc.author.scopusid | 12239054400 | |
| gdc.author.wosid | Djidjev, Hristo/Aae-1232-2022 | |
| gdc.description.department | Çankaya University | en_US |
| gdc.description.departmenttemp | [Djidjev, Hristo N.] Los Alamos Natl Lab, Los Alamos, NM 87545 USA; [Onus, Melih] Cankaya Univ, Dept Comp Engn, TR-06810 Ankara, Turkey | en_US |
| gdc.description.endpage | 1029 | en_US |
| gdc.description.issue | 5 | en_US |
| gdc.description.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
| gdc.description.scopusquality | Q1 | |
| gdc.description.startpage | 1022 | en_US |
| gdc.description.volume | 24 | en_US |
| gdc.description.woscitationindex | Science Citation Index Expanded | |
| gdc.description.wosquality | Q1 | |
| gdc.identifier.openalex | W2082912941 | |
| gdc.identifier.wos | WOS:000316754600016 | |
| gdc.openalex.fwci | 1.44271289 | |
| gdc.openalex.normalizedpercentile | 0.84 | |
| gdc.opencitations.count | 24 | |
| gdc.plumx.crossrefcites | 24 | |
| gdc.plumx.mendeley | 42 | |
| gdc.plumx.scopuscites | 26 | |
| gdc.scopus.citedcount | 26 | |
| gdc.wos.citedcount | 17 | |
| relation.isAuthorOfPublication | d099f15c-86ba-44c6-904b-e2e9b66ec088 | |
| relation.isAuthorOfPublication.latestForDiscovery | d099f15c-86ba-44c6-904b-e2e9b66ec088 | |
| relation.isOrgUnitOfPublication | 0b9123e4-4136-493b-9ffd-be856af2cdb1 | |
| relation.isOrgUnitOfPublication | 12489df3-847d-4936-8339-f3d38607992f | |
| relation.isOrgUnitOfPublication | 43797d4e-4177-4b74-bd9b-38623b8aeefa | |
| relation.isOrgUnitOfPublication.latestForDiscovery | 0b9123e4-4136-493b-9ffd-be856af2cdb1 |