Abstract
Clustering is one of the most universal approaches for understanding complex data. A pivotal aspect of clustering analysis is quantitatively comparing clusterings; clustering comparison is the basis for many tasks such as clustering evaluation, consensus clustering, and tracking the temporal evolution of clusters. In particular, the extrinsic evaluation of clustering methods requires comparing the uncovered clusterings to planted clusterings or known metadata. Yet, as we demonstrate, existing clustering comparison measures have critical biases which undermine their usefulness, and no measure accommodates both overlapping and hierarchical clusterings. Here we unify the comparison of disjoint, overlapping, and hierarchically structured clusterings by proposing a new elementcentric framework: elements are compared based on the relationships induced by the cluster structure, as opposed to the traditional clustercentric philosophy. We demonstrate that, in contrast to standard clustering similarity measures, our framework does not suffer from critical biases and naturally provides unique insights into how the clusterings differ. We illustrate the strengths of our framework by revealing new insights into the organization of clusters in two applications: the improved classification of schizophrenia based on the overlapping and hierarchical community structure of fMRI brain networks, and the disentanglement of various social homophily factors in Facebook social networks. The universality of clustering suggests farreaching impact of our framework throughout all areas of science.
Introduction
Clustering is one of the most basic and ubiquitous methods to analyze data^{1,2}. Traditionally, clustering is viewed as separating data elements into disjoint clusters of comparable sizes. Complications to this simplistic picture are becoming more prevalent, particularly following the rise of network science and nuanced clustering methods that reveal heterogeneous cluster size distributions^{3,4}, overlaps^{5,6,7,8}, and hierarchical structure^{9,10,11,12}. A growing consensus suggests that applying clustering is more about identifying appropriate techniques for the particular problem and properly interpreting the results, than developing a silverbullet clustering method^{13,14}.
The most fundamental step towards understanding, evaluating, and leveraging identified clusterings is to quantitatively compare them. Clustering comparison is the basis for clustering evaluation, consensus clustering, and tracking the temporal evolution of clusters, among many other tasks. The proliferation of nuanced clustering methods presents new challenges for clustering comparison^{3,15} and renders current methods susceptible to critical biases^{3,16,17,18,19,20}. In addition to the consistent grouping of elements into clusters, similarity measures must account for many other aspects of clusterings, such as the number of clusters, the size distribution of those clusters, multiple element memberships when clusters overlap, and scaling relations between levels of hierarchical clusterings.
Despite the increasing prevalence of irregular cluster features, the effect of such structure on clustering similarity has received little attention. Here we illustrate that the most popular clustering similarity measures are vulnerable to critical biases, calling the appropriateness of their general usage into question. We also argue that these biases are maintained or exacerbated by extensions to accommodate overlapping or hierarchical clusterings^{21,22,23,24}, suggesting that none of the existing frameworks for clustering similarity are adequate for comparing overlapping and hierarchically structured clusterings.
Here we propose a new elementcentric framework for clustering similarity that naturally incorporates overlaps and hierarchy. In our approach, elements are compared based on the relationships induced by the cluster structure, in contrast to the traditional clustercentric philosophy. As we will see, this change in perspective resolves many of the aforementioned difficulties and avoids the common biases induced by irregular cluster structure.
Bias in Clustering Comparisons
Every clustering similarity measure must tradeoff between variation in three primary characteristics of clusterings: the grouping of elements into clusters, the number of clusters, and the size distribution of those clusters^{17,20,25,26,27,28}. A failure to account for all three characteristics can result in a biased comparison in which clusterings with exaggerated features are favored over more intuitively similar clusterings. Before exploring these tradeoffs further, we offer an illustrative example by the comparisons between clustering pairs shown in Fig. 1. Here we focus on three exemplary similarity measures—the normalized mutual information (NMI), FowlkesMallows index (FM), and our elementcentric similarity measure—and extend our discussion to a larger selection later. In the first set of comparisons (Fig. 1a), we demonstrate a bias towards clusterings with heterogeneous cluster sizes: NMI and the elementcentric similarity determine the middle clustering is more similar to the left clustering than the right clustering, yet FM concludes the opposite—the middle clustering is more similar to the right clustering than the left—as it is biased by the large cluster in the right clustering. In the second set of comparisons (Fig. 1b), we illustrate a bias towards clusterings with more clusters: FM and the elementcentric similarity determine the middle clustering is more similar to the left clustering than the right clustering, yet NMI concludes the opposite—the middle clustering is more similar to the right clustering than the left clustering—as it is biased by the number of clusters in the right clustering.
One approach to correct biases in clustering comparison is to consider clustering similarity in the context of a random ensemble of clusterings^{18,26,29,30,31,32}. Such a correction for chance uses the expected similarity of all pairwise comparisons between clusterings specified by a random model to establish a baseline similarity value. However, the correction for chance approach has severe drawbacks^{20}: (i) it is strongly dependent on the choice of random model assumed for the clusterings, which is often highly ambiguous, and (ii) no random model for overlapping or hierarchical clusterings has been suggested.
We introduce a simple set of synthetic clustering examples that illustrate the tradeoffs between characteristics of clusterings. In each case, we outline the desired behavior for a measure of clustering similarity based on the extensive discussion in the literature^{16,17,20,21,25,27,28,29,30,33,34,35}. Our intuition is based on the use of clustering similarity in practice: similar clusterings should have a similar number of clusters, of similar sizes, and elements should have similar memberships. Consider a typical case facing a practitioner of data science: we have three clustering methods M1, M2, and M3 such that M1 produces the clustering on the left of Fig. 1a,b, M2 produces the clustering on the top right of Fig. 1a, and M3 produces the clustering on the bottom right of Fig. 1b. Which method, M1, M2, or M3 performed best in recovering the groundtruth clustering in the middle of Fig. 1a,b? The answer depends on the clustering similarity measure used. Yet, to our best understanding, clustering M1 is the only clustering that reflects the number, sizes, and memberships of the groundtruth clustering. While other intuitions are possible (i.e. that offered by information theory or the correction for chance as discussed further in the SI, Section S2.11), we argue that the intuition adapted here most accurately captures the use of clustering comparisons in the literature^{36}.
Since it is difficult to isolate changing cluster sizes or number of clusters from the grouping of elements into clusters, our examples consider the case of randomized element memberships; however, in practice, quantitative comparisons would make simultaneous tradeoffs between all three aspects of clusterings. Here we expand our focus to seven exemplary similarity measures representing many of the most common measures from the literature—the Jaccard index, Adjusted Rand index (ARI)^{29}, F measure, FowlkesMallows index (FM)^{21}, percentage matching (PM), the normalized mutual information (NMI), overlapping normalized mutual information (ONMI)^{23}, and our elementcentric similarity measure. We discuss another popular measure, the variation of information, in the SI, Section S2.10, due to its interpretation as a distance measure. These four examples suggest that the most common clustering similarity measures are subject to critical biases which render them inappropriate for comparing generalized clusterings—only our elementcentric similarity measure displays the intuitive behavior in all examples and does not suffer from the problem of matching (Fig. 2d).
Bias in Randomized Membership
In the first example, the consistent grouping of elements is tested by comparing a clustering of 1,024 elements into 32 equally sized clusters against itself after a fraction of element memberships have been shuffled between clusters (Fig. 2a). Intuition suggests that as the randomization increases, the similarity between the original clustering and the shuffled clustering should decrease from the maximum value (1.0 in all cases) to some nonzero value, reflecting the fact that the number and sizes of clusters are still identical. However, two measures reach zero, ignoring the similarity of the cluster size sequences. The ONMI is particularly conservative, reporting no similarity at just over 50% randomization; ONMI’s surprising behavior highlights the difficulty of accommodating overlaps in a traditional similarity framework.
Bias in Skewed Cluster Sizes
The second example explores the bias favoring skewed cluster size sequences through a preferential attachment shuffling scheme (Fig. 2b). Starting from the same initial clustering of 1,024 elements into 32 equally sized clusters, we randomize all element memberships. The algorithm then proceeds to uniformly select a random element and reassign it to a new cluster based on the current sizes of those clusters. This procedure is run for a total of 5 × 10^{6} steps, with a comparison to the original clustering performed every 500 steps. We argue that the desired clustering comparison behavior should reflect the cluster size differences, and that a decrease in the entropy of the cluster size sequence (reflecting an increase in cluster size heterogeneity) is reflected by the two clusterings becoming less similar. However, we now see three distinct types of behaviors exhibited by the clustering similarity measures. The NMI and our elementcentric similarity measure exhibit the intuitive behavior and decrease as the clustering entropy decreases. The ONMI and ARI maintain a zero similarity for all comparisons regardless of the clustering entropy. Finally, the F measure and Jaccard index increase as the entropy decreases: They cannot account for the differences in the cluster size distribution. This increase is a consequence of their formulation in terms of the correctly coassigned element pairs while disregarding the incorrectly coassigned element pairs.
Bias in The Number of Clusters
Third, we investigate a scenario where the number and sizes of clusters in two clusterings diverge (Fig. 2c). Here we compare an initial clustering of 1,024 elements into 8 equally sized clusters against a second clustering generated by randomly assigning the elements to c regularly sized clusters, where c is the control parameter for the scenario. Hence, one clustering remains the same size, while the other has c regularly sized clusters. We see two distinctly different behaviors of the clustering similarity measures: the Jaccard index, F measure, ONMI, ARI and our elementcentric similarity measure all follow our intuition and decrease with increasing c, while NMI increases with increasing c. The increasing behavior for NMI can be attributed to the aforementioned informationtheoretic bias towards comparisons with more clusters^{16,19,20,34,37}, and counters the large body of established literature controlling for the number of clusters in a clustering solution^{38,39}. This bias makes NMI a particularly troubling measure for hierarchical clusterings where we expect the number of clusters to vary over several orders of magnitude.
The Problem of Matching
Finally, we recount one of the oldest biases discussed in the literature, the problem of matching^{15,40,41}. The problem of matching is a symptom of all setmatching methods which identify a “best match” for each cluster. As a result, the measures completely ignore what happens to elements in the “unmatched” part of each cluster. For example, suppose \({\mathscr{A}}\) is a clustering with K equalsized clusters over N elements, with \(N\gg K\), and clustering \( {\mathcal B} \) is obtained from \({\mathscr{A}}\) by moving a small fraction of the elements in each cluster \({{\mathscr{A}}}_{k}\) to the cluster \({{\mathscr{A}}}_{k+1{\rm{mod}}k}\). Likewise, the clustering \({\mathscr{C}}\) is obtained from \({\mathscr{A}}\) by reassigning the same fraction of the elements in each \({{\mathscr{A}}}_{k}\) evenly between the other clusters. In this case, measures suffering from the problem of matching would say the similarity between \({\mathscr{A}}\) and \( {\mathcal B} \) is equal to the similarity between \({\mathscr{A}}\) and \({\mathscr{C}}\), contradicting the intuition that \({\mathscr{A}}\) is more similar to \( {\mathcal B} \) than \({\mathscr{C}}\). For the measures considered here, only the percentage matching similarity measure suffers from the problem of matching. Despite this issue, it is important to note that the percentage matching has been used both in practice and in theory, typically when the clusterings are assumed to be relatively similar.
Consequence for Extensions to Overlapping and Hierarchical Structure
The three examples discussed in this section illustrate biases in the case of disjoint clusterings without hierarchy. Despite the increasing prevalence of overlapping and hierarchical structured clusterings, there is a lack of intuition for the tradeoffs encountered by clustering similarity measures in the presence of such structure. However, exploring the behavior of similarity measures when comparing partitions reveals useful insights into how these measures behave when comparing other clustering structures. The presence of overlaps can exaggerate the heterogeneity in cluster sizes^{8}, especially if one considers each overlap region as a separate cluster (i.e. as considered by the Omega index). Since hierarchical clusterings reflect cluster structure over many scales, the sizes of these clusters typically vary by orders of magnitude; for example, the benchmark models typically used to capture hierarchical structure in networks are full kary trees, and thus the number of clusters grows exponentially in the number of levels^{9,23}.
All but one of the similarity measures for overlapping or hierarchical clusterings simplifies to one of the cases we have studied: the Omega index is equivalent to the adjusted Rand index for partitions^{22}, hierarchical mutual information reduces to NMI on partitions^{24}, and the FowlkesMallows analysis of dendrograms considers each cut of the dendrogram independently, thus producing a curve of comparisons between partitions^{21}. The overlapping normalized mutual information (ONMI) is the only measure which does not reduce to another measure on partitions^{23}, yet we have demonstrated that it has particularly unintuitive behavior in our examples. In sum, all existing measures for overlapping or hierarchical clusterings either inherit critical biases from their simpler counterparts on flatpartitions, or are inadequate for handling overlapping and hierarchical clusterings.
ElementCentric Clustering Comparisons
Our elementcentric clustering similarity approach captures clusterinduced relationships between the elements through the cluster affiliation graph, a bipartite graph where one vertex set corresponds to the original elements and the other corresponds to the clusters. Specifically, a cluster affiliation graph is constructed for a clustering \({\mathscr{C}}\) of labeled elements \(V=\{{v}_{1},\ldots ,{v}_{N}\}\) as a bipartite graph \( {\mathcal B} (V\cup C, {\mathcal R} )\) where one vertex set corresponds to the original elements V and the other vertex set corresponds to the cluster set C. An undirected edge \({a}_{i\beta }\in {\mathcal R} \subset V\times C\) is placed between element \({v}_{i}\in V\) and cluster \({c}_{\beta }\in C\) if \({v}_{i}\in {c}_{\beta }\), i.e. the element is a member of the cluster. Notice that an element’s membership in multiple overlapping clusters can be directly incorporated with multiple edges in the cluster affiliation graph. For hierarchically structured clusterings, each cluster \({c}_{\beta }\in C\) is assigned a hierarchical level \({l}_{\beta }\in [0,1]\) by rescaling the hierarchy’s acyclic graph (dendrogram) according to the maximum path length from the roots^{42}. The weight of the cluster affiliation edge is given by the hierarchy weighting function h(l_{β}):
where r is a scaling parameter that determines the relative importance of membership at different levels of the hierarchy (further discussed below).
The cluster affiliation graph is then projected onto the element vertices to produce the clusterinduced element graph, which is a weighted, directed graph that summarizes the interelement relationships induced by common cluster memberships^{43} (see Fig. 3c). In the clusterinduced element graph, with weighted adjacency matrix W, each edge w_{ij} between elements v_{i} and v_{j} has weight:
where a_{iγ} are the entries of the N × K bipartite adjacency matrix \({\mathbb{A}}\) for the cluster affiliation graph.
The traditional notion of pairwise cooccurrence in a cluster is now captured by the (binary) presence of an edge in the clusterinduced element graph. However, the focus on element pairs misses highorder relations (triplets, quadruplets, etc.), which are useful for characterizing cluster structure^{29}. Such highorder cooccurrences can be captured through the presence of paths in the clusterinduced element graph. The weight of the path accounts for the relative importance of elements in the presence of overlapping and hierarchical cluster structures. Here, we incorporate every possible path between elements obtaining the equilibrium distribution for a personalized diffusion process on the graph (often called “personalized pagerank” or “random walk with restart”)^{44,45,46}. Given a clusterinduced element graph with weighted adjacency matrix W, the personalized PageRank (PPR) affinity from element v_{i} to all elements v_{j} is found as the stationary distribution of a diffusion process with restart probability 1.0 − α to v_{i} which takes the form:
where v_{i} is an Nvector with 1 in the ith entry, and 0 otherwise. The value of α controls the influence of overlapping clusters and hierarchical clusters with shared lineages; here we use α = 0.90.
In general, for large data sets and clusterings with many overlapping and hierarchical clusters, the calculation of personalized pagerank can be a computationally expensive process. However, there are some computational simplifications that can be made. First, the personalized PageRank affinity of partitions (disjoint clusterings) can be analytically solved—the affinity value for each coclustered element pair is a linear function of the inverse cluster size, 1/c_{β}, and 0 otherwise:
where δ is the Kronecker delta function, element v_{i} is in cluster c_{γ}, and element v_{j} is in cluster c_{β}. Second, when several elements share exactly the same cluster memberships, their resulting personalized pagerank affinity vectors are related by simple permutations; therefore, the personalized pagerank affinity vector need only be calculated once for each common cluster membership set. Third, due to the utility of personalized pagerank for recommendation systems, there have been many algorithms for the approximation of personalized pagerank^{47,48}. The worstcase computational complexity of elementcentric similarity will only occur for highly overlapping and deeply hierarchical clusterings, which were previously incomparable using traditional clustering similarity methods.
The elementwise similarity of an element v_{i} in two clusterings \({\mathscr{A}}\) and \( {\mathcal B} \) is found by comparing the stationary probability distributions \({{\boldsymbol{p}}}_{i}^{{\mathscr{A}}}\) and \({{\boldsymbol{p}}}_{i}^{ {\mathcal B} }\) induced by the PPR processes on the two clusterinduced element graphs. Here, we use the normalized L1 metric for probability distributions corrected to account for the PPR process:
The L1 metric was chosen because it is invariant to the magnitude of the probability values, i.e. it treats all cluster sizes equally. Other popular probability metrics (Hellinger, Euclidean, etc.) extenuate the differences in small or large probability values, thereby disproportionately favoring clusters based on their sizes. The final elementcentric similarity score \(S({\mathscr{A}}, {\mathcal B} )\) of two clusterings \({\mathscr{A}}\), \( {\mathcal B} \) is the average of the elementwise similarities:
A full implementation of the elementcentric clustering similarity, and all other clustering similarity measures discussed here, is provided in the CluSim python package^{49}. As illustrated in Fig. 3, our elementcentric framework unifies disjoint, overlapping, and hierarchical clustering comparison in a single framework.
Interpretations of ElementCentric Similarity
Cluster affiliation graph and clusterinduced element graph
The cluster affiliation graph provides a convenient representation of element membership in multiple clusters at different scales of the hierarchy. Unweighted variants of the affiliation graph are common approaches to study the relationship between labels and data in network science^{43,50}. Our weighted extension reflects the varying importance of membership at different scales of the hierarchy.
The elementcentric philosophy suggests a focus on common memberships between data elements induced by the cluster structure, rather than overlaps between clusters induced by elements (as suggested by the clustercentric philosophy). The clusterinduced element graph captures these relationships by integrating over all shared cluster memberships through the projection of the cluster affiliation graph onto the element nodes. This projection has three important features. First, the induced relationship between two elements is normalized by the size of the cluster capturing the fact that cooccurrence in larger clusters implies less direct influence between elements than cooccurrence in smaller clusters. Second, the weight for each element is normalized by the sum over all of its cluster memberships reflecting the idea that membership in many clusters reduces the relative influence from any one of the clusters. Third, in the presence of overlap or hierarchy, the weights in the clusterinduced element graph can be asymmetric (i.e. \({w}_{ij}\ne {w}_{ji}\)) arising from the fact that multiple cluster affiliations will change the respective local neighborhoods of individual elements. Note that our normalization for the edgeweights in the clusterinduced element graph is equivalent to the landing probability of a twostep random walk on the cluster affiliation graph from element v_{i} to element v_{i}.
Elementwise scores
Beyond naturally accommodating generalized clusterings, our elementcentric similarity can provide detailed insights into how two clusterings differ because the similarity is calculated at the level of individual elements. Specifically, the individual elementwise scores \({S}_{i}({\mathscr{A}}, {\mathcal B} )\) directly measure how similar the clusterings appear from the perspective of each element. The distribution of elementwise similarity scores can also provide insight into how the clusterings differ. For example, the rankeddistribution of elementwise scores reflects the differences in cluster structure: a flat distribution occurs when all elements have the same similarity score, suggesting that the clusterings differ equally across all elements; a skewed distribution occurs when some elements have much higher or lower similarity than the rest, suggesting that the clusterings are distinguished by a subset of elements.
Average agreement and frustration
Our elementcentric similarity measure also reveals the consistency of element groupings within an arbitrary set of clusterings. The average agreement between a reference clustering and a set of clusterings measures the regular grouping of elements with respect to a reference clustering. Specifically, given a clustering \({\mathscr{G}}\) and a set of clusterings \({\boldsymbol{R}}=\{{ {\mathcal R} }_{1},\ldots ,{ {\mathcal R} }_{T}\}\), the elementwise average agreement for element v_{i} is evaluated as:
The frustration within a set of clusterings reflects the consistency with which elements are grouped by the clusterings. For the set of clusterings \({\boldsymbol{R}}=\{{ {\mathcal R} }_{1},\ldots ,{ {\mathcal R} }_{T}\}\), the elementwise frustration for element v_{i} is given by:
Interpretation of overlap
The elementcentric framework naturally incorporates the multiple memberships that occur in overlapping clusterings. First, as discussed above, element membership in multiple clusters is directly captured by multiple edges in the cluster affiliation graph, and is propagated into asymmetric weights in the clusterinduced element graph. Second, the integration over local paths through the personalized PageRank process means that the presence of multiple memberships for elements is not isolated to the overlapping elements, but propagates throughout the clusters which overlap. This is because shared elements introduce additional information into the system, namely that the clusters share common features. Essentially, in the absence of any other information, if two clusters overlap (share some elements), then their elements should be more similar compared with the case where the clusters are disjoint.
For example, let us simplify our discussion to talk about counting element triplets in the overlapping clustering from Fig. 3a. When no overlaps are present, it is simple to declare whether all three elements cooccur within the same cluster or not; so elements 1, 2, 3 all cooccur in the pink cluster, but elements 1, 2, 4 do not. However, in the presence of overlap, additional decisions must be made. Consider elements 4,6,7. Elements 4 and 6 cooccur in the same yellow cluster, and elements 6 and 7 cooccur in the same green cluster, but how should one determine if the elements 4 and 7 cooccur? Clearly, this triplet has important information. Indeed, it specifically defines what the “overlap” means for this clustering. Thus, the elementcentric similarity measure does not disregard this triplet, but retains it with a reduced weight determined by the α parameter. Namely, the triplet 4,6,7 cooccurs less strongly than the triplet without overlap 1, 2, 3.
In contrast, the omega index counts element cooccurrences very conservatively and states that elements 4 and 7 do not cooccur. It continues to make the distinction that 4 and 6 didn’t cooccur either because 4 doesn’t have the exact same memberships as 6. Thus it throws away valuable information about the cluster structure.
Interpretation of hierarchy
Our elementcentric framework is flexible and allows natural choices to accommodate alternative interpretations of hierarchy. For example, our choice of hierarchical weighting function and the scaling parameter, r, reflects a continuum in the hierarchy (Fig. 3g): lower r emphasizes higher levels and reflects a divisive hierarchy, in which lower levels of the dendrogram are treated as refinements of the higher levels, while larger r puts emphasis on lower levels and reflects an agglomerative hierarchy, in which higher levels of the dendrogram are seen as a coarsening of the lower level cluster structure. Other interpretations of hierarchy can be implemented by changing the specific hierarchical weighting function; for example, constant function (\(r=0\) above) collapses the hierarchy into an overlapping clustering with each cluster weighted equally.
Relation to other similarity measures
Our choice of L1 comparisons between personalized pagerank distributions was based on a principled extension of element cooccurrence. This choice can be replaced by another measure of graph similarity or probability metric with an alternative intuition of the tradeoffs associated with clustering similarity^{51}. Indeed, several common clustering similarity measures can be recovered by adapting other choices of graph similarity; all paircounting measures can be recovered from graph set operations between clusterinduced element graphs from disjoint clusterings. The Rand index, in particular, is recovered by applying the graphedit distance between the two clusterinduced element graphs from disjoint clusterings.
Applications
Elementcentric comparisons reveal insights into how Kmeans clusterings differ
Beyond serving as a global measure of clustering similarity, our elementcentric similarity also provides detailed insights into how clusterings differ, in contrast to other measures. Consider an illustrative example from Kmeans clustering shown in Fig. 4a and detailed in the SI, Section S3.1; 19 clusters were randomly placed in a square with a randomly selected arrangement (Gaussian blob, anisotropic blob, circle, or spiral) and size. Kmeans has difficulty when the predefined clusters overlap or are circularly arranged^{52}. This difficulty can be explicitly quantified by calculating the average elementwise similarity between the predefined clustering and 100 uncovered clusterings (Fig. 4b). The elementwise frustration, found by averaging over all pairwise comparisons between the 100 uncovered clusterings, reveals data points that are consistently grouped into similar clusters or are assigned to drastically different clusters (Fig. 4c). The combination of similarity and frustration identifies specific elements which are consistently grouped into an incorrect cluster (Fig. 4b,c: high error, low frustration), or those elements which Kmeans cannot consistently decide on a grouping (Fig. 4b,c: low error, high frustration).
We also present a realworld example of handwriting recognition^{53} (Fig. 4d and SI, Section S3.2). The same procedure reveals that some clusters of digits are correctly and consistently identified (“0”), while the error mostly results from incorrect grouping of other digit clusters (“9”, “8”, and “1”; Fig. 4e). Elementwise frustration shows that there are some digits that cannot be consistently classified (“3” and “8”, Fig. 4f), while some errors are regularly made (“1” and “9”). The extreme examples of these two types of error are shown in Fig. 4g.
The convolution of metadata in social networks
We now use our framework to explore the community structure of Facebook college friendship networks. Previous research has suggested that friendship networks at major universities are organized into clusters which reflect the graduation year, dormitory, or student major^{54,55}. However, the details of the organizing principles underlying this similarity are unknown. Here we demonstrate and visualize how multiple attributes interact and contribute to community structure.
The Facebook friendship networks analyzed here were originally released as part of the Facebook 100 data set^{54,55}. This dataset contains a snapshot of all friendships at each of 100 schools in the fall of 2005. Additionally, the data includes several categorical variables shared by the users on their individual pages: gender, class year, high school, major, and dormitory residence. Here, we analyze the networks in two schools: the Oberlin (College A) and Rochester networks (College B). For each school we took the largest connected component and uncovered clusterings using the Louvain method^{56}. The categorical data for year, dorm and major were used to create three nonoverlapping clusterings. Every student with missing categorical data was placed into an individual singleton cluster.
Elementcentric similarity reveals that school year closely captures the modular structure for most of the network, confirming previous results^{54,55}. However, our elementcentric similarity further illustrates that this similarity is particularly high for the students in their 1st or 2nd years, and fails to capture the clustering structure of other students (Fig. 4h,i black arrows). In these cases, the students’ major gradually takes over the cohortbased connections (Fig. 4h,i red arrows). This result, which has only become straightforward through our framework, supports the intuition that network structure results from the convolution of multiple attributes^{14}.
Elementcentric comparisons of overlapping and hierarchical clustering in brain networks
Finally, to further illustrate the utility of our elementcentric similarity measure, we demonstrate its ability to capture meaningful differences in overlapping and hierarchical clustering structure by classifying schizophrenic individuals based on the community structure of restingstate fMRI brain networks. There are several known distinctive and interpretable properties of restingstate fMRI brain networks in schizophrenia^{57,58,59,60,61}. Network communities, in particular, are hypothesized to capture functionally integrated modules in the brain that reflect key properties of schizophrenia^{57}. Our goal for this example is not to introduce a superior classification of schizophrenic subjects, rather, upon controlling the clustering method and data set, we demonstrate that our measure can extract more useful information than the other stateoftheart clustering comparison methods for overlapping clusterings (ONMI, Omega index). We extract communities with overlapping and hierarchical structure using OSLOM community detection^{62} from the functional brain networks of 48 subjects (29 healthy controls and 19 individuals diagnosed with schizophrenia) analyzed in a previous study^{58} (see SI, Section S3.3 for details). The similarity between each pair of the subjects’ hierarchical and overlapping clusterings was found using our elementcentric similarity measure, producing a 48 × 48 similarity matrix (Fig. 5a).
The subjectsubject similarity matrix was then used in conjunction with a weighted knearest neighbors classifier to perform a binary classification of subjects as either schizophrenic or healthy controls. Evaluated by a nested 10fold crossvalidation procedure, our approach achieves an average accuracy of 84%, outperforming other measures (ONMI, the Omega index, Fig. 5b). Note that, classification based on individual levels from the hierarchy does not perform as well as the method using the full hierarchy. Even when limited only to the overlapping clustering at the bottom of the OSLOM hierarchy, our elementcentric clustering similarity outperforms both ONMI and the Omega Index.
Our elementcentric clustering similarity measure also provides insights into which brain regions are consistently clustered within groups. To find such group differences, we consider the elementcentric similarity between all healthy controls, and the elementcentric similarity between all schizophrenic patients. As seen in Fig. 5c, the difference between the means of these two groups highlights several regions which are consistently clustered into similar functional modules in the healthy controls or schizophrenic patients. In particular, regions of interest (ROIs) located in the Fusiform gyrus (Brodmann Area 37) were consistently clustered in the healthy controls but displayed great variability in cluster structure for the schizophrenic patients. This result is corroborated by the fact that the Fusiform gyrus has previously been associated with abnormal activation in schizophrenia during semantic tasks^{63,64}.
Summary and Discussion
In summary, we present an elementcentric framework that intuitively unifies the comparison of disjoint, overlapping, and hierarchically structured clusterings. We argue that our elementcentric similarity does not suffer from the common counterintuitive biases of existing measures, and that it also provides insights into how clusterings differ at the level of individual elements.
Our framework suggests straightforward extensions to more complex scenarios, such as soft or fuzzy clusterings, hierarchical clusterings specified by dendrograms with merge distance information, and hypergraph similarity. The framework also provides a measure of pairwise similarity between elements, akin to the nodal association matrix of Bassett et al.^{65}, and an elementwise clustering similarity which summarizes the difference in relationships induced by overlapping and hierarchically structured clusterings from the perspective of individual elements. Both of these objects hold promise for use in clustering ensemble methods^{66,67}.
As clustering methods advance to uncover more nuanced and accurate organizational structure of complex systems, so too should clustering similarity measures facilitate meaningful comparisons of these organizations. The elementcentric framework proposed here provides an intuitive quantification of clustering similarity that holds great promise for uncovering the relationships amongst all types of clusters, such as network communities, ontogenies, and dendrograms. The ubiquity of clustering in all areas of science suggests extensive potential impact of our framework.
Data Availability
All data used in this work is available upon request. A full implementation of the elementcentric similarity measure is available in the opensource python package: CluSim^{49}.
References
 1.
Jain, A. K., Murty, M. N. & Flynn, P. J. Data clustering: a review. ACM Computing Surveys (CSUR) 31, 264–323 (1999).
 2.
Fortunato, S. Community detection in graphs. Physics Reports 486, 75–174 (2010).
 3.
He, H. & Garcia, E. A. Learning from imbalanced data. IEEE Transactions on Knowledge and Data Engineering 21, 1263–1284 (2009).
 4.
Leskovec, J., Lang, K. J., Dasgupta, A. & Mahoney, M. W. Community structure in large networks: Natural cluster sizes and the absence of large welldefined clusters. Internet Mathematics 6, 29–123 (2009).
 5.
Palla, G., Derenyi, I., Farkas, I. & Vicsek, T. Uncovering the overlapping community structure of complex networks in nature and society. Nature 435, 814–818 (2005).
 6.
Ahn, Y.Y., Bagrow, J. P. & Lehmann, S. Link communities reveal multiscale complexity in networks. Nature 466, 761–764 (2010).
 7.
Gopalan, P. K. & Blei, D. M. Efficient discovery of overlapping communities in massive networks. PNAS 110, 14534–14539 (2013).
 8.
Yang, J. & Leskovec, J. Structure and overlaps of groundtruth communities in networks. ACM Transactions on Intelligent Systems and Technology (TIST) 5, 26 (2014).
 9.
Ravasz, E., Somera, A. L., Mongru, D. A., Oltvai, Z. N. & Barabási, A.L. Hierarchical organization of modularity in metabolic networks. Science 297, 1551–1555 (2002).
 10.
SalesPardo, M., Guimera, R., Moreira, A. A. & Amaral, L. A. N. Extracting the hierarchical organization of complex systems. PNAS 104, 15224–15229 (2007).
 11.
Delvenne, J.C. C., Yaliraki, S. N. & Barahona, M. Stability of graph communities across time scales. PNAS 107, 12755–12760 (2010).
 12.
Zhang, P. & Moore, C. Scalable detection of statistically significant communities and hierarchies, using message passing for modularity. PNAS 111, 18144–18149 (2014).
 13.
Kleinberg, J. An Impossibility Theorem for Clustering, 463–470, NIPS’02 (MIT Press, 2002).
 14.
Peel, L., Larremore, D. B. & Clauset, A. The ground truth about metadata and community detection in networks. Science Advances 3, e1602548 (2017).
 15.
Meila, M. Comparing clusterings—an information based distance. Journal of Multivariate Analysis 98, 873–895 (2007).
 16.
White, A. P. & Liu, W. Z. Technical note: Bias in informationbased measures in decision tree induction. Machine Learning 15, 321–329 (1994).
 17.
Pfitzner, D., Leibbrandt, R. & Powers, D. Characterization and evaluation of similarity measures for pairs of clusterings. Knowledge and Information Systems 19, 361–394 (2009).
 18.
Vinh, N. X., Epps, J. & Bailey, J. Information Theoretic Measures for Clusterings Comparison: Variants, Properties, Normalization and Correction for Chance. Journal of Machine Learning Research 11, 2837–2854 (2010).
 19.
Zhang, P. Evaluating accuracy of community detection using the relative normalized mutual information. Journal of Statistical Mechanics: Theory and Experiment 2015, P11006 (2015).
 20.
Gates, A. J. & Ahn, Y.Y. The impact of random models on clustering similarity. Journal of Machine Learning Research 18, 1–28 (2017).
 21.
Fowlkes, E. B. & Mallows, C. L. A method for comparing two hierarchical clusterings. Journal of the American Statistical Association 78, 553–569 (1983).
 22.
Collins, L. M. & Dent, C. W. Omega: A general formulation of the rand index of cluster recovery suitable for nondisjoint solutions. Multivariate Behavioral Research 23, 231–242 (1988).
 23.
Lancichinetti, A., Fortunato, S. & Kertész, J. Detecting the overlapping and hierarchical community structure in complex networks. New Journal of Physics 11, 033015 (2009).
 24.
Perotti, J. I., Tessone, C. J. & Caldarelli, G. Hierarchical mutual information for the comparison of hierarchical community structures in complex networks. Physical Review E 92, 062825 (2015).
 25.
Meila, M. Comparing clusterings: an axiomatic view. In Proceedings of the 22nd International Conference on Machine Learning, 577–584 (ACM, New York, NY, USA, 2005).
 26.
Albatineh, A. N., NiewiadomskaBugaj, M. & Mihalko, D. On similarity indices and correction for chance agreement. Journal of Classification 23, 301–313 (2006).
 27.
Amigó, E., Gonzalo, J., Artiles, J. & Verdejo, F. A comparison of extrinsic clustering evaluation metrics based on formal constraints. Information Retrieval 12, 461–486 (2009).
 28.
Souto, M. C. P. D. et al. A comparison of external clustering evaluation indices in the context of imbalanced data sets. Brazilian Symposium on Neural Networks 49–54 (2012).
 29.
Hubert, L. & Arabie, P. Comparing partitions. Journal of Classification 2, 193–218 (1985).
 30.
Vinh, N. X., Epps, J. & Bailey, J. Information theoretic measures for clusterings comparison: is a correction for chance necessary? In Proceedings of the 26th Annual International Conference on Machine Learning, 1073–1080 (ACM, 2009).
 31.
Albatineh, A. N. & NiewiadomskaBugaj, M. Correcting jaccard and other similarity indices for chance agreement in cluster analysis. Advances in Data Analysis and Classification 5, 179–200 (2011).
 32.
Romano, S., Bailey, J., Nguyen, V. & Verspoor, K. Standardized mutual information for clustering comparisons: one step further in adjustment for chance. In Proceedings of the 31st International Conference on Machine Learning (ICML14), 1143–1151 (2014).
 33.
Rosenberg, A. & Hirschberg, J. VMeasure: A Conditional EntropyBased External Cluster Evaluation Measure. In EMNLPCoNLL, vol. 7, 410–420 (2007).
 34.
Amelio, A. & Pizzuti, C. Is normalized mutual information a fair measure for comparing community detection methods? In Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2015, 1584–1585 (ACM, 2015).
 35.
van der Hoef, H. & Warrens, M. J. Understanding information theoretic measures for comparing clusterings. Behaviormetrika 1–18 (2018).
 36.
Lancichinetti, A., Fortunato, S. & Radicchi, F. Benchmark graphs for testing community detection algorithms. Physical Review E 78 (2008).
 37.
Amelio, A. & Pizzuti, C. Correction for closeness: Adjusting normalized mutual information measure for clustering comparison. Computational Intelligence 33, 579–601 (2016).
 38.
Tibshirani, R., Walther, G. & Hastie, T. Estimating the number of clusters in a data set via the gap statistic. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 63, 411–423 (2001).
 39.
Newman, M. & Reinert, G. Estimating the Number of Communities in a Network. Physical Review Letters 117, 078301 (2016).
 40.
Meila, M. Comparing clusterings by the variation of information. In Learning Theory and Kernel Machines, 173–187 (Springer, 2003).
 41.
Rezaei, M. & Franti, P. Set matching measures for external cluster validity. IEEE Trans Knowl Data Eng 28, 2173–2186 (2016).
 42.
Czégel, D. & Palla, G. Random walk hierarchy measure: what is more hierarchical, a chain, a tree or a star. Scientific Reports 5, 17994 (2015).
 43.
Zhou, T., Ren, J., Medo, M. & Zhang, Y.C. Bipartite network projection and personal recommendation. Physical Review E 76, 046115 (2007).
 44.
Haveliwala, T. H. Topicsensitive pagerank: A contextsensitive ranking algorithm for web search. IEEE Transactions on Knowledge and Data Engineering 15, 784–796 (2003).
 45.
Tong, H., Faloutsos, C. & Pan, J. Y. Fast random walk with restart and its applications. In ICDM’06. Sixth International Conference on Data Mining, 613–622 (IEEE Computer Society, 2006).
 46.
Kloumann, I. M., Ugander, J. & Kleinberg, J. Block models and personalized pagerank. PNAS 114, 33–38 (2017).
 47.
Lofgren, P. A., Banerjee, S., Goel, A. & Seshadhri, C. Fastppr: scaling personalized pagerank estimation for large graphs. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 1436–1445 (ACM, 2014).
 48.
Gleich, D. F. & Kloster, K. Seeded pagerank solution paths. European Journal of Applied Mathematics 27, 812–845 (2016).
 49.
Gates, A. J. & Ahn, Y.Y. CluSim: a Python package for the comparison of clusterings. Journal of Open Source Software 4, 1264 (2019).
 50.
Yang, J. & Leskovec, J. CommunityAffiliation Graph Model for Overlapping Network Community Detection. In 2012 IEEE 12th International Conference on Data Mining (ICDM), 1170–1175 (IEEE, 2012).
 51.
Blondel, V. D., Gajardo, A., Heymans, M., Senellart, P. & Van Dooren, P. A Measure of similarity between graph vertices: applications to synonym extraction and web searching. SIAM Review 46, 647–666 (2004).
 52.
Jain, A. K. Data clustering: 50 years beyond kmeans. Pattern Recognition Letters 31, 651–666 (2010).
 53.
Alimoglu, F. & Alpaydin, E. Methods of combining multiple classifiers based on different representations for penbased handwritten digit recognition. In Proceedings of the Fifth Turkish Artificial Intelligence and Artificial Neural Networks Symposium (1996).
 54.
Traud, A. L., Kelsic, E. D., Mucha, P. J. & Porter, M. A. Comparing community structure to characteristics in online collegiate social networks. SIAM Review 53, 526–543 (2011).
 55.
Traud, A. L., Mucha, P. J. & Porter, M. A. Social structure of facebook networks. Physica A: Statistical Mechanics and its Applications 391, 4165–4180 (2012).
 56.
Blondel, V. D., Guillaume, J.L., Lambiotte, R. & Lefebvre, E. Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment 2008, P10008 (2008).
 57.
AlexanderBloch, A. et al. The discovery of population differences in network community structure: new methods and applications to brain functional networks in schizophrenia. Neuroimage 59, 3889–3900 (2012).
 58.
Cheng, H. et al. Nodal centrality of functional network in the differentiation of schizophrenia. Schizophrenia Research 168, 345–352 (2015).
 59.
Fornito, A., Zalesky, A., Pantelis, C. & Bullmore, E. T. Schizophrenia, neuroimaging and connectomics. Neuroimage 62, 2296–2314 (2012).
 60.
Du, W. et al. High classification accuracy for schizophrenia with rest and task fmri data. Frontiers in Human Neuroscience 6 (2012).
 61.
Arbabshirani, M. R., Kiehl, K., Pearlson, G. & Calhoun, V. D. Classification of schizophrenia patients based on restingstate functional network connectivity. Frontiers in Neuroscience 7 (2013).
 62.
Lancichinetti, A., Radicchi, F., Ramasco, J. J. & Fortunato, S. Finding Statistically Significant Communities in Networks. PLoS One 6, e18961 (2011).
 63.
Kircher, T. T. et al. Differential activation of temporal cortex during sentence completion in schizophrenic patients with and without formal thought disorder. Schizophrenia research 50, 27–40 (2001).
 64.
Kuperberg, G. R., Deckersbach, T., Holt, D. J., Goff, D. & West, W. C. Increased temporal and prefrontal activity in response to semantic associations in schizophrenia. Archives of General Psychiatry 64, 138–151 (2007).
 65.
Bassett, D. S. et al. Robust detection of dynamic community structure in networks. Chaos: An Interdisciplinary Journal of Nonlinear Science 23, 013142 (2013).
 66.
Monti, S., Tamayo, P., Mesirov, J. & Golub, T. Consensus clustering: A resamplingbased method for class discovery and visualization of gene expression microarray data. Machine Learning 52, 91–118 (2003).
 67.
Lancichinetti, A. & Fortunato, S. Consensus clustering in complex networks. Scientific Reports 2, 00336 (2012).
Acknowledgements
We would like to thank DaeJin Kim for assistance with the interpretation of the schizophrenia classifications, and Hu Cheng for assistance processing the fMRI timeseries. We thank Randall D. Beer, Luis M. Rocha, Filippo Radicchi, Sune Lehmann, Olaf Sporns, Alessio Cardillo, and Artemy Kolchensiky for helpful discussions. Supported in part by National Institute for Mental Health Grant 2R01MH074983 to W.P.H. Y.Y.A. thanks Microsoft Research for support through a Microsoft Research Faculty Fellowship. We thank the anonymous reviewers for their insightful comments.
Author information
Affiliations
Contributions
A.J.G. and Y.Y.A. developed the method, A.J.G. and I.B.W. performed the analysis, W.P.H. contributed the fMRI data, A.J.G., I.B.W., W.P.H. and Y.Y.A. participated in interpreting results, A.J.G. and Y.Y.A. wrote the manuscript. All authors reviewed and edited the manuscript.
Corresponding authors
Ethics declarations
Competing Interests
The authors declare no competing interests.
Additional information
Publisher’s note: Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Supplementary information
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Gates, A.J., Wood, I.B., Hetrick, W.P. et al. Elementcentric clustering comparison unifies overlaps and hierarchy. Sci Rep 9, 8574 (2019). https://doi.org/10.1038/s4159801944892y
Received:
Accepted:
Published:
DOI: https://doi.org/10.1038/s4159801944892y
Further reading

Refinement for community structures of bipartite networks
Journal of the Korean Physical Society (2021)

Prediction of students’ procrastination behaviour through their submission behavioural pattern in online learning
Journal of Ambient Intelligence and Humanized Computing (2020)
Comments
By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.