scientific article; zbMATH DE number 2083809

MaRDI QIDQ4739610zbMATH OpenFDO

Authors Ricard Gavaldà, Osamu Watanabe

Publication date 6 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2264/22640173.htm

zbMATH Keywords

adaptive samplingChernoff boundsdata miningrandom samplingsequential sampling

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Adaptive sampling methods for scaling up knowledge discovery algorithms
• Sequential sampling techniques for algorithmic learning theory
• scientific article; zbMATH DE number 2080438
• Sampling algorithms: lower bounds and applications
• 10.1162/jmlr.2003.3.4-5.833

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
• scientific article; zbMATH DE number 1934571 (Why is no real title available?)
• scientific article; zbMATH DE number 2080438 (Why is no real title available?)
• Lower bounds for expected sample size of sequential procedures for the multinomial selection problems
• 10.1162/jmlr.2003.3.4-5.833
• scientific article; zbMATH DE number 2085229 (Why is no real title available?)
• scientific article; zbMATH DE number 1881117 (Why is no real title available?)
• A Constant Factor Approximation Algorithm for Event-Based Sampling
• Sampling algorithms: lower bounds and applications
• On Unifying the Space of ℓ₀-Sampling Algorithms

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4739610)