{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:17:57Z","timestamp":1740107877801,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"14","license":[{"start":{"date-parts":[[2021,5,15]],"date-time":"2021-05-15T00:00:00Z","timestamp":1621036800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,15]],"date-time":"2021-05-15T00:00:00Z","timestamp":1621036800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Agence nationale de la recherche","award":["ANR\u201311\u2013IDEX\u20130004\u201302"],"award-info":[{"award-number":["ANR\u201311\u2013IDEX\u20130004\u201302"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s00500-021-05872-5","type":"journal-article","created":{"date-parts":[[2021,5,15]],"date-time":"2021-05-15T13:02:44Z","timestamp":1621083764000},"page":"9285-9305","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Racing trees to query partial data"],"prefix":"10.1007","volume":"25","author":[{"given":"Vu-Linh","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2026-468X","authenticated-orcid":false,"given":"S\u00e9bastien","family":"Destercke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marie-H\u00e9l\u00e8ne","family":"Masson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rashad","family":"Ghassani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,15]]},"reference":[{"key":"5872_CR1","unstructured":"Abe N, Mamitsuka H (1998) Query learning strategies using boosting and bagging. In: Proceedings of the fifteenth international conference on machine learning (ICML), Morgan Kaufmann Pub, vol\u00a01"},{"issue":"3","key":"5872_CR2","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10994-014-5458-8","volume":"97","author":"R Busa-Fekete","year":"2014","unstructured":"Busa-Fekete R, Sz\u00f6r\u00e9nyi B, Weng P, Cheng W, H\u00fcllermeier E (2014) Preference-based reinforcement learning: evolutionary direct policy search using a preference-based racing algorithm. Mach Learn 97(3):327\u2013351","journal-title":"Mach Learn"},{"key":"5872_CR3","unstructured":"Cabannnes V, Rudi A, Bach F (2020) Structured prediction with partial labelling through the infimum loss. In: International conference on machine learning, PMLR, pp 1230\u20131239"},{"key":"5872_CR4","doi-asserted-by":"crossref","unstructured":"Cour T, Sapp B, Jordan C, Taskar B (2009) Learning from ambiguously labeled images. In: Proceedings of the 2009 IEEE conference on computer vision and pattern recognition (CVPR), IEEE, pp 919\u2013926","DOI":"10.1109\/CVPRW.2009.5206667"},{"key":"5872_CR5","first-page":"1501","volume":"12","author":"T Cour","year":"2011","unstructured":"Cour T, Sapp B, Taskar B (2011) Learning from partial labels. J Mach Learn Res 12:1501\u20131536","journal-title":"J Mach Learn Res"},{"issue":"22","key":"5872_CR6","doi-asserted-by":"publisher","first-page":"11,885","DOI":"10.1073\/pnas.97.22.11885","volume":"97","author":"A Dobra","year":"2000","unstructured":"Dobra A, Fienberg SE (2000) Bounds for cell entries in contingency tables given marginal totals and decomposable graphs. Proc Natl Acad Sci 97(22):11,885\u201311,892","journal-title":"Proc Natl Acad Sci"},{"key":"5872_CR7","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1016\/j.ijar.2006.06.017","volume":"45","author":"D Dubois","year":"2007","unstructured":"Dubois D, Hullermeier E (2007) Comparing probability measures using possibility theory: a notion of relative peakedness. Int J Approx Reason 45:364\u2013385","journal-title":"Int J Approx Reason"},{"issue":"374","key":"5872_CR8","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1080\/01621459.1981.10477650","volume":"76","author":"B Efron","year":"1981","unstructured":"Efron B (1981) Censored data and the bootstrap. J Am Stat Assoc 76(374):312\u2013319","journal-title":"J Am Stat Assoc"},{"issue":"12","key":"5872_CR9","doi-asserted-by":"publisher","first-page":"3692","DOI":"10.1016\/j.patcog.2008.05.019","volume":"41","author":"A Farhangfar","year":"2008","unstructured":"Farhangfar A, Kurgan L, Dy J (2008) Impact of imputation of missing values on classification error for discrete data. Pattern Recogn 41(12):3692\u20133705","journal-title":"Pattern Recogn"},{"key":"5872_CR10","first-page":"298","volume":"2017","author":"C Feng","year":"2017","unstructured":"Feng C, Liu MY, Kao CC, Lee TY (2017) Deep active learning for civil infrastructure defect detection and classification. Comput Civ Eng 2017:298\u2013306","journal-title":"Comput Civ Eng"},{"key":"5872_CR11","unstructured":"Guillaume R, Couso I, Dubois D (2017) Maximum likelihood with coarse data based on robust optimisation. In: Proceedings of the tenth international symposium on imprecise probability: theories and applications (ISIPTA), pp 169\u2013180"},{"key":"5872_CR12","doi-asserted-by":"crossref","unstructured":"Heitjan DF (1993) Ignorability and coarse data: some biomedical examples. Biometrics 49:1099\u20131109","DOI":"10.2307\/2532251"},{"issue":"3","key":"5872_CR13","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s10618-009-0131-8","volume":"19","author":"J H\u00fchn","year":"2009","unstructured":"H\u00fchn J, H\u00fcllermeier E (2009) Furia: an algorithm for unordered fuzzy rule induction. Data Min Knowl Disc 19(3):293\u2013319","journal-title":"Data Min Knowl Disc"},{"issue":"7","key":"5872_CR14","doi-asserted-by":"publisher","first-page":"1519","DOI":"10.1016\/j.ijar.2013.09.003","volume":"55","author":"E H\u00fcllermeier","year":"2014","unstructured":"H\u00fcllermeier E (2014) Learning from imprecise and fuzzy observations: data disambiguation through generalized loss minimization. Int J Approx Reason 55(7):1519\u20131534","journal-title":"Int J Approx Reason"},{"issue":"5","key":"5872_CR15","doi-asserted-by":"publisher","first-page":"419","DOI":"10.3233\/IDA-2006-10503","volume":"10","author":"E H\u00fcllermeier","year":"2006","unstructured":"H\u00fcllermeier E, Beringer J (2006) Learning from ambiguously labeled examples. Intell Data Anal 10(5):419\u2013439","journal-title":"Intell Data Anal"},{"key":"5872_CR16","doi-asserted-by":"crossref","unstructured":"H\u00fcllermeier E, Destercke S, Couso I (2019) Learning from imprecise data: adjustments of optimistic and pessimistic variants. In: International conference on scalable uncertainty management. Springer, pp 266\u2013279","DOI":"10.1007\/978-3-030-35514-2_20"},{"issue":"1","key":"5872_CR17","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0167-8809(00)00164-X","volume":"81","author":"P Lagacherie","year":"2000","unstructured":"Lagacherie P, Cazemier DR, Martin-Clouaire R, Wassenaar T (2000) A spatial approach using imprecise soil data for modelling crop yields over vast areas. Agric Ecosyst Environ 81(1):5\u201316","journal-title":"Agric Ecosyst Environ"},{"key":"5872_CR18","unstructured":"Liu L, Dietterich T (2014) Learnability of the superset label learning problem. In: Proceedings of the 31st international conference on machine learning (ICML), pp 1629\u20131637"},{"key":"5872_CR19","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.patrec.2015.08.023","volume":"68","author":"F Lobato","year":"2015","unstructured":"Lobato F, Sales C, Araujo I, Tadaiesky V, Dias L, Ramos L, Santana A (2015) Multi-objective genetic algorithm for missing data imputation. Pattern Recogn Lett 68:126\u2013131","journal-title":"Pattern Recogn Lett"},{"key":"5872_CR20","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.patcog.2015.10.014","volume":"52","author":"L Ma","year":"2016","unstructured":"Ma L, Destercke S, Wang Y (2016) Online active learning of decision trees with evidential data. Pattern Recogn 52:33\u201345","journal-title":"Pattern Recogn"},{"key":"5872_CR21","doi-asserted-by":"crossref","unstructured":"Maron O, Moore AW (1997) The racing algorithm: Model selection for lazy learners. In: Lazy learning, Springer, pp 193\u2013225","DOI":"10.1007\/978-94-017-2053-3_8"},{"key":"5872_CR22","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.socec.2017.10.003","volume":"72","author":"J McDonald","year":"2018","unstructured":"McDonald J, Stoddard O, Walton D (2018) On using interval response data in experimental economics. J Behav Exp Econ 72:9\u201316","journal-title":"J Behav Exp Econ"},{"key":"5872_CR23","doi-asserted-by":"crossref","unstructured":"Nguyen VL, Destercke S, Masson MH (2017) Querying partially labelled data to improve a k-nn classifier. In: Proceedings of the thirty-first AAAI conference on artificial intelligence (AAAI), February 4\u20139, 2017, San Francisco, California, USA, pp 2401\u20132407","DOI":"10.1609\/aaai.v31i1.10808"},{"key":"5872_CR24","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.ijar.2018.03.005","volume":"96","author":"VL Nguyen","year":"2018","unstructured":"Nguyen VL, Destercke S, Masson MH (2018) Partial data querying through racing algorithms. Int J Approx Reason 96:36\u201355","journal-title":"Int J Approx Reason"},{"key":"5872_CR25","unstructured":"Nigam K, McCallum A (1998) Pool-based active learning for text classification. In: Proceedings of Conference on Automated Learning and Discovery (CONALD)"},{"issue":"6","key":"5872_CR26","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1080\/01431169108929728","volume":"12","author":"S Prince","year":"1991","unstructured":"Prince S (1991) A model of regional primary production for use with coarse resolution satellite data. Int J Remote Sens 12(6):1313\u20131330","journal-title":"Int J Remote Sens"},{"issue":"1","key":"5872_CR27","first-page":"81","volume":"1","author":"JR Quinlan","year":"1986","unstructured":"Quinlan JR (1986) Induction of decision trees. Mach Learn 1(1):81\u2013106","journal-title":"Mach Learn"},{"issue":"8","key":"5872_CR28","doi-asserted-by":"publisher","first-page":"1049","DOI":"10.1016\/j.patrec.2007.06.019","volume":"29","author":"JJ Rodr\u00edguez","year":"2008","unstructured":"Rodr\u00edguez JJ, Maudes J (2008) Boosting recombined weak classifiers. Pattern Recogn Lett 29(8):1049\u20131059","journal-title":"Pattern Recogn Lett"},{"issue":"3","key":"5872_CR29","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1093\/biomet\/63.3.581","volume":"63","author":"DB Rubin","year":"1976","unstructured":"Rubin DB (1976) Inference and missing data. Biometrika 63(3):581\u2013592","journal-title":"Biometrika"},{"issue":"3","key":"5872_CR30","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1109\/21.97458","volume":"21","author":"SR Safavian","year":"1991","unstructured":"Safavian SR, Landgrebe D (1991) A survey of decision tree classifier methodology. IEEE Trans Syst Man Cybern 21(3):660\u2013674","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"5872_CR31","unstructured":"Settles B (2009) Active learning literature survey. Computer Sciences Technical Report 1648, University of Wisconsin-Madison"},{"issue":"1","key":"5872_CR32","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.ijar.2006.06.001","volume":"45","author":"MC Troffaes","year":"2007","unstructured":"Troffaes MC (2007) Decision making under uncertainty using imprecise probabilities. Int J Approx Reason 45(1):17\u201329","journal-title":"Int J Approx Reason"},{"key":"5872_CR33","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.neucom.2018.11.053","volume":"331","author":"LV Utkin","year":"2019","unstructured":"Utkin LV (2019) An imprecise extension of SVM-based machine learning models. Neurocomputing 331:18\u201332","journal-title":"Neurocomputing"},{"key":"5872_CR34","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.ijar.2018.11.007","volume":"104","author":"J Vandoni","year":"2019","unstructured":"Vandoni J, Aldea E, Le H\u00e9garat-Mascle S (2019) Evidential query-by-committee active learning for pedestrian detection in high-density crowds. Int J Approx Reason 104:166\u2013184","journal-title":"Int J Approx Reason"},{"key":"5872_CR35","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.patcog.2017.04.005","volume":"69","author":"J Xia","year":"2017","unstructured":"Xia J, Zhang S, Cai G, Li L, Pan Q, Yan J, Ning G (2017) Adjusted weight voting algorithm for random forests in handling missing values. Pattern Recogn 69:52\u201360","journal-title":"Pattern Recogn"},{"key":"5872_CR36","doi-asserted-by":"crossref","unstructured":"Zhang ML, Zhou BB, Liu XY (2016) Partial label learning via feature-aware disambiguation. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, pp 1335\u20131344","DOI":"10.1145\/2939672.2939788"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-05872-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-021-05872-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-05872-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,27]],"date-time":"2022-12-27T13:16:07Z","timestamp":1672146967000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-021-05872-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,15]]},"references-count":36,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["5872"],"URL":"https:\/\/doi.org\/10.1007\/s00500-021-05872-5","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2021,5,15]]},"assertion":[{"value":"3 May 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 May 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"This work was carried out in the framework of Labex MS2T and UML-NET projects, which were funded by the French National Agency for Research (Reference ANR-11-IDEX-0004-02, ANR-14-CE24-0026).","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Funding"}}]}}