PATN’s convergence to the requested number of groups in non-hierarchical classification can be sensitive to starting conditions. In some cases, the exact number of groups cannot be achieved. This usually means that the requested number sits on an unstable point.
Requesting a different number of groups changes the scenario for the first phase, usually resulting in PATn generating a different suite of seed objects. This condition can certainly result in generating the number of groups you originaly requested.
We use a ‘branch and bound’ algorithm to try and converge on your selected number of groups. This usually ‘works’, but in the real world, there are no guarantees that it will converge to your requested number.
We will however see if we can improve the convergence.