This package consists of a small library of optimised tools for doing things that can roughly
be considered "group-indexing operations". The most prominent tool is aggregate, which is
descibed in detail further down the page.
If you have pip, then simply:
pip install numpy_groupies
Note that numpy_groupies doesn't have any compulsory dependencies (even numpy is optional)
so you should be able to install it fairly easily even without a package manager. If you just
want one particular implementation of aggregate (e.g. aggregate_numpy.py), you can download
that one file, and copy-paste the contents of utils.py into the top of that file (replacing
the from .utils import (...) line).
import numpy as np
import numpy_groupies as npg
group_idx = np.array([ 3, 0, 0, 1, 0, 3, 5, 5, 0, 4])
a = np.array([13.2, 3.5, 3.5,-8.2, 3.0,13.4,99.2,-7.1, 0.0,53.7])
npg.aggregate(group_idx, a, func='sum', fill_value=0)
# >>> array([10.0, -8.2, 0.0, 26.6, 53.7, 92.1])aggregate takes an array of values, and an array giving the group number for each of those values.
It then returns the sum (or mean, or std, or any, ...etc.) of the values in each group. You have
probably come across this idea before - see Matlab's accumarray function, or
pandas groupby concept, or
MapReduce paradigm, or simply the basic histogram.
A couple of implemented functions do not reduce the data, instead it calculates values cumulatively while iterating over the data or permutates them. The output size matches the input size.
group_idx = np.array([4, 3, 3, 4, 4, 1, 1, 1, 7, 8, 7, 4, 3, 3, 1, 1])
a = np.array([3, 4, 1, 3, 9, 9, 6, 7, 7, 0, 8, 2, 1, 8, 9, 8])
npg.aggregate(group_idx, a, func='cumsum')
# >>> array([3, 4, 5, 6,15, 9,15,22, 7, 0,15,17, 6,14,31,39])The function accepts various different combinations of inputs, producing various different shapes of output. We give a brief description of the general meaning of the inputs and then go over the different combinations in more detail:
group_idx- array of non-negative integers to be used as the "labels" with which to group the values ina.a- array of values to be aggregated.func='sum'- the function to use for aggregation. See the section below for nore details.size=None- the shape of the output array. IfNone, the maximum value ingroup_idxwill set the size of the output.fill_value=0- value to use for output groups that do not appear anywhere in thegroup_idxinput array.order='C'- for multidimensional output, this controls the layout in memory, can be'F'for fortran-style.dtype=None- thedtypeof the output.Nonemeans choose a sensible type for the givena,func, andfill_value.axis=None- explained below.ddof=0- passed through into calculations of variance and standard deviation (see section on functions).
- Form 1 is the simplest, taking
group_idxandaof matching 1D lengths, and producing a 1D output. - Form 2 is similar to Form 1, but takes a scalar
a, which is broadcast out to the length ofgroup_idx. Note that this is generally not that useful. - Form 3 is more complicated.
group_idxis the same length as thea.shape[axis]. The groups are broadcast out along the other axis/axes ofa, thus the output is of shapen_groups x a.shape[0] x ... x a.shape[axis-1] x a.shape[axis+1] x ... a.shape[-1], i.e. the output has two or more dimensions. - Form 4 also produces output with two or more dimensions, but for very different reasons to Form 3. Here
ais 1D andgroup_idxis exactly2D, whereas in Form 3aisND,group_idxis1D, and we provide a value foraxis. The length ofamust matchgroup_idx.shape[1], the value ofgroup_idx.shape[0]determines the number of dimensions in the ouput, i.e.group_idx[:,99]gives the(x,y,z)group indices for thea[99]. - Form 5 is the same as Form 4 but with scalar
a. As with Form 2, this is rarely that helpful.
Note on performance. The order of the output is unlikely to affect performance of aggregate (although it may affect your downstream usage of that output), however the order of multidimensional a or group_idx can affect performance: in Form 4 it is best if columns are contiguous in memory within group_idx, i.e. group_idx[:, 99] corresponds to a contiguous chunk of memory; in Form 3 it's best if all the data in a for group_idx[i] is contiguous, e.g. if axis=1 then we want a[:, 55] to be contiguous.
By default, aggregate assumes you want to sum the values within each group, however you can specify another
function using the func kwarg. This func can be any custom callable, however you will likely want one of
the following optimized functions. Note that not all functions might be provided by all implementations.
'sum'- sum of items within each group (see example above).'prod'- product of items within each group'mean'- mean of items within each group'var'- variance of items within each group. Useddofkwarg for degrees of freedom. The divisor used in calculations isN - ddof, whereNrepresents the number of elements. By defaultddofis zero.'std'- standard deviation of items within each group. Useddofkwarg for degrees of freedom (seevarabove).'min'- minimum value of items within each group.'max'- maximum value of items within each group.'first'- first item inafrom each group.'last'- last item inafrom each group.'argmax'- the index inaof the maximum value in each group.'argmin'- the index inaof the minimum value in each group.
The above functions also have a nan-form, which skip the nan values instead of propagating them to the result of the calculation:
'nansum','nanprod','nanmean','nanvar','nanstd','nanmin','nanmax','nanfirst','nanlast',nanargmax,nanargmin
The following functions are slightly different in that they always return boolean values. Their treatment of nans is also different from above:
'all'-Trueif all items within a group are truethy. Note thatnp.all(nan)isTrue, i.e.nanis actually truethy.'any'-Trueif any items within a group are truethy.'allnan'-Trueif all items within a group arenan.'anynan'-Trueif any items within a gorup arenan.
The following functions don't reduce the data, but instead produce an output matching the size of the input:
cumsum- cumulative sum of items within each group.cumprod- cumulative product of items within each group. (numba only)cummin- cumulative minimum of items within each group. (numba only)cummax- cumulative maximum of items within each group. (numba only)'sort'- sort the items within each group in ascending order, use reverse=True to invert the order.
Finally, there are three functions which don't reduce each group to a single value, instead they return the full set of items within the group:
'array'- simply returns the grouped items, using the same order as appeared ina. (numpy only)
Compute sums of consecutive integers, and then compute products of those consecutive integers.
group_idx = np.arange(5).repeat(3)
# group_idx: array([0, 0, 0, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4])
a = np.arange(group_idx.size)
# a: array([ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14])
x = npg.aggregate(group_idx, a) # sum is default
# x: array([ 3, 12, 21, 30, 39])
x = npg.aggregate(group_idx, a, 'prod')
# x: array([ 0, 60, 336, 990, 2184])Get variance ignoring nans, setting all-nan groups to nan.
x = npg.aggregate(group_idx, a, func='nanvar', fill_value=nan)Count the number of elements in each group. Note that this is equivalent to doing np.bincount(group_idx),
indeed that is how the numpy implementation does it.
x = npg.aggregate(group_idx, 1)Sum 1000 values into a three-dimensional cube of size 15x15x15. Note that in this example all three dimensions have the same size, but that doesn't have to be the case.
group_idx = np.random.randint(0, 15, size=(3, 1000))
a = np.random.random(group_idx.shape[1])
x = npg.aggregate(group_idx, a, func="sum", size=(15,15,15), order="F")
# x.shape: (15, 15, 15)
# np.isfortran(x): TrueUse a custom function to generate some strings.
group_idx = np.array([1, 0, 1, 4, 1])
a = np.array([12.0, 3.2, -15, 88, 12.9])
x = npg.aggregate(group_idx, a,
func=lambda g: ' or maybe '.join(str(gg) for gg in g), fill_value='')
# x: ['3.2', '12.0 or maybe -15.0 or maybe 12.9', '', '', '88.0']Use the axis arg in order to do a sum-aggregation on three rows simultaneously.
a = np.array([[99, 2, 11, 14, 20],
[33, 76, 12, 100, 71],
[67, 10, -8, 1, 9]])
group_idx = np.array([[3, 3, 7, 0, 0]])
x = npg.aggregate(group_idx, a, axis=1)
# x : [[ 34, 0, 0, 101, 0, 0, 0, 11],
# [171, 0, 0, 109, 0, 0, 0, 12],
# [ 10, 0, 0, 77, 0, 0, 0, -8]]There are multiple implementations of aggregate provided. If you use from numpy_groupies import aggregate,
the best available implementation will automatically be selected. Otherwise you can pick a specific version directly
like from numpy_groupies import aggregate_nb as aggregate or by importing aggregate from the implementing module
from numpy_groupies.aggregate_weave import aggregate.
Currently the following implementations exist:
- numpy - This is the default implementation. It uses plain
numpy, mainly relying onnp.bincountand basic indexing magic. It comes without other dependencies exceptnumpyand shows reasonable performance for the occasional usage. - numba - This is the most performant implementation in average, based on jit compilation provided by numba and LLVM.
- weave -
weavecompiles C-code on demand at runtime, producing binaries that get executed from within python. The performance of this implementation is comparable to the numba implementation. - pure python - This implementation has no dependencies and uses only the standard library. It's horribly slow and should only be used, if there is no numpy available.
- numpy ufunc - Only for benchmarking. This impelmentation uses the
.atmethod of numpy'sufuncs (e.g.add.at), which would appear to be designed for perfoming excactly the same calculation thataggregateexecutes, however the numpy implementation is rather incomplete and slow (as ofv1.14.0). A numpy issue has been created to address this issue. - pandas - Only for reference. The pandas'
groupbyconcept is the same as the task performed byaggregate. However,pandasis not actually faster than the defaultnumpyimplementation. Also, note that there may be room for improvement in the way thatpandasis utilized here. Most notably, when computing multiple aggregations of the same data (e.g.'min'and'max') pandas could potentially be used more efficiently.
All implementations have the same calling syntax and produce the same outputs, to within some floating-point error.
However some implementations only support a subset of the valid inputs and will sometimes throw NotImplementedError.
Scripts for testing and benchmarking are included in this repository. For benchmarking, run
python -m numpy_groupies.benchmarks.generic from the root of this repository.
Below we are using 500,000 indices uniformly picked from [0, 1000). The values of a are uniformly picked from
the interval [0,1), with anything less than 0.2 then set to 0 (in order to serve as falsy values in boolean operations).
For nan- operations another 20% of the values are set to nan, leaving the remainder on the interval [0.2,0.8).
The benchmarking results are given in ms for an i7-7560U running at 2.40GHz:
function ufunc numpy numba pandas
-----------------------------------------------------------------
sum 36.582 1.708 0.859 12.002
prod 37.559 37.864 0.857 11.507
amin 34.394 34.254 0.865 11.711
amax 34.120 33.964 0.899 12.005
len 31.899 1.382 0.733 11.092
all 37.062 3.863 1.048 12.519
any 36.260 5.601 1.048 12.713
anynan 32.514 2.735 0.936 141.092
allnan 34.558 5.611 0.932 151.953
mean ---- 2.603 1.069 12.227
std ---- 4.373 1.126 11.963
var ---- 4.331 1.129 122.625
first ---- 1.946 1.032 11.850
last ---- 1.532 0.742 11.736
argmax ---- 35.397 1.172 346.742
argmin ---- 39.942 1.407 347.679
nansum ---- 5.716 1.942 13.248
nanprod ---- 36.224 1.967 12.585
nanmin ---- 33.229 1.916 13.067
nanmax ---- 32.935 1.965 13.258
nanlen ---- 5.277 1.740 14.426
nanall ---- 7.703 2.201 16.221
nanany ---- 8.984 2.215 15.968
nanmean ---- 6.221 2.024 13.243
nanvar ---- 7.866 1.929 126.689
nanstd ---- 7.945 1.933 13.062
nanfirst ---- 6.015 2.284 15.547
nanlast ---- 5.561 1.675 15.318
nanargmin ---- 42.110 2.357 ----
nanargmax ---- 38.085 2.314 ----
cumsum ---- 106.524 1.313 8.000
cumprod ---- ---- 1.319 11.149
cummax ---- ---- 1.288 11.954
cummin ---- ---- 1.271 11.631
arbitrary ---- 206.623 50.381 131.928
sort ---- 171.702 ---- ----
Linux(x86_64), Python 3.10.4, Numpy 1.22.4, Numba 0.55.2, Pandas 1.4.3
function ufunc numpy numba weave
-----------------------------------------------------------------
sum 30.985 1.684 1.116 1.350
prod 32.553 32.269 0.996 1.172
amin 34.954 34.837 0.989 2.068
amax 34.580 34.695 1.023 2.132
len 30.611 1.342 0.805 1.003
all 36.724 4.355 1.366 1.407
any 34.570 7.181 1.373 1.410
anynan 30.840 2.611 0.986 2.557
allnan 32.463 6.636 0.982 2.562
mean ---- 2.248 0.985 1.191
std ---- 6.532 1.084 1.378
var ---- 6.590 1.086 1.380
first ---- 2.126 1.033 1.132
last ---- 1.592 0.957 1.002
argmax ---- 34.903 1.018 ----
argmin ---- 38.538 0.996 ----
nansum ---- 5.148 1.785 1.335
nanprod ---- 29.445 1.760 1.334
nanmin ---- 31.752 1.992 2.747
nanmax ---- 32.247 2.021 2.802
nanlen ---- 5.099 1.909 1.267
nanall ---- 9.637 1.826 1.375
nanany ---- 10.520 1.830 1.384
nanmean ---- 5.775 2.018 1.430
nanvar ---- 10.171 2.145 1.640
nanstd ---- 10.155 2.163 1.637
nanfirst ---- 5.640 2.201 1.156
nanlast ---- 5.218 1.734 1.137
nanargmin ---- 43.795 1.987 ----
nanargmax ---- 40.354 2.029 ----
cumsum ---- 138.660 1.270 ----
cumprod ---- ---- 1.292 ----
cummax ---- ---- 1.216 ----
cummin ---- ---- 1.205 ----
arbitrary ---- 224.213 80.039 ----
sort ---- 268.514 ---- ----
Linux(x86_64), Python 2.7.18, Numpy 1.16.6, Numba 0.46.0, Weave 0.17.0
This project was started by @ml31415 and the numba and weave implementations are by him. The pure
python and numpy implementations were written by @d1manson.
The authors hope that numpy's ufunc.at methods or some other implementation of aggregate within
numpy or scipy will eventually be fast enough, to make this package redundant.
So far numpy_grpupies can still be run on python2, mainly because weave was never ported to python3.
Ditching python2 support would mean to ditch the weave implementation, which is so far the best competitor in
terms of speed. In order not to lose this benchmarking option, python2 compatibility is likely to stay
for now.