Network Analysis. Lecture 9. Graph partitioning algorithms

preview_player
Показать описание
Graph density. Graph pertitioning. Min cut, ratio cut, normalized and quotient cuts metrics. Spectral graph partitioning (normalized cut). Direct (spectral) modularity maximization. Multilevel recursive partitioning

Рекомендации по теме
Комментарии
Автор

In slide number 17, In which community we keep the node of eigenvector zero.

Infinityresearch
join shbcf.ru