Sequential sampling algorithms: Unified analysis and lower bounds
From MaRDI portal
Recommendations
Cited in
(17)- Adaptive sampling methods for scaling up knowledge discovery algorithms
- SPEck: mining statistically-significant sequential patterns efficiently with exact sampling
- Sequential sampling techniques for algorithmic learning theory
- Lower Bound for the Average Sample Size and the Efficiency of Ranking Sequential Procedures
- Sampling large tables with constraints
- Using Storm for scaleable sequential statistical inference
- A family of unsupervised sampling algorithms
- Sequential approaches to data mining
- A scalable constant-memory sampling algorithm for pattern discovery in large databases
- Sequential sampling techniques for algorithmic learning theory
- Lower bounds for expected sample size of sequential procedures for the multinomial selection problems
- 10.1162/jmlr.2003.3.4-5.833
- Sampling-based relative landmarks: Systematically test-driving algorithms before choosing
- Scalability, search, and sampling: from smart algorithms to active discovery
- A Constant Factor Approximation Algorithm for Event-Based Sampling
- Sampling algorithms: lower bounds and applications
- On Unifying the Space of ℓ0-Sampling Algorithms
This page was built for publication: Sequential sampling algorithms: Unified analysis and lower bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4739610)
