06_Clustering_Networks_based_on_Distance_Matrix
Clustering Networks based on Adjacency Matrix
This workflow clusters nodes of a given network by extracting node adjacency matrix first and use that to generate a distance matrix which is used to preform hierarchical clustering. The resulting clusters are added into the network as new node partitions. Once all cluster members are assigned to the corresponding cluster partition a partition graph is generated which shows the connections between partitions and the size of each partition.
Nodes
- Network Viewer2 ×
- Assign Partition1 ×
Column Filter1 ×- Distance Matrix Calculate1 ×
- Hierarchical Cluster Assigner1 ×
- Show all 12 nodes