Alice and the Caterpillar: A more descriptive null model for assessing data mining results
arXiv:2506.09764 · doi:10.1007/s10115-023-02001-6
Abstract
We introduce novel null models for assessing the results obtained from observed binary transactional and sequence datasets, using statistical hypothesis testing. Our null models maintain more properties of the observed dataset than existing ones. Specifically, they preserve the Bipartite Joint Degree Matrix of the bipartite (multi-)graph corresponding to the dataset, which ensures that the number of caterpillars, i.e., paths of length three, is preserved, in addition to other properties considered by other models. We describe Alice, a suite of Markov chain Monte Carlo algorithms for sampling datasets from our null models, based on a carefully defined set of states and efficient operations to move between them. The results of our experimental evaluation show that Alice mixes fast and scales well, and that our null model finds different significant results than ones previously considered in the literature.
References in corpus (10)
- Assortative mixing in networks
- Stochastic blockmodels and community structure in networks
- The Statistical Physics of Real-World Networks
- Quantifying randomness in real networks
- Randomizing bipartite networks: the case of the World Trade Web
- Measuring and Modeling Bipartite Graphs with Community Structure
- A Tutorial on Statistically Sound Pattern Discovery
- On Realizations of a Joint Degree Matrix
- Sampling motif-constrained ensembles of networks
- Monte Carlo Null Models for Genomic Data