benedekrozemberczki/Splitter

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

Language: Python - Size: 11.4 MB - Last synced at: about 1 month ago - Pushed at: about 2 years ago - Stars: 213 - Forks: 44

shchur/overlapping-community-detection

Implementation of "Overlapping Community Detection with Graph Neural Networks"

Language: Jupyter Notebook - Size: 16.3 MB - Last synced at: 2 months ago - Pushed at: over 4 years ago - Stars: 163 - Forks: 47

smartyfh/DANMF

Deep Autoencoder-like NMF

Language: MATLAB - Size: 6.84 KB - Last synced at: 3 months ago - Pushed at: over 4 years ago - Stars: 23 - Forks: 8

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.

Language: Java - Size: 291 MB - Last synced at: 2 months ago - Pushed at: 10 months ago - Stars: 14 - Forks: 10

XueyingBai/An-overlapping-community-detection-algorithm-based-on-density-peaks

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

Language: Matlab - Size: 128 KB - Last synced at: about 1 year ago - Pushed at: about 7 years ago - Stars: 10 - Forks: 3

DevilYangS/EMOFM

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

Language: MATLAB - Size: 404 KB - Last synced at: over 2 years ago - Pushed at: almost 5 years ago - Stars: 8 - Forks: 3

smartyfh/DNMF

Discrete Overlapping Community Detection with Pseudo Supervision

Language: MATLAB - Size: 10.7 KB - Last synced at: over 2 years ago - Pushed at: over 3 years ago - Stars: 7 - Forks: 1

justin830827/Overlapping-Community-Detection

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

Language: Python - Size: 21.5 MB - Last synced at: over 2 years ago - Pushed at: over 3 years ago - Stars: 7 - Forks: 2

koguz/APAL

APAL: Adjacency Propagation Algorithm for overlapping community detection

Language: Python - Size: 23.4 KB - Last synced at: 12 months ago - Pushed at: 12 months ago - Stars: 3 - Forks: 1

stephenyang/dynamic-Edge-Partition-Models

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

Language: MATLAB - Size: 425 KB - Last synced at: 3 months ago - Pushed at: almost 6 years ago - Stars: 2 - Forks: 2

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.

Language: Jupyter Notebook - Size: 14.4 MB - Last synced at: over 2 years ago - Pushed at: over 4 years ago - Stars: 1 - Forks: 0

tusharkini/CSC591GraphP2

Language: Python - Size: 23.7 MB - Last synced at: about 2 years ago - Pushed at: over 2 years ago - Stars: 0 - Forks: 0

l-pa/ego

Ego zones

Language: TypeScript - Size: 2.7 MB - Last synced at: about 1 year ago - Pushed at: about 3 years ago - Stars: 0 - Forks: 0

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.

Size: 1.59 MB - Last synced at: over 2 years ago - Pushed at: over 3 years ago - Stars: 0 - Forks: 0