New upper bounds for tight and fast approximation of Fisher’s exact test in dependency rule mining
Author:
- 1 January 2016
- journal article
- Published by Elsevier in Computational Statistics & Data Analysis
- Vol. 93, 469-482
Abstract
No abstract availableKeywords
Funding Information
- Research Council of Finland (258589)
This publication has 11 references indexed in Scilit:
- Kingfisher: an efficient algorithm for searching for both positive and negative dependency rules with statistical significance measuresKnowledge and Information Systems, 2011
- Efficient Search Methods for Statistical Dependency RulesFundamenta Informaticae, 2011
- StatApriori: an efficient algorithm for searching statistically significant association rulesKnowledge and Information Systems, 2009
- Recommended tests for association in 2×2 tablesStatistics in Medicine, 2009
- A major improvement to the Network Algorithm for Fisher's Exact Test in 2×c contingency tablesComputational Statistics & Data Analysis, 2005
- K-Optimal Rule DiscoveryData Mining and Knowledge Discovery, 2005
- Comparing the asymptotic power of exact tests in 2×2 tablesComputational Statistics & Data Analysis, 2004
- A Survey of Exact Inference for Contingency TablesStatistical Science, 1992
- A survey of algorithms for exact distributions of test statistics in r × c contingency tables with fixed marginsComputational Statistics & Data Analysis, 1985
- A network algorithm for the exact treatment of the 2×k contingency tableCommunications in Statistics - Simulation and Computation, 1980