MCbiF: Measuring Topological Autocorrelation in Multiscale Clusterings via 2-Parameter Persistent Homology
Juni Schindler, Mauricio Barahona
TL;DR
The paper tackles measuring topological autocorrelation in non-hierarchical multiscale clusterings by introducing the Multiscale Clustering Bifiltration (MCbiF), a 2-parameter filtration that encodes cluster intersections across starting scale $s$ and lag $t-s$. Using multiparameter persistent homology, MCbiF yields a finitely presented, block-decomposable module whose Hilbert functions $\mathrm{HF}_k(s,t)$ quantify 0-conflicts (non-hierarchy) and 1-conflicts (higher-order inconsistencies) in the partition sequence. The authors show that MCbiF has a nerve-based equivalent that extends Sankey diagrams to higher order and prove stability of the Hilbert-function invariants. Through synthetic and real-world data (e.g., wild mice social behavior), MCbiF features outperform information-based baselines in regression and classification and offer interpretable, topology-grounded descriptors for non-hierarchical temporal clustering tasks.
Abstract
Datasets often possess an intrinsic multiscale structure with meaningful descriptions at different levels of coarseness. Such datasets are naturally described as multi-resolution clusterings, i.e., not necessarily hierarchical sequences of partitions across scales. To analyse and compare such sequences, we use tools from topological data analysis and define the Multiscale Clustering Bifiltration (MCbiF), a 2-parameter filtration of abstract simplicial complexes that encodes cluster intersection patterns across scales. The MCbiF can be interpreted as a higher-order extension of Sankey diagrams and reduces to a dendrogram for hierarchical sequences. We show that the multiparameter persistent homology (MPH) of the MCbiF yields a finitely presented and block decomposable module, and its stable Hilbert functions characterise the topological autocorrelation of the sequence of partitions. In particular, at dimension zero, the MPH captures violations of the refinement order of partitions, whereas at dimension one, the MPH captures higher-order inconsistencies between clusters across scales. We demonstrate through experiments the use of MCbiF Hilbert functions as topological feature maps for downstream machine learning tasks. MCbiF feature maps outperform information-based baseline features on both regression and classification tasks on synthetic sets of non-hierarchical sequences of partitions. We also show an application of MCbiF to real-world data to measure non-hierarchies in wild mice social grouping patterns across time.
