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-8zbMath1347.68349OpenAlexW1868934959MaRDI QIDQ905994

Jean-Baptiste Rouquier, Romain Reuillon, Isabelle Alvarez, 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

zbMATH Keywords

decision support systemviability\(kd\)-treeapproximation of hyper-volume

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

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

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