powered by
Function which finds the furthest sum points in order to be used as initial solution in archetypal analysis.
find_furthestsum_points(df, kappas, nfurthest = 100, nworkers = NULL, sortrows = TRUE, doparallel = TRUE)
The data frame with dimensions n x d
The number of archetypes
The number of applications for FurthestSum algorithm
The number of logical processors that will be used. Hint: set it such that nfurthest can be an exact multiple of nworkers.
nfurthest
nworkers
If it is TRUE, then rows will be sorted
If it is set to TRUE, then parallel processing will be performed for the nfurthest applications of algorithm
A list with members:
outmost, the first kappas furthest sum points as rows of data frame
outmostall, all the furthest sum points that have been found as rows of data frame
outmostfrequency, a matrix with frequency and cumulative frequency for furthest sum rows
FurthestSum
# NOT RUN { data("wd3") #3D demo df = wd3 yy = find_furthestsum_points(df, kappas = 4, nfurthest = 10, nworkers = 2) yy$outmost yy$outmostall yy$outmostfrequency # }
Run the code above in your browser using DataLab