Jan-05-2021, 02:00 PM

Hi,

I'm really struggling to find a way to do the following:

Suppose I have two groups of data sets (fictitious in this example):

group_a = [1, 5, 7, 3, 5, 8, 34]

group_b = [1, 2, 4, 3, 5, 8, 45]

group_c = [1, 5, 7, 3, 5, 8, 35]

group_1 = [1, 2, 7, 3, 5, 8, 56]

group_2 = [1, 5, 7, 3, 5, 8, 23]

group_3 = [1, 4, 6, 3, 5, 8, 25]

group_4 = [1, 5, 7, 8, 5, 8, 45]

group_5 = [1, 3, 7, 3, 5, 8, 15]

group_6 = [1, 5, 7, 3, 5, 8, 16]

and I need to perform a Mann Whitney U-test on all possible combinations of the letter and number groups, that is; I want a result for all the following combinations:

(group_a, group_1)

(group_a, group_2)

(group_a, group_3)

(group_a, group_4)

(group_a, group_5)

(group_a, group_6)

(group_b, group_1)

(group_b, group_2)

(group_b, group_3)

(group_b, group_4)

(group_b, group_5)

(group_b, group_6)

(group_c, group_1)

(group_c, group_2)

(group_c, group_3)

(group_c, group_4)

(group_c, group_5)

(group_c, group_6)

(But in reality there are more letter groups and many more number groups).

Is there an efficient way to do this?

Unfortunately I'm quite new to Python and am self taught.

Any advice regarding this would be really appreciated.

Additionally; a lot of my work requires doing comparisons like this, so any suggestions of books, courses, anything at all that would help me with this would also be amazing.

I currently work as a Data Analyst looking to transition into Statistics, (hence I'm trying to perform my regular work to a higher level and trying to use Python as much as I can going forward).

Thanks.

I'm really struggling to find a way to do the following:

Suppose I have two groups of data sets (fictitious in this example):

group_a = [1, 5, 7, 3, 5, 8, 34]

group_b = [1, 2, 4, 3, 5, 8, 45]

group_c = [1, 5, 7, 3, 5, 8, 35]

group_1 = [1, 2, 7, 3, 5, 8, 56]

group_2 = [1, 5, 7, 3, 5, 8, 23]

group_3 = [1, 4, 6, 3, 5, 8, 25]

group_4 = [1, 5, 7, 8, 5, 8, 45]

group_5 = [1, 3, 7, 3, 5, 8, 15]

group_6 = [1, 5, 7, 3, 5, 8, 16]

and I need to perform a Mann Whitney U-test on all possible combinations of the letter and number groups, that is; I want a result for all the following combinations:

(group_a, group_1)

(group_a, group_2)

(group_a, group_3)

(group_a, group_4)

(group_a, group_5)

(group_a, group_6)

(group_b, group_1)

(group_b, group_2)

(group_b, group_3)

(group_b, group_4)

(group_b, group_5)

(group_b, group_6)

(group_c, group_1)

(group_c, group_2)

(group_c, group_3)

(group_c, group_4)

(group_c, group_5)

(group_c, group_6)

(But in reality there are more letter groups and many more number groups).

Is there an efficient way to do this?

Unfortunately I'm quite new to Python and am self taught.

Any advice regarding this would be really appreciated.

Additionally; a lot of my work requires doing comparisons like this, so any suggestions of books, courses, anything at all that would help me with this would also be amazing.

I currently work as a Data Analyst looking to transition into Statistics, (hence I'm trying to perform my regular work to a higher level and trying to use Python as much as I can going forward).

Thanks.