- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1573-0565
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Efficient SVDD sampling with approximation guarantees for the decision boundary ; volume:111 ; number:4 ; day:7 ; month:4 ; year:2022 ; pages:1349-1375 ; date:4.2022
Machine learning ; 111, Heft 4 (7.4.2022), 1349-1375, 4.2022
- Creator
-
Englhardt, Adrian
Trittenbach, Holger
Kottke, Daniel
Sick, Bernhard
Böhm, Klemens
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10994-022-06149-0
- URN
-
urn:nbn:de:101:1-2022072312275920129857
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:28 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Englhardt, Adrian
- Trittenbach, Holger
- Kottke, Daniel
- Sick, Bernhard
- Böhm, Klemens
- SpringerLink (Online service)
Other Objects (12)
Calculating approximation guarantees for partial set cover of pairs
Data-Driven Two-Stage Linear Optimization: Feasibility and Approximation Guarantees
Personal Routes with High-Dimensional Costs and Dynamic Approximation Guarantees
Worst-case Recovery Guarantees for Least Squares Approximation Using Random Samples
Methods of trigonometric and sampling approximation
Approximation by Modified Generalized Sampling Series
Regularized impurity reduction: accurate decision trees with complexity guarantees
Approximation properties of mixed sampling-Kantorovich operators
Approximation of Lipschitz Functions Preserving Boundary Values
Boundary Element Approximation for Maxwell's Eigenvalue Problem
Tight worst-case guarantees and approximation algorithms for several classes of geometric optimization problems
Sampling based approximation algorithms for multi-stage stochastic optimization
Calculating approximation guarantees for partial set cover of pairs
Data-Driven Two-Stage Linear Optimization: Feasibility and Approximation Guarantees
Personal Routes with High-Dimensional Costs and Dynamic Approximation Guarantees
Worst-case Recovery Guarantees for Least Squares Approximation Using Random Samples
Methods of trigonometric and sampling approximation
Approximation by Modified Generalized Sampling Series
Regularized impurity reduction: accurate decision trees with complexity guarantees
Approximation properties of mixed sampling-Kantorovich operators
Approximation of Lipschitz Functions Preserving Boundary Values
Boundary Element Approximation for Maxwell's Eigenvalue Problem
Tight worst-case guarantees and approximation algorithms for several classes of geometric optimization problems
Sampling based approximation algorithms for multi-stage stochastic optimization
Calculating approximation guarantees for partial set cover of pairs
Data-Driven Two-Stage Linear Optimization: Feasibility and Approximation Guarantees
Personal Routes with High-Dimensional Costs and Dynamic Approximation Guarantees
Worst-case Recovery Guarantees for Least Squares Approximation Using Random Samples
Methods of trigonometric and sampling approximation
Approximation by Modified Generalized Sampling Series
Regularized impurity reduction: accurate decision trees with complexity guarantees
Approximation properties of mixed sampling-Kantorovich operators
Approximation of Lipschitz Functions Preserving Boundary Values
Boundary Element Approximation for Maxwell's Eigenvalue Problem
Tight worst-case guarantees and approximation algorithms for several classes of geometric optimization problems