A Pytorch implementation of "Splitter: Learning Node Representations that Capture Multiple Social Contexts" (WWW 2019).

Implementation of "Overlapping Community Detection with Graph Neural Networks"

Deep Autoencoder-like NMF

This project is to implement the algorithm discussed in Efficient Identification of Overlapping Communities.

This repository contains the OCD service of WebOCD. In the repository, java based codes of overlapping community detection algorithms (OCDA) can be found.

Source code of our paper: An overlapping community detection algorithm based on density peaks

The source code of EMOFM-DK : An Evolutionary Multiobjective Optimization Based Fuzzy Method for Overlapping Community Detection

Discrete Overlapping Community Detection with Pseudo Supervision

APAL: Adjacency Propagation Algorithm for overlapping community detection

Dynamic Edge Partition Models for Overlapping Community Detection and Temporal Links Prediction

Overlapping community detection based on the union of all maximum spanning trees

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 technique…

Benchmark Generator for Dynamic Overlapping Communities

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, wit…

Ego zones