cabootcrs (version 2.1.0)

rearrange_old: Old and rubbish algorithm to rearrange bootstrap axes by comparing to sample axes

Description

rearrange_old compares one set of axes for row points and column points (from the bootstrap data matrix) to another (from the sample data matrix) by looking at all possible reorderings and reflections (only) of the bootstrap axes and picking the one which best matches the sample axes.

Usage

rearrange_old(RS, RB, CS, CB, r)

Arguments

RS

Sample axes for row points (as columns)

RB

Bootstrap axes for row points (as columns)

CS

Sample axes for column points (as columns)

CB

Bootstrap axes for column points (as columns)

r

Rank of the bootstrap matrix

Value

list containing: T = matrix to rearrange xB so it is equivalent to xS, i.e. xS <- xB * T numre = number of axes checked for rearranging = min(r,maxrearrange) match = assign$objval from the Hungarian algorithm same = flag for whether there was no reordering of axes (but may have been reflection)

Details

This is only intended for internal use by the cabootcrs function, and only for simple CA if for some reason the lpSolve package is unavailable.

It has not been used with MCA, and so will almost certainly not work properly in that case.

Finds the rearrangement of columns of RB and CB to maximise match = tr( abs(RS'*RB + CS'*CB) )

Goes through all possible orderings and so is painfully slow.

See Also

cabootcrs-package, cabootcrs, rearrange

Examples

# NOT RUN {
# Not intended for direct call by users

# }