G***G
发帖数: 16778 | 1 suppose the number of items is 4 and the iterms are a, b, c, d.
there are choose (4,2)/2 =3 ways to evenly dive the 6 items.
group 1 group 2
a,b c,d
a,c b,d
a,d b,c
but there should be one division which make the two groups more closer.
how to achive this by programming?
is there any R package for this? | s******s
发帖数: 13035 | 2 什么叫more closer?
【在 G***G 的大作中提到】
: suppose the number of items is 4 and the iterms are a, b, c, d.
: there are choose (4,2)/2 =3 ways to evenly dive the 6 items.
: group 1 group 2
: a,b c,d
: a,c b,d
: a,d b,c
: but there should be one division which make the two groups more closer.
: how to achive this by programming?
: is there any R package for this?
| G***G
发帖数: 16778 | 3 after division, the two groups are not significantly different.
for example
{1,3,7,...}
{2,3,6,...}
There is no significant difference between the two groups above.
【在 s******s 的大作中提到】
: 什么叫more closer?
| c*****g
发帖数: 66 | 4 something like a latin square?
in your example, order a, b, c, and d, then assign them to groups 1, 2, 2, 1.
【在 G***G 的大作中提到】
: suppose the number of items is 4 and the iterms are a, b, c, d.
: there are choose (4,2)/2 =3 ways to evenly dive the 6 items.
: group 1 group 2
: a,b c,d
: a,c b,d
: a,d b,c
: but there should be one division which make the two groups more closer.
: how to achive this by programming?
: is there any R package for this?
|
|
