overlapping-community-detection
There are 17 repositories under overlapping-community-detection topic.
benedekrozemberczki/Splitter
A Pytorch implementation of "Splitter: Learning Node Representations that Capture Multiple Social Contexts" (WWW 2019).
shchur/overlapping-community-detection
Implementation of "Overlapping Community Detection with Graph Neural Networks"
smartyfh/DANMF
Deep Autoencoder-like NMF
rwth-acis/REST-OCD-Services
This repository contains the OCD service of WebOCD. In the repository, java based codes of overlapping community detection algorithms (OCDA) can be found.
justin830827/Overlapping-Community-Detection
This project is to implement the algorithm discussed in Efficient Identification of Overlapping Communities.
DevilYangS/EMOFM
The source code of EMOFM-DK : An Evolutionary Multiobjective Optimization Based Fuzzy Method for Overlapping Community Detection
XueyingBai/An-overlapping-community-detection-algorithm-based-on-density-peaks
Source code of our paper: An overlapping community detection algorithm based on density peaks
smartyfh/DNMF
Discrete Overlapping Community Detection with Pseudo Supervision
koguz/APAL
APAL: Adjacency Propagation Algorithm for overlapping community detection
stephenyang/dynamic-Edge-Partition-Models
Dynamic Edge Partition Models for Overlapping Community Detection and Temporal Links Prediction
khawka/UMSTMO
Overlapping community detection based on the union of all maximum spanning trees
senguptaneha/DynamicBenchmarkGenerator
Benchmark Generator for Dynamic Overlapping Communities
skaraoglu/Community-Detection-on-Graphs-with-Multiple-Layered-Community-Structure
This project focuses on the community structure analysis on graphs with multiple layers of community structures embedded in it. To conduct experiments on multiple layers of community structures in the graph, graphs that are based on the same nodes but wired with different edges are merged. Then the merged graph is analyzed by different techniques - such as community detection algorithms, overlapping community detection algorithms, nested community detection algorithms - to recover information about community structures set in the merged graph.
l-pa/ego
Ego zones
skaraoglu/Community-Detection-of-Superimposed-Relational-Structures
Algorithms for “community” or cohesive subgraph detection are frequently used to analyze network representations of complex systems, and constitute an active area of methodological research. Algorithms for overlapping community detection are of particular interest, because it is often unrealistic to form strict partitions of natural systems, with at least some nodes participating in multiple clusters. However, the literature on overlapping communities does not distinguish different sources of potential overlap. This paper begins by discussing randomness, bridging nodes, and superimposed relational structures as three distinct sources of overlapping communities. It then focuses on the third source (neglected in the literature), by constructing test graphs that merge two distinct relational structures and comparing the communities identified by eight partition and overlapping community algorithms. Results show that most algorithms focus on the same source structure in each graph, ignoring the other, although a few algorithms find combined or nested communities from both structures.