Learning with attribute costs
From MaRDI portal
Publication:3581435
DOI10.1145/1060590.1060644zbMath1192.68392OpenAlexW2026501144MaRDI QIDQ3581435
Haim Kaplan, Eyal Kushilevitz, Yishay Mansour
Publication date: 16 August 2010
Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1060590.1060644
Related Items (14)
Optimal ordering of statistically dependent tests ⋮ The hardness of the expected decision depth problem ⋮ Non-adaptive stochastic score classification and explainable halfspace evaluation ⋮ Decision tree classification with bounded number of errors ⋮ Sequential testing in batches ⋮ A Polynomial-Time Approximation Scheme for Sequential Batch Testing of Series Systems ⋮ Decision trees for function evaluation: simultaneous optimization of worst and expected cost ⋮ Adaptivity gaps for the stochastic Boolean function evaluation problem ⋮ Scenario Submodular Cover ⋮ Decision-theoretic troubleshooting: hardness of approximation ⋮ Max-throughput for (conservative) \(k\)-of-\(n\) testing ⋮ Evaluation of monotone DNF formulas ⋮ Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case ⋮ On competitive recommendations
This page was built for publication: Learning with attribute costs
