基于多重检验校正的重要子图挖掘
Significant Subgraph Mining with Multiple Testing Correction
摘要:
由于需要校正多个假设检验,寻找在一类事务中统计上显著丰富的项集的问题变得复杂。修剪不可测试的假设最近被提出作为一种策略,这项任务的重要项集挖掘。它被证明导致更大的统计功效,发现更多真正重要的项目集,比标准的Bonferroni校正真实世界的数据集。然而,一个悬而未决的问题是,这种排除不可检验的假设的策略是否也会导致子图挖掘中更大的统计功效,其中假设的数量比项集挖掘中的要大得多。在这里,我们通过对八个流行的图形基准数据集的实证调查来回答这个问题。我们提出了一种新的高效的搜索策略,它总是返回相同的解决方案,作为国家的最先进的方法,大约是两个数量级的速度。此外,我们利用子图之间的依赖性,考虑有效的测试次数,从而进一步提高统计功效。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。