OBSOLETE : see graphology/graphology-communities-louvain & graphology/graphology-metrics
-
Updated
May 5, 2017 - JavaScript
OBSOLETE : see graphology/graphology-communities-louvain & graphology/graphology-metrics
Louvain community detection
Forked from https://sourceforge.net/projects/louvain/ . This fork attemps to fix some memory corruption bugs
Probably the first scalable and open source triangle count based on each edge, on scala and spark for every Big Dataset. (Louvain)
Repository dedicated to my project on PhenoGraph.
This project is as part of a workshop in Analysis of Biological Networks, instructed by Prof. Roded Sharan and Shani Jacobson. The workshop aims to improve existing algorithms for community detection in networks.
Datasets used in my bachelor thesis: "Louvain-initialized Genetic Algorithms for Community Detection in Complex Networks"
An R implementation of the Gene Frequency - Inverse Cell Frequency method for single cell data normalization
A PyTorch implementation of "Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks" (KDD 2019).
An implementation of "EdMot: An Edge Enhancement Approach for Motif-aware Community Detection" (KDD 2019)
A NetworkX implementation of Label Propagation from a "Near Linear Time Algorithm to Detect Community Structures in Large-Scale Networks" (Physical Review E 2008).
Community Finding with Applications on Phylogenetic Networks
Community Detection on a Twitter Dataset
VISLAB - Clustering algorithm in 연구실 서버
[Work in progress] A Rust implementation of the Louvain algorithm 🎈
Library of graph clustering algorithms
Implementation of the Louvain and Leiden community detection algorithms.
Add a description, image, and links to the louvain topic page so that developers can more easily learn about it.
To associate your repository with the louvain topic, visit your repo's landing page and select "manage topics."