Moving averages

## Project description

## Why??

Numpy does not include a built-in moving average function as of yet. Most solutions are tedious and complicated and not one liners. This operates similar to the Wolfram Language’s MovingAverage[] function, but has the advantage that it can specify axis for higher ndim arrays.

## Usage

See docs for examples. But essentially, the usage is just:

from mvgavg import mvgavg mvgavg(array, n, axis=0, weights = [list of weights]) mvgavg(array, n, axis=0, binning = bool)

## What This Code Does

Consider the array [a,b,c,d, … x, y, z]. Taking the moving average of length n=3 results in a new array wherein the first element is (a+b+c)/3, the second (b+c+d)/3 and so on. This can be done for arrays of arbitrary depth, so if you put in a time series [[t1,x1],[t2,x2],…], a moving average of along axis=0 (the default) will give you back the moving average of all t’s along side all x’s.

The output is a vector that is the same size and shape but has been shortened on the axis axis by a length of n-1, unless binning=True (see below).

The structure of this code is that it runs a cumulative sum moving average if there is no weights or binning, as this is the fastest moving average typically, especially for wide or high ndim arrays. On the other hand, if either weights or binning is used, the appropriate function is selected.

## Axis and Weight Options

Axis: The axis lets you operate at an increased depth, so using the axis=1 parameter, you can operate horizontally across columns with your moving average. You can do this as deep as the array itself.

## Binning

Binning greatly shortens the array and loses some precision. This is desirable if you have an enormous amount of data and don’t need to preserve every point. The difference between a default moving average and a binned moving average is that, for an input array [a b c d e f…] and an output [A B C D E F…] over distance 3, the default moving average looks like this:

A = [a b c]/3 B = [b c d]/3 C = [c d e]/3 D = [d e f]/3 E = [e f g]/3 ....

but if binning = True:

A = [a b c]/3 B = [d e f]/3 C = [g h i]/3 .....

As you can see the output array is greatly shortened. As arrays get very large, binning can become orders of magnitude faster to compute, and if you don’t need the resolution of a moving average, are a much more efficient way of handling data, because you may end up throwing most of your data away later when you go to plot it up anyways.

## Why Is This Function Important?

Moving averages smooth data and illuminate trends that otherwise may not be as apparent. They also help with reverse interpolation when different x’s yield the same y. The reasons for using moving averages are myriad, so a decent arbitrary-depth moving average function with numpy-speed and arbitrary weighting needed to be written.

## Acknowledgements

Credit to @fnjn on github for the sliding window function.

## Misc

If you have issues or questions, open an issue on Github at https://github.com/NGeorgescu/python-moving-average or if you think there’s some functionality that you would like to see, or if you have a faster algorithm

Thanks and Enjoy!

## Project details

## Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Filename, size | File type | Python version | Upload date | Hashes |
---|---|---|---|---|

Filename, size mvgavg-0.1.0-py3-none-any.whl (17.5 kB) | File type Wheel | Python version py3 | Upload date | Hashes View hashes |

Filename, size mvgavg-0.1.0.tar.gz (4.5 kB) | File type Source | Python version None | Upload date | Hashes View hashes |