Cargando…
A L1 Minimization Optimal Corrective Explanation Procedure for Probabilistic Databases
We propose to use a, recently introduced, efficient L1 distance minimization through mixed-integer linear programming for minimizing the number of valuations to be modified inside an incoherent probabilistic assessment. This is in line with one basic principle of optimal corrective explanation for d...
Autores principales: | Baioletti, Marco, Capotorti, Andrea |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7274306/ http://dx.doi.org/10.1007/978-3-030-50146-4_7 |
Ejemplares similares
-
Achieving descriptive accuracy in explanations via argumentation: The case of probabilistic classifiers
por: Albini, Emanuele, et al.
Publicado: (2023) -
Explanation and Correction
Publicado: (1899) -
Management of uncertainty orderings through ASP
por: Capotorti, Andrea, et al.
Publicado: (2006) -
Advances in probabilistic databases for uncertain information management
por: Ma, Zongmin, et al.
Publicado: (2013) -
Investigation of probabilistic optimization for tomotherapy
por: Kissick, Michael W., et al.
Publicado: (2012)