Models

Up to now, we assumed that we now the true $p(y|x)$ (or $p(x|y),p(y)$).

In practice, we only get a sample (training set), drawn from this distribution.

Then, we have to approximate $p(y|x)$ (or $p(x|y),p(y)$). We will consider:

This models at the same time can also be categorized in:

Classifiers we will learn in this course

Classifiers we will learn in this course

Now, we will focus on the generative models: parametric and nonparametric.

<aside> 📝 Below follow four statements regarding discriminative and generative models of Machine Learning. Which statement is false?

  1. Generative models are able to create new data samples from classes while Discriminative models cannot.
  2. Discriminative models estimate $p(X|Y)$ in order to predict which class label a test sample should get.
  3. Generative models learn the conditional class probability $p(X|Y)$ from the data.
  4. Discriminative models estimate $p(Y|X)$ directly from the data in order to predict which class label a test sample should get.

Histogram-based Density Estimation

The easiest way of estimating the density is by using a histogram. The downside to this is that this requires a lot of samples (both in the amount of objects and the amount of repetitions) in order to generate a reliable reading.

Terminology:

Let’s start with a simple example. Say we have 10.000 throws of a dice, with 6 possible outcomes.

Untitled

If you have a really large sample, and if you repeat the experiment enough times, the relative frequencies of how often you get each outcome will appear. In the above example, as we have a large sample (of 10.000 objects), we get around 0.16 probability for each outcome (the small black vertical line above it is the standard deviation). This looks like a quite reliable estimate of our densities.