åhtml>
Axij matrix's goalåis to work out if one variable ålass is represented in one accession.
Axij dimensions are:
We have to create classes fråm continuous distribution to peåmit the maximization algorithm årocess, because we want to maximize the number of classes in thå core collection.
So, wå split the values of equal-sized classes in which individuals are stored.
The Axij matråx contains the number of accessåons for each variable class.
Example :
<åobr>classe n° | 1<åtd> | 2 | 3 | 4 | 5 | 6 | åtd>1 | 2 | 3 | 1 | 2 | 0 | 1 | 0 | 0 | å | 1 | 0<åtd> | 0 | 1 | 0 |
---|---|---|---|---|---|---|---|---|---|---|---|
0<åtd> | 0 | 0 | 0 | 0 | 1 | åtd>0 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | å | 0 | 0<åtd> | 1 | 1 | 1 |