The stochastic score classification problem
From MaRDI portal
Publication:5009596
DOI10.4230/LIPICS.ESA.2018.36MaRDI QIDQ5009596FDOQ5009596
Authors: Dimitrios Gkenosis, Nathaniel Grammel, Devorah Kletenik, Lisa Hellerstein 
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1806.10660
Recommendations
- Algorithms for the unit-cost stochastic score classification problem
- Non-adaptive stochastic score classification and explainable halfspace evaluation
- The stochastic test collection problem: models, exact and heuristic solution approaches
- A serial risk score approach to disease classification that accounts for accuracy and cost
- Approximation algorithms for sequential batch-testing of series systems
Cites Work
- Supersparse linear integer models for optimized medical scoring systems
- A stochastic probing problem with applications
- Sequential testing of complex systems: a review
- Optimal Testing Procedures for Special Structures of Coherent Systems
- Adaptive submodular ranking
- An optimum testing algorithm for some symmetric coherent systems
- Adaptive submodularity: theory and applications in active learning and stochastic optimization
- Finding optimal satisficing strategies for and-or trees
- Evaluation of monotone DNF formulas
- Artificial intelligence and Mathematics IX. Selected papers from the 5th international symposium, Fort Lauderdale, FL, USA, January 2--5, 1998
- The price of information in combinatorial optimization
- Submodular goal value of Boolean functions
- Comments on the Proof of Adaptive Stochastic Set Cover Based on Adaptive Submodularity and Its Implications for the Group Identification Problem in “Group-Based Active Query Selection for Rapid Diagnosis in Time-Critical Situations”
- Approximation algorithms for stochastic submodular set cover with applications to Boolean function evaluation and min-knapsack
- Learning optimized risk scores
- Scenario submodular cover
Cited In (7)
- Title not available (Why is that?)
- Simple algorithms for stochastic score classification with small approximation ratios
- A General Framework for Approximating Min Sum Ordering Problems
- Adaptivity gaps for the stochastic Boolean function evaluation problem
- The stochastic Boolean function evaluation problem for symmetric Boolean functions
- Algorithms for the unit-cost stochastic score classification problem
- Non-adaptive stochastic score classification and explainable halfspace evaluation
This page was built for publication: The stochastic score classification problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5009596)
