Detecting and approximating decision boundaries in low-dimensional spaces

From MaRDI portal
Publication:6202782

DOI10.1007/S11075-023-01618-6arXiv2302.08179OpenAlexW4385806510MaRDI QIDQ6202782FDOQ6202782


Authors: Matthias Grajewski, Andreas Kleefeld Edit this on Wikidata


Publication date: 26 March 2024

Published in: Numerical Algorithms (Search for Journal in Brave)

Abstract: A method for detecting and approximating fault lines or surfaces, respectively, or decision curves in two and three dimensions with guaranteed accuracy is presented. Reformulated as a classification problem, our method starts from a set of scattered points along with the corresponding classification algorithm to construct a representation of a decision curve by points with prescribed maximal distance to the true decision curve. Hereby, our algorithm ensures that the representing point set covers the decision curve in its entire extent and features local refinement based on the geometric properties of the decision curve. We demonstrate applications of our method to problems related to the detection of faults, to Multi-Criteria Decision Aid and, in combination with Kirsch's factorization method, to solving an inverse acoustic scattering problem. In all applications we considered in this work, our method requires significantly less pointwise classifications than previously employed algorithms.


Full work available at URL: https://arxiv.org/abs/2302.08179




Recommendations




Cites Work






This page was built for publication: Detecting and approximating decision boundaries in low-dimensional spaces

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