There is an analogy, more direct for fourier series. Both Fourier series and Taylor series are decompositions of a function $f(x)$, which is represented as a linear combination of a (countable) set of functions. The function is then fully specified by a sequence of coefficients, instead of by its values $f(x)$ for each $x$. In this sense, both can be called a transform ($f(x) \leftrightarrow \{ a_0, a_1, ...\}$).
For the Taylor series (around 0, for simplicity), the set of functions is $\{1, x , x^2, x^3...\}$. For the Fourier series is $\{1, \sin(\omega x), \cos(\omega x), \sin(2 \omega x), \cos(2 \omega x) ...\}$.
Actually the Fourier series is one the many transformations that uses an orthonomal basis of functions. It is shown that, in that case, the coefficients are obtained by "projecting" $f(x)$ onto each basis function, which amounts to an inner product, which (in the real scalar case) amounts to an integral. This implies that the coefficients depends on a global property of the function (over the full "period" of the function).
The Taylor series (which does not use a orthonormal basis) is conceptually very different, in that the coeffients depends only in local properties of the function, i.e., its behaviour in a neighbourhood (it's derivatives).