Search Results for author:
Found 4 papers, 0 papers with code
Fast and Memory-Efficient Significant Pattern Mining via Permutation Testing
Westfall-Young light opens the door to significant pattern mining on large datasets that previously led to prohibitive runtime or memory costs.
Significant Subgraph Mining with Multiple Testing Correction
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.
Identifying Higher-order Combinations of Binary Features
Finding statistically significant interactions between binary variables is computationally and statistically challenging in high-dimensional settings, due to the combinatorial explosion in the number of hypotheses.
Efficient network-guided multi-locus association mapping with graph cuts
We present SConES, a new efficient method to discover sets of genetic loci that are maximally associated with a phenotype, while being connected in an underlying network.
