Unlocking Hidden Communities: A Deep Dive into Graph Community Detection Algorithms

This article explains the fundamentals of community detection in graph computing, contrasting it with clustering, describing key concepts such as modularity, and reviewing classic algorithms like Louvain, node2vec‑based methods, and Infomap, while highlighting their applications across domains.

Infomapcommunity-detectiongraph algorithms

0 likes · 11 min read

Unlocking Hidden Communities: A Deep Dive into Graph Community Detection Algorithms

JD Tech

Sep 12, 2023 · Fundamentals

Community Detection Algorithms: Concepts, Types, and Classic Methods

This article introduces community detection as a fundamental graph algorithm, explains its basic concepts and types, compares it with clustering, discusses evaluation metrics like modularity, and reviews classic methods such as Louvain, node2vec‑based approaches, and the information‑theoretic Infomap algorithm.

InfomapUnsupervised Learningcommunity-detection

0 likes · 13 min read

Community Detection Algorithms: Concepts, Types, and Classic Methods

DataFunTalk

Apr 28, 2019 · Artificial Intelligence

Graph Algorithms for Fraud Detection and Community Detection: Modularity, Louvain, Infomap, node2vec and comE

This article explains how graph‑based algorithms such as centrality measures, modularity optimization, Louvain, Infomap, node2vec and the comE framework can be applied to financial fraud detection and community discovery, detailing their principles, formulas, implementation steps and evaluation metrics.

Infomapcommunity-detectionfraud detection

0 likes · 14 min read

Graph Algorithms for Fraud Detection and Community Detection: Modularity, Louvain, Infomap, node2vec and comE