tucker {CA3variants}R Documentation

Tucker3 decomposition of the three-way table.

Description

The Tucker3 model, originally proposed by psychologist Ledyard R. Tucker, involves the computation of principal components, which are derived for each of the three categorical variables, and of the core array which is akin to the generalised correlations between these components. The function represents the heart of the Tuckals3 algorithm to perform the Tucker3 decomposition of the three-way array x.

Usage

tucker(x, p, q, r, test = 10^-6)

Arguments

x

The three-way contingency table.

p

The number of components of the first mode.

q

The number of components of the second mode.

r

The number of components of the third mode.

test

The treshold used in the algorithm.

Details

The function tucker is utilised from the functions ca3basic, nsca3basic and oca3basic.

Value

a

The final component derived from the Tucker3 decomposition for the first mode.

b

The final component derived from the Tucker3 decomposition for the second mode.

cc

The final component derived from the Tucker3 decomposition for the third mode.

g

The core array.

x

The three-way contingency table.

cont

The number of iterations that are required for the Tucker3 algorithm to converge.

Author(s)

Rosaria Lombardo, Eric J Beh.

References

Beh EJ and Lombardo R (2014). Correspondence Analysis, Theory, Practice and New Strategies. John Wiley & Sons.


[Package CA3variants version 3.0 Index]