Lecture

Modularity: Community Detection Algorithms

Description

This lecture covers the Louvain Modularity Algorithm, which is based on optimizing community quality through modularity. It explains how to measure community quality, the expected number of edges, and the properties of modularity. The instructor demonstrates how to locally optimize communities and provides examples of processing nodes and merging communities. The lecture concludes with a discussion on the Louvain Modularity Algorithm's applications in social network analysis, highlighting its efficiency in extracting communities from large networks.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.