Detecting and approximating decision boundaries in low-dimensional spaces
From MaRDI portal
Publication:6202782
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.
Recommendations
- Detecting and approximating fault lines from randomly scattered data
- A scattered data approximation scheme for the detection of fault lines
- Accurate approximation of unknown fault lines from scattered data
- The detection and recovery of discontinuity curves from scattered data
- A fault detection method based on partition of unity and kernel approximation
Cites work
- scientific article; zbMATH DE number 1490047 (Why is no real title available?)
- A decomposition method for an interior inverse scattering problem
- A fault detection method based on partition of unity and kernel approximation
- A generalized formulation of the linear sampling method with exact characterization of targets in terms of farfield measurements
- A simple method for solving inverse scattering problems in the resonance region
- A survey on sampling and probe methods for inverse problems
- Adaptive radial basis function partition of unity interpolation: a bivariate algorithm for unstructured data
- An approximate measure of value
- Analysis of new direct sampling indicators for far-field measurements
- Approximating scattered data with discontinuities
- Approximation of surfaces with fault(s) and/or rapidly varying data, using a segmentation process, \(D^{m}\)-splines and the finite element method
- Curve reconstruction: Connecting dots with good reason
- Detection of discontinuities in scattered data approximation
- How to select and how to rank projects: The PROMETHEE method
- Kernel-based adaptive approximation of functions with discontinuities
- Multiple criteria decision aid. Methods, examples and Python implementations
- Pattern recognition and machine learning.
- Sampling method based projection approach for the reconstruction of 3D acoustically penetrable scatterers
- Scattered Data Approximation
- The Error in Linear Interpolation at the Vertices of a Simplex
- The SIR method: A superiority and inferiority ranking method for multiple criteria decision making
- The Transmission Problem for the Helmholtz Equation in R³
- The detection and recovery of discontinuity curves from scattered data
- The factorization method for inverse problems
- The factorization method for the acoustic transmission problem
- The nonlinear Landweber method applied to an inverse scattering problem for sound-soft obstacles in 3D
- Traveling salesman-based curve reconstruction in polynomial time
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)
