Skip to main content

Partial Data Querying Through Racing Algorithms

  • 1450 Accesses

Part of the Lecture Notes in Computer Science book series (LNAI,volume 9978)


This paper studies the problem of learning from instances characterized by imprecise features or imprecise class labels. Our work is in the line of active learning, since we consider that the precise value of some partial data can be queried to reduce the uncertainty in the learning process. Our work is based on the concept of racing algorithms in which several models are competing. The idea is to identify the query that will help the most to quickly decide the winning model in the competition. After discussing and formalizing the general ideas of our approach, we study the particular case of binary SVM and give the results of some preliminary experiments.


  • Partial data
  • Data querying
  • Active learning
  • Racing algorithms

This is a preview of subscription content, access via your institution.

Buying options

USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-319-49046-5_14
  • Chapter length: 12 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
USD   84.99
Price excludes VAT (USA)
  • ISBN: 978-3-319-49046-5
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   109.99
Price excludes VAT (USA)
Fig. 1.
Fig. 2.
Fig. 3.
Fig. 4.


  1. 1.

    As \(\mathcal {X}\) is often multi-dimensional, we will denote its elements and subsets by bold letters.


  1. Burges, C.J.: A tutorial on support vector machines for pattern recognition. Data Min. Knowl. Discov. 2(2), 121–167 (1998)

    CrossRef  Google Scholar 

  2. Cour, T., Sapp, B., Jordan, C., Taskar, B.: Learning from ambiguously labeled images. In: CVPR 2009. IEEE Conference on Computer Vision and Pattern Recognition, pp. 919–926. IEEE (2009)

    Google Scholar 

  3. Cour, T., Sapp, B., Taskar, B.: Learning from partial labels. J. Mach. Learn. Res. 12, 1501–1536 (2011)

    MathSciNet  MATH  Google Scholar 

  4. Hüllermeier, E.: Learning from imprecise and fuzzy observations: data disambiguation through generalized loss minimization. Int. J. Approx. Reason. 55(7), 1519–1534 (2014)

    MathSciNet  CrossRef  MATH  Google Scholar 

  5. Maron, O., Moore, A.W.: The racing algorithm: Model selection for lazy learners. In: Aha, D.W. (ed.) Lazy Learning, pp. 193–225. Springer, Heidelberg (1997)

    CrossRef  Google Scholar 

  6. Settles, B.: Active learning literature survey. Computer Sciences Technical report 1648, University of Wisconsin-Madison (2009)

    Google Scholar 

  7. Troffaes, M.C.: Decision making under uncertainty using imprecise probabilities. Int. J. Approx. Reason. 45(1), 17–29 (2007)

    MathSciNet  CrossRef  MATH  Google Scholar 

Download references


This work was carried out in the framework of Labex MS2T, which was funded by the French National Agency for Research (Reference ANR-11-IDEX-0004-02).

Author information

Authors and Affiliations


Corresponding author

Correspondence to Vu-Linh Nguyen .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Nguyen, VL., Destercke, S., Masson, MH. (2016). Partial Data Querying Through Racing Algorithms. In: Huynh, VN., Inuiguchi, M., Le, B., Le, B., Denoeux, T. (eds) Integrated Uncertainty in Knowledge Modelling and Decision Making. IUKM 2016. Lecture Notes in Computer Science(), vol 9978. Springer, Cham.

Download citation

  • DOI:

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-49045-8

  • Online ISBN: 978-3-319-49046-5

  • eBook Packages: Computer ScienceComputer Science (R0)