The previous chapter, as well as Chapter 4, have focused on supervised learning problems, which assume the availability of a labeled training set 𝒟. A labeled data set consists of examples in the form of pairs (𝑥, 𝑡) of input 𝑥 and desired output 𝑡.
Review the options below to login to check your access.
Log in with your Cambridge Aspire website account to check access.
If you believe you should have access to this content, please contact your institutional librarian or consult our FAQ page for further information about accessing our content.