Significant Subgraph Mining with Multiple Testing Correction

by   Mahito Sugiyama, et al.
Københavns Uni
ETH Zurich
Osaka University

The problem of finding itemsets that are statistically significantly enriched in a class of transactions is complicated by the need to correct for multiple hypothesis testing. Pruning untestable hypotheses was recently proposed as a strategy for this task of significant itemset mining. It was shown to lead to greater statistical power, the discovery of more truly significant itemsets, than the standard Bonferroni correction on real-world datasets. An open question, however, is whether this strategy of excluding untestable hypotheses also leads to greater statistical power in subgraph mining, in which the number of hypotheses is much larger than in itemset mining. Here we answer this question by an empirical investigation on eight popular graph benchmark datasets. We propose a new efficient search strategy, which always returns the same solution as the state-of-the-art approach and is approximately two orders of magnitude faster. Moreover, we exploit the dependence between subgraphs by considering the effective number of tests and thereby further increase the statistical power.


page 1

page 2

page 3

page 4


Searching for significant patterns in stratified data

Significant pattern mining, the problem of finding itemsets that are sig...

Identifying Higher-order Combinations of Binary Features

Finding statistically significant interactions between binary variables ...

Distributions associated with simultaneous multiple hypothesis testing

We develop the distribution of the number of hypotheses found to be stat...

Efficient Algorithms for Densest Subgraph Discovery

Densest subgraph discovery (DSD) is a fundamental problem in graph minin...

Fast and Memory-Efficient Significant Pattern Mining via Permutation Testing

We present a novel algorithm, Westfall-Young light, for detecting patter...

Statistically Significant Pattern Mining with Ordinal Utility

Statistically significant patterns mining (SSPM) is an essential and cha...

Calibrated Nonparametric Scan Statistics for Anomalous Pattern Detection in Graphs

We propose a new approach, the calibrated nonparametric scan statistic (...

Please sign up or login with your details

Forgot password? Click here to reset