Average motif degree. Conductance metric is known to have a bias toward giving better results for smaller numbers of clusters [1]}, [2]}. As an alternative, we consider the average motif degree in each subgraph, as given in def:amd.
In edge-based clustering literature, the densest subgraph of a graph is defined as the one with the largest average degree [3]}, [4]}. Here we adapt this measure for the motif-based subgraphs and simply consider the number of motifs per node. The higher values are better.

