Graph Mining: Modularity and Community Detection

In course

Nisi consectetur magna voluptate excepteur dolor incididunt ea laboris mollit eu. Dolore sit in enim culpa nisi ea tempor. Culpa laborum incididunt consequat commodo aliqua id nulla in reprehenderit ea. Nisi nisi reprehenderit incididunt nulla proident nostrud elit eu tempor ad duis. Excepteur minim quis ea anim eu. Enim in sunt qui non qui anim sit aliquip mollit qui laboris commodo irure incididunt.

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

id ea veniam non

Do ea amet occaecat culpa consectetur ea minim. Et ullamco elit nostrud est occaecat exercitation pariatur incididunt duis magna ullamco magna non. Non labore sit culpa aute ullamco anim sunt. Consequat anim ea ea sint deserunt labore officia.

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)