hak*_*ode 10 python dataframe pandas cumsum
我有一个如下数据框:
A B C
1 1 1
2 0 1
3 0 0
4 1 0
5 0 1
6 0 0
7 1 0
Run Code Online (Sandbox Code Playgroud)
我希望在df['B']以下条件下出现零的数量:
if(df['B']<df['C']):
#count number of zeroes in df['B'] until it sees 1.
Run Code Online (Sandbox Code Playgroud)
预期输出:
A B C output
1 1 1 Nan
2 0 1 1
3 0 0 Nan
4 1 0 Nan
5 0 1 1
6 0 1 0
7 1 0 Nan
Run Code Online (Sandbox Code Playgroud)
我不知道如何计算计数部分。任何帮助都非常感谢
在反向系列中使用一些遮罩和groupby。假设二进制数据(仅0和1)
m = df['B'][::-1].eq(0)
d = m.groupby(m.ne(m.shift()).cumsum()).cumsum().sub(1)
d[::-1].where(df['B'] < df['C'])
Run Code Online (Sandbox Code Playgroud)
0 NaN
1 1.0
2 NaN
3 NaN
4 1.0
5 0.0
6 NaN
Name: B, dtype: float64
Run Code Online (Sandbox Code Playgroud)
快速numpy的方法
def zero_until_one(a, b):
n = a.shape[0]
x = np.flatnonzero(a < b)
y = np.flatnonzero(a == 1)
d = np.searchsorted(y, x)
r = y[d] - x - 1
out = np.full(n, np.nan)
out[x] = r
return out
zero_until_one(df['B'], df['C'])
Run Code Online (Sandbox Code Playgroud)
array([nan, 1., nan, nan, 1., 0., nan])
Run Code Online (Sandbox Code Playgroud)
性能
df = pd.concat([df]*10_000)
%timeit chris1(df)
19.3 ms ± 348 µs per loop (mean ± std. dev. of 7 runs, 100 loops each)
%timeit yatu(df)
12.8 ms ± 54.3 µs per loop (mean ± std. dev. of 7 runs, 100 loops each)
%timeit zero_until_one(df['B'], df['C'])
2.32 ms ± 31.3 µs per loop (mean ± std. dev. of 7 runs, 100 loops each)
Run Code Online (Sandbox Code Playgroud)
IIUC的一种方法是使用自定义石斑鱼,并与groupby.cumcount以下各项进行汇总:
c1 = df.B.lt(df.C)
g = df.B.eq(1).cumsum()
df['out'] = c1.groupby(g).cumcount(ascending=False).shift().where(c1).sub(1)
Run Code Online (Sandbox Code Playgroud)
print(df)
A B C out
0 1 1 1 NaN
1 2 0 1 1.0
2 3 0 0 NaN
3 4 1 0 NaN
4 5 0 1 1.0
5 6 0 1 0.0
6 7 1 0 NaN
Run Code Online (Sandbox Code Playgroud)