Basically, the idea of feature spaces is to blow up the data into high dimensions. So, we use x' = f(x) as our data, instead of x. It turns out that in lots

Basically, the idea of feature spaces is to blow up the data into high dimensions. So, we use x' = f(x) as our data, instead of x. It turns out that in lots of machine learning algorithms (notably SVMs), you end up only needing inner products between different data elements. That is, we need to compute x^T y for two data elements x and y. In feature space, we need could compute this by doing f(x)^T f(y). However, it turns out that for certain feature spaces (like polynomials) one can compute the number f(x)^T f(y) quite quickly with out ever explicitly forming the big vectors x' or y'.