Abstract
We have found that known community identification algorithms produce inconsistent communities when the node ordering changes at input. We propose two metrics to quantify the level of consistency across multiple runs of an algorithm: pairwise membership probability and consistency. Based on these two metrics, we address the consistency problem without compromising the modularity. Our solution uses pairwise membership probabilities as link weights and generates consistent communities within six or fewer cycles. It offers a new tool in the study of community structures and their evolutions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
