{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T21:51:46Z","timestamp":1761429106746},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2015,5,30]],"date-time":"2015-05-30T00:00:00Z","timestamp":1432944000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10472-015-9456-8","type":"journal-article","created":{"date-parts":[[2015,5,29]],"date-time":"2015-05-29T18:45:46Z","timestamp":1432925146000},"page":"335-350","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A kd-tree algorithm to discover the boundary of a black box hypervolume"],"prefix":"10.1007","volume":"75","author":[{"given":"Jean-Baptiste","family":"Rouquier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Isabelle","family":"Alvarez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Romain","family":"Reuillon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre-Henri","family":"Wuillemin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,30]]},"reference":[{"key":"9456_CR1","unstructured":"Alvarez, I., de Aldama, R., Martin, S., Reuillon, R.: Assessing the Resilience of Socio-Ecosystems: Coupling Viability Theory and Active Learning with kd-Trees. Application to Bilingual Societies. In: proceedings of IJCAI, pp 2776\u20132782 (2013). http:\/\/ijcai.org\/papers13\/Papers\/IJCAI13-409.pdf"},{"key":"9456_CR2","doi-asserted-by":"crossref","unstructured":"Aubin, J.P., Bayen, A., Saint-Pierre, P.: Viability Theory: New Directions. Springer (2011). doi: 10.1007\/978-3-642-16684-6 . http:\/\/hal.inria.fr\/inria-00636570","DOI":"10.1007\/978-3-642-16684-6"},{"issue":"9","key":"9456_CR3","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509\u2013517 (1975). doi: 10.1145\/361002.361007","journal-title":"Commun. ACM"},{"issue":"4","key":"9456_CR4","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1109\/TSE.1979.234200","volume":"SE-5","author":"JL Bentley","year":"1979","unstructured":"Bentley, J.L.: Multidimensional binary search trees in database applications. IEEE Trans. Softw. Eng. SE-5(4), 333\u2013340 (1979). doi: 10.1109\/TSE.1979.234200","journal-title":"IEEE Trans. Softw. Eng."},{"key":"9456_CR5","doi-asserted-by":"crossref","unstructured":"Coquelin, P.A., Martin, S., Munos, R.: A dynamic programming approach to viability problems. In: IEEE International Symposium on Approximate Dynamic Programming and Reinforcement Learning, 2007. ADPRL 2007, pp 178\u2013184 (2007)","DOI":"10.1109\/ADPRL.2007.368186"},{"issue":"5","key":"9456_CR6","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1109\/TAC.2007.895881","volume":"52","author":"G Deffuant","year":"2007","unstructured":"Deffuant, G., Chapel, L., Martin, S.: Approximating Viability Kernels With Support Vector Machines. IEEE Trans. Autom. Control 52(5), 933\u2013937 (2007). doi: 10.1109\/TAC.2007.895881 [ http:\/\/hal.archives-ouvertes.fr\/hal-00616841 ]","journal-title":"IEEE Trans. Autom. Control"},{"issue":"8","key":"9456_CR7","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","volume":"31","author":"AK Jain","year":"2010","unstructured":"Jain, A.K.: Data clustering: 50 years beyond k-means. Pattern Recogn. Lett. 31 (8), 651\u2013666 (2010). doi: 10.1016\/j.patrec.2009.09.011","journal-title":"Pattern Recogn. Lett."},{"issue":"2","key":"9456_CR8","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1023\/B:MACH.0000011805.60520.fe","volume":"54","author":"M Lindenbaum","year":"2004","unstructured":"Lindenbaum, M., Markovitch, S., Rusakov, D.: Selective sampling for nearest neighbor classifiers. Mach. Learn. 54(2), 125\u2013152 (2004)","journal-title":"Mach. Learn."},{"key":"9456_CR9","unstructured":"Moore, A.W.: An intoductory tutorial on kd-trees (1991). http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.10.818"},{"key":"9456_CR10","unstructured":"Rosenthal, P., Linsen, L.: Direct isosurface extraction from scattered volume data. In: Ertl, T., Joy, K., Santos, B. (eds.) EUROVIS - Eurographics \/IEEE VGTC Symposium on Visualization, Eurographics Association, pp 99\u2013106 (2006), 10.2312\/VisSym\/EuroVis06\/099-106 . http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.89.2313"},{"key":"9456_CR11","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF01204182","volume":"29","author":"P Saint-Pierre","year":"1994","unstructured":"Saint-Pierre, P.: Approximation of the viability kernel. Appl. Math. Optim. 29, 187\u2013209 (1994)","journal-title":"Appl. Math. Optim."},{"key":"9456_CR12","unstructured":"Settles, B.: Active learning literature survey. Computer Sciences Technical Report 1648. University of Wisconsin\u2013Madison (2009)"},{"issue":"2","key":"9456_CR13","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/j.foodcont.2011.07.007","volume":"23","author":"M Sicard","year":"2012","unstructured":"Sicard, M., Perrot, N., Reuillon, R., Mesmoudi, S., Alvarez, I., Martin, S.: A viability approach to control food processes: Application to a camembert cheese ripening process. Food Control 23(2), 312\u2013319 (2012)","journal-title":"Food Control"},{"key":"9456_CR14","unstructured":"Villani, C.: Mesures de hausdorff (2004). http:\/\/math.univ-lyon1.fr\/homes-www\/villani\/Cours\/PDFFILES\/chap5.pdf"},{"key":"9456_CR15","doi-asserted-by":"crossref","unstructured":"Wald, I., Mark, W.R., G\u00fcnther, J., Boulos, S., Ize, T., Hunt, W., Parker, S.G., Shirley, P.: State of the art in ray tracing animated scenes. Comput. Graphics Forum 28(6), 1691\u20131722 (2009). doi: 10.1111\/j.1467-8659.2008.01313.x","DOI":"10.1111\/j.1467-8659.2008.01313.x"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-015-9456-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-015-9456-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-015-9456-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T17:58:21Z","timestamp":1559152701000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-015-9456-8"}},"subtitle":["Or how to peel potatoes by recursively cutting them in halves"],"short-title":[],"issued":{"date-parts":[[2015,5,30]]},"references-count":15,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["9456"],"URL":"https:\/\/doi.org\/10.1007\/s10472-015-9456-8","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,30]]}}}