A kd-tree algorithm to discover the boundary of a black box hypervolume. Or how to peel potatoes by recursively cutting them in halves

DOI10.1007/S10472-015-9456-8zbMATH Open1347.68349OpenAlexW1868934959MaRDI QIDQ905994FDOQ905994

Authors: Jean-Baptiste Rouquier, Isabelle Alvarez, Romain Reuillon, Pierre-Henri Wuillemin 

Publication date: 28 January 2016

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-015-9456-8

Recommendations

• Computing the viability kernel in large state dimension
• Computing the viability kernel using maximal reachable sets
• scientific article; zbMATH DE number 794291
• A viability algorithm
• scientific article; zbMATH DE number 1670657

zbMATH Keywords

viabilitydecision support system\(kd\)-treeapproximation of hyper-volume

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Data structures (68P05) Approximation algorithms (68W25) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Cites Work

• Viability Theory
• Multidimensional binary search trees used for associative searching
• Active learning
• Selective sampling for nearest neighbor classifiers
• Approximation of the viability kernel
• Multidimensional Binary Search Trees in Database Applications
• Approximating Viability Kernels With Support Vector Machines

Cited In (1)

• Mathematical modeling of an urban pigeon population subject to local management strategies

This page was built for publication: A \(kd\)-tree algorithm to discover the boundary of a black box hypervolume. Or how to peel potatoes by recursively cutting them in halves

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