Icon

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.

This workflow clusters network nodes using adjacency matrix and creates a new partition graph with information about the connectivity and size/number of nodes of each cluster. row id still contains the node idcluster as partitionfilter default nodes partitionview clustered networkview originalnetwork Network Reader Node AdjacencyMatrix Hierarchical Clustering(DistMatrix) HierarchicalCluster View HierarchicalCluster Assigner Column Filter Assign Partition Partition Filter PartitionGraph Creator RowID Distance MatrixCalculate Network Viewer(local) Network Viewer(local) This workflow clusters network nodes using adjacency matrix and creates a new partition graph with information about the connectivity and size/number of nodes of each cluster. row id still contains the node idcluster as partitionfilter default nodes partitionview clustered networkview originalnetwork Network Reader Node AdjacencyMatrix Hierarchical Clustering(DistMatrix) HierarchicalCluster View HierarchicalCluster Assigner Column Filter Assign Partition Partition Filter PartitionGraph Creator RowID Distance MatrixCalculate Network Viewer(local) Network Viewer(local)

Nodes

Extensions

Links