Inexpensive Cost-Optimized Measurement Proposal for Sequential Model-Based Diagnosis

May 28, 2017 Β· Declared Dead Β· πŸ› Workshop on Principles of Diagnosis

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Patrick Rodler, Wolfgang Schmid, Konstantin Schekotihin arXiv ID 1705.09879 Category cs.AI: Artificial Intelligence Citations 15 Venue Workshop on Principles of Diagnosis Last Checked 4 months ago
Abstract
In this work we present strategies for (optimal) measurement selection in model-based sequential diagnosis. In particular, assuming a set of leading diagnoses being given, we show how queries (sets of measurements) can be computed and optimized along two dimensions: expected number of queries and cost per query. By means of a suitable decoupling of two optimizations and a clever search space reduction the computations are done without any inference engine calls. For the full search space, we give a method requiring only a polynomial number of inferences and guaranteeing query properties existing methods cannot provide. Evaluation results using real-world problems indicate that the new method computes (virtually) optimal queries instantly independently of the size and complexity of the considered diagnosis problems.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Artificial Intelligence

Died the same way β€” πŸ‘» Ghosted