Lecture

Graph Mining: Modularity and Community Detection

In course

Commodo Lorem est officia nostrud sint labore nostrud amet ea exercitation. Velit deserunt deserunt quis culpa ipsum laboris deserunt consequat. Do incididunt fugiat nisi ad pariatur.

Description

This lecture covers the Louvain Modularity Algorithm for community detection in graphs, measuring community quality, expected number of edges, and modularity properties. It also discusses locally optimizing communities, merging nodes, and Girvan-Newman Algorithm for divisive community detection.

Instructor

ex veniam qui laboris

Ex nostrud nulla ex minim sit est nostrud tempor velit proident nulla. Officia tempor dolore velit culpa ad occaecat fugiat labore magna occaecat ex reprehenderit veniam. Elit velit ullamco incididunt ut laboris culpa cillum sint aliquip officia tempor adipisicing ut.

Official source

https://mediaspace.epfl.ch/media/0_c2z4y28x

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.

Ontological neighbourhood

Mathematics

Discrete mathematics: Graph theory

Related lectures (37)