Gh*_*KU 11 python group-by dataframe pandas
我在熊猫中有数据框:
In [10]: df
Out[10]:
col_a col_b col_c col_d
0 France Paris 3 4
1 UK Londo 4 5
2 US Chicago 5 6
3 UK Bristol 3 3
4 US Paris 8 9
5 US London 44 4
6 US Chicago 12 4
Run Code Online (Sandbox Code Playgroud)
我需要统计独特的城市.我可以数独特的状态
In [11]: df['col_a'].nunique()
Out[11]: 3
Run Code Online (Sandbox Code Playgroud)
我可以尝试数独特的城市
In [12]: df['col_b'].nunique()
Out[12]: 5
Run Code Online (Sandbox Code Playgroud)
但这是错误的,因为法国的美国巴黎和巴黎是不同的城市.所以现在我这样做:
In [13]: df['col_a_b'] = df['col_a'] + ' - ' + df['col_b']
In [14]: df
Out[14]:
col_a col_b col_c col_d col_a_b
0 France Paris 3 4 France - Paris
1 UK Londo 4 5 UK - Londo
2 US Chicago 5 6 US - Chicago
3 UK Bristol 3 3 UK - Bristol
4 US Paris 8 9 US - Paris
5 US London 44 4 US - London
6 US Chicago 12 4 US - Chicago
In [15]: df['col_a_b'].nunique()
Out[15]: 6
Run Code Online (Sandbox Code Playgroud)
也许有更好的方法?无需创建其他列.
WeN*_*Ben 28
通过使用 ngroups
df.groupby(['col_a', 'col_b']).ngroups
Out[101]: 6
Run Code Online (Sandbox Code Playgroud)
或使用 set
len(set(zip(df['col_a'],df['col_b'])))
Out[106]: 6
Run Code Online (Sandbox Code Playgroud)
您可以选择col_a和col_b,删除重复项,然后检查结果数据框的形状/ len:
df[['col_a', 'col_b']].drop_duplicates().shape[0]
# 6
len(df[['col_a', 'col_b']].drop_duplicates())
# 6
Run Code Online (Sandbox Code Playgroud)
因为groupby忽略NaNs,并且可能不必要地调用排序过程,所以如果NaN列中有s ,请相应选择使用哪种方法:
考虑如下数据框:
df = pd.DataFrame({
'col_a': [1,2,2,pd.np.nan,1,4],
'col_b': [2,2,3,pd.np.nan,2,pd.np.nan]
})
print(df)
# col_a col_b
#0 1.0 2.0
#1 2.0 2.0
#2 2.0 3.0
#3 NaN NaN
#4 1.0 2.0
#5 4.0 NaN
Run Code Online (Sandbox Code Playgroud)
时间安排:
df = pd.concat([df] * 1000)
%timeit df.groupby(['col_a', 'col_b']).ngroups
# 1000 loops, best of 3: 625 µs per loop
%timeit len(df[['col_a', 'col_b']].drop_duplicates())
# 1000 loops, best of 3: 1.02 ms per loop
%timeit df[['col_a', 'col_b']].drop_duplicates().shape[0]
# 1000 loops, best of 3: 1.01 ms per loop
%timeit len(set(zip(df['col_a'],df['col_b'])))
# 10 loops, best of 3: 56 ms per loop
%timeit len(df.groupby(['col_a', 'col_b']))
# 1 loop, best of 3: 260 ms per loop
Run Code Online (Sandbox Code Playgroud)
结果:
df.groupby(['col_a', 'col_b']).ngroups
# 3
len(df[['col_a', 'col_b']].drop_duplicates())
# 5
df[['col_a', 'col_b']].drop_duplicates().shape[0]
# 5
len(set(zip(df['col_a'],df['col_b'])))
# 2003
len(df.groupby(['col_a', 'col_b']))
# 2003
Run Code Online (Sandbox Code Playgroud)
差异如此:
选项1:
df.groupby(['col_a', 'col_b']).ngroups
Run Code Online (Sandbox Code Playgroud)
很快,它排除了包含NaNs的行.
选项2和3:
len(df[['col_a', 'col_b']].drop_duplicates())
df[['col_a', 'col_b']].drop_duplicates().shape[0]
Run Code Online (Sandbox Code Playgroud)
合理快速,它认为NaNs是一个独特的价值.
选项4和5:
len(set(zip(df['col_a'],df['col_b'])))
len(df.groupby(['col_a', 'col_b']))
Run Code Online (Sandbox Code Playgroud)
慢,并且它遵循numpy.nan == numpy.nan假的逻辑,因此不同的(nan,nan)行被认为是不同的.