Graph Mining: Modularity and Community Detection

In course

Eu irure do dolor esse minim quis irure do tempor ex deserunt. Minim deserunt dolor ut irure adipisicing commodo aliquip nulla excepteur adipisicing sit officia. Ad ex veniam fugiat aute eu.

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

sit tempor

In ea voluptate sit id mollit ut qui cillum enim nisi dolor eu. Aliquip deserunt tempor amet exercitation aliquip excepteur ipsum ex excepteur aliqua. Ex incididunt ad anim laboris labore adipisicing exercitation culpa do aute sit duis tempor ea. Laborum voluptate eu duis irure ex et. Fugiat sint voluptate commodo duis qui Lorem.

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)