Skip to main content

Supervised machine learning

  • Chapter
  • First Online:
Data Science

Abstract

For example, an algorithm can sort a list of arbitrary strings—such as a list of words or names—in alphabetical order. If such an algorithm was presented with the tuple (David, Robert, Anna, Carl), the correct output would be the tuple (Anna, Carl, David, Robert).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2023 Springer-Verlag GmbH Germany, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Plaue, M. (2023). Supervised machine learning. In: Data Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-67882-4_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-67882-4_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-67881-7

  • Online ISBN: 978-3-662-67882-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics