Some overlapping community detection algorithms (Until 2016). by Yulin Che (https://github.com/CheYulin) for the PhD qualification exam (survey on community detection algorithms)

A NetworkX implementation of "Ego-splitting Framework: from Non-Overlapping to Overlapping Clusters" (KDD 2017).

TILES: an algorithm for community discovery in dynamic social networks

Python implementation of Newman's spectral methods to maximize modularity.

tgTrax: Telegram User Activity Tracker & Correlation Analyzer - Monitor online patterns, detect user relationships, and visualize temporal behavior

DEMON: a local-first discovery method for overlapping communities.

A python script for detecting communities in graphs using the clique percolation method.

Eva: Community Discovery for Labeled Graphs (networkx implementation)

Label propagation algorithm for community detection based on node importance and label influence

A Python implementation of improved Label Propagation Algorithm.

Repository to reproduce "Cascade-based Echo Chamber Detection" accepted at CIKM2022

APAL: Adjacency Propagation Algorithm for overlapping community detection

Code necessary to reproduce the experimentation presented in "A Multi-Objective Genetic Algorithm for Detecting Dynamic Communities using a Local Search driven Immigrant’s Scheme"

DAOC (Deterministic and Agglomerative Overlapping Clustering algorithm): Stable Clustering of Large Networks

CoEuS: Community Detection via Seed-set Expansion on Graph Streams

Super.Complex is a supervised machine learning algorithm for community detection in networks. It learns information from known communities and uses this information to find new communities on the network.

A summary of the work done for the June 2021 FOSSEE Research Internship in R.

Exhaustive search for the best Minimally Complex spin Model: "community detection" in binary data.

This Repository contains series of python programs for simulations of Schelling Model i.e. each node in a grid must satisfy threshold neighbourhood property.

ComSim : community detection algorithm using cycle and node's similarity

[TKDD'23] Demo code of the paper entitled "Towards a Better Trade-Off between Quality and Efficiency of Community Detection: An Inductive Embedding Method across Graphs", which has been accepted by ACM TKDD

A new community detection algorithm based on pagerank.

No description provided.

This repository provides classic clustering algorithms and various internal cluster quality validation metrics and also visualization capabilities to analyse the clustering results

Dissimilarity Measure for community detection

A FluidC analysis on large-scale and real-data complex networks.

Egosplitting for overlapping community detection

Greedy search for the best Minimally Complex spin Model: "community detection" in binary data.

This project implements the Girvan-Newman and Louvain algorithms from scratch for community detection in graphs, using datasets like Wiki-Vote and LastFM-Social. It includes automated stopping criteria, dendrogram visualization, and performance comparisons.

Assignments for the course Applied Data Analytics