-
Notifications
You must be signed in to change notification settings - Fork 4
Commfind (CF by Donetti and Muñoz)
Sergiu Tripon edited this page Jul 27, 2016
·
4 revisions
Home ▸ Algorithms ▸ Commfind (CF by Donetti and Muñoz)
It combines the analysis of the Laplacian matrix eigenvectors used in classic graph partitioning with a cluster analysis step. Instead of using the best eigenvector to iteratively perform bisections of the network, it takes advantage of the best ones. Communities are obtained by a cluster analysis of the projected nodes in this dimensional space.
Home |
Scope |
Research |
Value |
Background
Literature Survey | Data | Algorithms | Plan | Meetings Journal
Literature Survey | Data | Algorithms | Plan | Meetings Journal
© Copyright 2016 Sergiu Tripon. All Rights Reserved.