Community detection
Community detection is a graph-analysis technique for identifying groups of nodes that are more densely or strongly connected to one another than to the rest of the graph.
Financial AI in Practice
The identification of groups of graph nodes that are more densely connected to one another than to the rest of the graph.
- How it is used
- Identifies connected groups for investigating coordinated fraud that transaction-by-transaction scoring may miss.
- How deep it goes
- Works through Louvain partitioning, community profiling, parallel summaries, and visualization, but does not develop the algorithm’s internals.
- Examples
- Uses e-commerce transactions, a 2,913-community result, ranked cluster metrics, and a largest-community visualization.
- What you can do after
- Apply it via NetworkX and python-louvain to label, profile, and visualize communities for fraud investigation.
Read how Financial AI in Practice explains community detection →
Graph Algorithms for Data Science
Community detection is a family of graph algorithms that identifies densely interconnected groups of nodes.
- How it is used
- Reveals densely connected or disconnected groups to characterize networks, segment users, and inform recommendation tasks.
- How deep it goes
- Defines communities through social-network examples and explains required graph-shape transformations, without detailing a particular algorithm's mechanics.
- Examples
- Uses social-platform followers and an eight-person friendship network with outlined communities.
- What you can do after
- Apply it via Neo4j Graph Data Science library to characterize networks and find tightly connected user groups.
Read how Graph Algorithms for Data Science explains community detection →
Knowledge Graphs and LLMs in Action
A community detection algorithm identifies groups of graph nodes that are more strongly or densely connected to one another than to nodes outside the groups.
- How it is used
- Finds latent groups for graph understanding, fraud detection, biological modules, and structural summarization.
- How deep it goes
- Explains topology, WCC, Louvain modularity, projections, statistics, and member inspection, but does not derive algorithm internals.
- Examples
- Uses researcher collaborations, genetic interaction networks, financial transactions, and a protein–protein interaction graph.
- What you can do after
- Apply it via Neo4j Graph Data Science to project graphs, write component or community identifiers, and inspect resulting groups.
Read how Knowledge Graphs and LLMs in Action explains community detection →
Essential GraphRAG
Community detection is the analysis of a graph to identify groups of entities with relatively dense internal connectivity.
- How it is used
- Supports GraphRAG indexing by producing community summaries for broad, thematic retrieval.
- How deep it goes
- Explains Louvain detection, persistence, summarization, variability, and single-level use, while deferring hierarchical treatment for larger graphs.
- Examples
- Uses an Odyssey character-and-location scenario, clustered-graph visualization, and persisted community summaries.
- What you can do after
- Builds community-aware GraphRAG retrieval by detecting clusters, summarizing them, and storing results for global search.
Related concepts
- Louvain algorithmincludes · The Louvain algorithm is a heuristic graph community-detection method that iteratively moves nodes and aggregates communities to optimize modularity.
- vectorizationused by · Vectorization is the representation of data or computations as vectors or arrays so they can be processed numerically or collectively.
- clusteringequivalent to · Clustering is the technique of grouping data items according to similarity or shared characteristics.
- graphuses · A graph is a mathematical structure consisting of vertices connected by edges that represent relationships or connections.
- unsupervised learninguses · Unsupervised learning is a machine-learning approach that discovers patterns, structure, or representations in data without labeled target outputs.
- knowledge graphuses · A knowledge graph is a graph-structured representation of entities and their semantically meaningful relationships, often including associated attributes or facts.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.