QuickShiftClusters: Clustering from a QuickShift graph

In benja0x40/QuickShift: QuickShift

Description

Clustering from a QuickShift graph

Usage

QuickShiftClusters(g, n, graph = FALSE, id_by_pop = TRUE, decreasing = TRUE)

Arguments

g	a QuickShift graph resulting from the QuickShiftAlgorithm function.
n	desired number of clusters.
graph	logical value indicating whether the QuickShift graph should be part of the returned results (default = FALSE, no).
id_by_pop	logical value controlling if cluster identifiers should follow the order of population sizes (default = TRUE, yes).
decreasing	logical value indicating if population sizes should be in decreasing (default = TRUE, yes) or increasing order, when the argument id_by_pop is TRUE.

Value

This function returns a list with the following elements:

membership	vector of integers in [1, nclust] indicating to which cluster each observation belongs.
csizes	number of observations in each cluster.
nclust	number of clusters.

And optionally:

graph

the QuickShift graph (see QuickShiftAlgorithm).

See Also

QuickShift, MatchClusters

benja0x40/QuickShift documentation built on Jan. 22, 2021, 7:43 p.m.