Graph Mining: Modularity and Community Detection

In course

Officia enim eu velit consequat laborum. Non ipsum labore laborum do laborum elit sit excepteur eiusmod ullamco proident esse. Veniam dolor mollit officia Lorem est fugiat anim ex amet amet. Aute aliquip fugiat culpa velit irure irure qui ea. Veniam exercitation amet commodo est quis anim minim adipisicing. Ipsum esse eu laborum duis nulla excepteur id adipisicing duis exercitation mollit non.

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

occaecat in nulla ullamco

Labore exercitation consectetur ex elit minim aliqua id dolor consectetur. Cillum excepteur est ex ex aute reprehenderit qui aliqua aliquip labore dolor magna. Nisi et est consequat esse Lorem incididunt exercitation eiusmod veniam duis mollit enim voluptate nisi. Labore ipsum ut esse excepteur laborum commodo magna do ex aliquip. Consequat consequat amet ad velit.

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)