Contact FutureLearn for Support
Skip main navigation
We use cookies to give you a better experience, if that’s ok you can close this message and carry on browsing. For more info read our cookies policy.
We use cookies to give you a better experience. Carry on browsing if you're happy with this, or read our cookies policy for more information.

Skip to 0 minutes and 4 secondsIn this video lecture we explain the main characteristics of linear regression and how to perform it on large data sets using RHadoop. Let us continue first with songs complexity example. Recall we have a data set of songs and for each song we know its complexity measured by UNIGRAM and BIGRAM entropy. Based on the scatter plot we can conclude there must be a relatively strong linear relation between these two variables. Therefore we look for two parameters, beta zero and beta one, that define a line which fits well (best) the dots in the plot.

Skip to 0 minutes and 50 secondsThe criteria to find best line is actually a sum-of-square of vertical residuals. These are vertical distances between the data points and the vertical projections of these points to the line along the y axis. Note that we can also consider non-linear regression. For example, the goal of quadratic regression is to find parabola that fits best the data points. Criteria might be again the sum of squares of vertical residuals. Likewise we can define the exponential regression.

Introduction to linear regression

In this video we explain basic ideas behind linear regression.

Share this video:

This video is from the free online course:

Managing Big Data with R and Hadoop

Partnership for Advanced Computing in Europe (PRACE)