JTree_Basis {treelet}R Documentation

Calculate the basis for the Jacobi tree algorithm (one or more iterations)

Description

calls function "flip"

Usage

JTree_Basis(Zpos, T, PCidx, maxlev, all_nodes)

Arguments

Zpos positions of the two clusters merged; number between 1 and d (the length of the comp vector)
T Element in the list array contains a 2-by-2 rot matrix
PCidx ID of prinicipal components; [1 2] or [2 1]
maxlev default: dim-1 (levels L=0,1,2,...,maxlevel)
all_nodes node labels

Value

~Describe the value returned

basis Basis functions entered ROW-WISE — coarse-to-fine where m is the dimension of the data
sums Part of basis funcs of subspaces V1,...,V_{m-1}—- entered rowwise (fine-to-coarse)
difs Basis funcs of subspaces W1,...,W_{m-1}—- entered rowwise (fine-to-coarse)

Author(s)

Ann Lee, Di Liu


[Package treelet version 0.1-0 Index]