Welcome to OGeek Q&A Community for programmer and developer-Open, Learning and Share
Welcome To Ask or Share your Answers For Others

Categories

0 votes
168 views
in Technique[技术] by (71.8m points)

python - Argmax - differentiate between array having same values and array having largest zeroth component

I am implementing the argmax function form numpy library to get the index of the largest element in a vector. Following is my code.

import numpy as np

a = np.array([2, 0, 0, 0, 0])
idx = np.argmax(a)  # Works fine, returns 0

b = np.array([0, 0, 0, 0, 0])
idx = np.argmax(b)  # Returns 0 again

From the above piece of code, just by looking at idx variable it is impossible to differentiate if the input to argmax was a or b.

My code has a similar setup where I do not know the input data apriori and am allowed to take the argmax of the data I receive. The data can contain entries that are all the same integer values or it can have one maximum value (compared to the rest) in any of the five index positions. When the maximum occurs at the zeroth position, however, the rest of my code fails as I assume that the first index position contains the maximum value.

Is there any other form of argmax in python that can return None (or anything other than 0) to indicate there is no one maximum value in the input data?

question from:https://stackoverflow.com/questions/65944826/argmax-differentiate-between-array-having-same-values-and-array-having-largest

与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…
Welcome To Ask or Share your Answers For Others

1 Reply

0 votes
by (71.8m points)
import numpy as np

a = np.array([2, 0, 0, 0, 0])
idx = np.argmax(a) if ~np.all(a == a[0]) else None
print(idx)  # 0

b = np.array([0, 0, 0, 0, 0])
idx = np.argmax(b) if ~np.all(b == b[0]) else None
print(idx)  # None

# Alternative solution

a = np.array([2, 0, 0, 0, 0])
idx = np.argmax(a) - np.all(a == a[0]).astype(int)
print(idx)  # 0

b = np.array([0, 0, 0, 0, 0])
idx = np.argmax(b) - np.all(b == b[0]).astype(int)
print(idx)  # -1 

与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…
OGeek|极客中国-欢迎来到极客的世界,一个免费开放的程序员编程交流平台!开放,进步,分享!让技术改变生活,让极客改变未来! Welcome to OGeek Q&A Community for programmer and developer-Open, Learning and Share
Click Here to Ask a Question

...