Output details
11 - Computer Science and Informatics
University of Bristol
Return to search
Output 0 of 0 in the submission
Article title
A fast algorithm to find overlapping communities in networks
Type
D - Journal article
Title of journal
Machine Learning and Knowledge Discovery in Databases (ECML/PKDD)
Article number
-
Volume number
5211
Issue number
-
First page of article
408
ISSN of journal
0302-9743
Year of publication
2008
Number of additional authors
0
Additional information
<13> This paper is a follow up from an earlier paper which described the CONGA algorithm, and describes various optimizations. The code for this paper has been made available online, and the algorithm has been used in various studies to detect overlapping communities in networks by other researchers.
Interdisciplinary
-
Cross-referral requested
-
Research group
B - Intelligent Systems Laboratory
Citation count
18
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
