Supervised learning problem formulation

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In machine learning we distinguish various approaches between two extreme ones: unsupervised and supervised learning. The task of unsupervised learning consists in grouping similar data points in the description space thus inducing a structure on it. Then the data model can be expressed in terms of space partition. Probably, the most popular of such grouping algorithms in visual content mining is the K-means approach introduced by MacQueen as early as in 1967, at least this is the approach which was used for the very popular Bag-of-Visual Words model we have mentioned in Chap. 1. The Deep learning approach is a part of the family of supervised learning methods designed both for classification and regression. In this very short chapter we will focus on the formal definition of supervised learning approach, but also on fundamentals of evaluation of classification algorithms as the evaluation metrics will be used further in the book.

Cite

CITATION STYLE

APA

Zemmari, A., & Benois-Pineau, J. (2020). Supervised learning problem formulation. In SpringerBriefs in Computer Science (pp. 5–11). Springer. https://doi.org/10.1007/978-3-030-34376-7_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free