In the previous sections, we saw how to access and modify portions of arrays using simple indices (e.g.,
arr), slices (e.g.,
arr[:5]), and Boolean masks (e.g.,
arr[arr > 0]).
In this section, we'll look at another style of array indexing, known as fancy indexing.
Fancy indexing is like the simple indexing we've already seen, but we pass arrays of indices in place of single scalars.
This allows us to very quickly access and modify complicated subsets of an array's values.
Fancy indexing is conceptually simple: it means passing an array of indices to access multiple array elements at once. For example, consider the following array:
[51 92 14 71 60 20 82 86 74 74]
Suppose we want to access three different elements. We could do it like this:
[71, 86, 14]
Alternatively, we can pass a single list or array of indices to obtain the same result:
array([71, 86, 60])
When using fancy indexing, the shape of the result reflects the shape of the index arrays rather than the shape of the array being indexed:
array([[71, 86], [60, 20]])
Fancy indexing also works in multiple dimensions. Consider the following array:
array([[ 0, 1, 2, 3], [ 4, 5, 6, 7], [ 8, 9, 10, 11]])
Like with standard indexing, the first index refers to the row, and the second to the column:
array([ 2, 5, 11])
Notice that the first value in the result is
X[0, 2], the second is
X[1, 1], and the third is
The pairing of indices in fancy indexing follows all the broadcasting rules that were mentioned in Computation on Arrays: Broadcasting.
So, for example, if we combine a column vector and a row vector within the indices, we get a two-dimensional result:
array([[ 2, 1, 3], [ 6, 5, 7], [10, 9, 11]])
Here, each row value is matched with each column vector, exactly as we saw in broadcasting of arithmetic operations. For example:
array([[0, 0, 0], [2, 1, 3], [4, 2, 6]])
It is always important to remember with fancy indexing that the return value reflects the broadcasted shape of the indices, rather than the shape of the array being indexed.
For even more powerful operations, fancy indexing can be combined with the other indexing schemes we've seen:
[[ 0 1 2 3] [ 4 5 6 7] [ 8 9 10 11]]
We can combine fancy and simple indices:
array([10, 8, 9])
We can also combine fancy indexing with slicing:
array([[ 6, 4, 5], [10, 8, 9]])
And we can combine fancy indexing with masking:
array([[ 0, 2], [ 4, 6], [ 8, 10]])
All of these indexing options combined lead to a very flexible set of operations for accessing and modifying array values.
One common use of fancy indexing is the selection of subsets of rows from a matrix. For example, we might have an by matrix representing points in dimensions, such as the following points drawn from a two-dimensional normal distribution:
Using the plotting tools we will discuss in Introduction to Matplotlib, we can visualize these points as a scatter-plot:
Let's use fancy indexing to select 20 random points. We'll do this by first choosing 20 random indices with no repeats, and use these indices to select a portion of the original array:
array([93, 45, 73, 81, 50, 10, 98, 94, 4, 64, 65, 89, 47, 84, 82, 80, 25, 90, 63, 20])
Now to see which points were selected, let's over-plot large circles at the locations of the selected points:
This sort of strategy is often used to quickly partition datasets, as is often needed in train/test splitting for validation of statistical models (see Hyperparameters and Model Validation), and in sampling approaches to answering statistical questions.
Just as fancy indexing can be used to access parts of an array, it can also be used to modify parts of an array. For example, imagine we have an array of indices and we'd like to set the corresponding items in an array to some value:
[ 0 99 99 3 99 5 6 7 99 9]
We can use any assignment-type operator for this. For example:
[ 0 89 89 3 89 5 6 7 89 9]
Notice, though, that repeated indices with these operations can cause some potentially unexpected results. Consider the following:
[ 6. 0. 0. 0. 0. 0. 0. 0. 0. 0.]
Where did the 4 go? The result of this operation is to first assign
x = 4, followed by
x = 6.
The result, of course, is that
x contains the value 6.
Fair enough, but consider this operation:
array([ 6., 0., 1., 1., 1., 0., 0., 0., 0., 0.])
You might expect that
x would contain the value 2, and
x would contain the value 3, as this is how many times each index is repeated. Why is this not the case?
Conceptually, this is because
x[i] += 1 is meant as a shorthand of
x[i] = x[i] + 1.
x[i] + 1 is evaluated, and then the result is assigned to the indices in x.
With this in mind, it is not the augmentation that happens multiple times, but the assignment, which leads to the rather nonintuitive results.
So what if you want the other behavior where the operation is repeated? For this, you can use the
at() method of ufuncs (available since NumPy 1.8), and do the following:
[ 0. 0. 1. 2. 3. 0. 0. 0. 0. 0.]
at() method does an in-place application of the given operator at the specified indices (here,
i) with the specified value (here, 1).
Another method that is similar in spirit is the
reduceat() method of ufuncs, which you can read about in the NumPy documentation.
You can use these ideas to efficiently bin data to create a histogram by hand.
For example, imagine we have 1,000 values and would like to quickly find where they fall within an array of bins.
We could compute it using
ufunc.at like this:
The counts now reflect the number of points within each bin–in other words, a histogram:
Of course, it would be silly to have to do this each time you want to plot a histogram.
This is why Matplotlib provides the
plt.hist() routine, which does the same in a single line:
This function will create a nearly identical plot to the one seen here.
To compute the binning,
matplotlib uses the
np.histogram function, which does a very similar computation to what we did before. Let's compare the two here:
NumPy routine: 10000 loops, best of 3: 97.6 µs per loop Custom routine: 10000 loops, best of 3: 19.5 µs per loop
Our own one-line algorithm is several times faster than the optimized algorithm in NumPy! How can this be?
If you dig into the
np.histogram source code (you can do this in IPython by typing
np.histogram??), you'll see that it's quite a bit more involved than the simple search-and-count that we've done; this is because NumPy's algorithm is more flexible, and particularly is designed for better performance when the number of data points becomes large: