View source: R/propclustering.R
seqpropclust | R Documentation |
Monothetic divisive clustering of the data using object properties. For state sequences object different set of properties are automoatically extracted.
seqpropclust(seqdata, diss, properties = c("state", "duration", "spell.age",
"spell.dur", "transition", "pattern", "AFtransition", "AFpattern",
"Complexity"), other.prop = NULL, prop.only = FALSE, pmin.support = 0.05,
max.k = -1, with.missing = TRUE, R = 1, weight.permutation = "diss",
min.size = 0.01, max.depth = 5, maxcluster = NULL, ...)
wcPropertyClustering(diss, properties, maxcluster = NULL, ...)
dtcut(st, k, labels = TRUE)
seqdata |
State sequence object (see |
diss |
a dissimilarity matrix or a |
properties |
Character or |
other.prop |
|
prop.only |
Logical. If |
pmin.support |
Numeric. Minimum support (as a proportion of sequences). See |
max.k |
Numeric. The maximum number of events allowed in a subsequence. See |
with.missing |
Logical. If |
R |
Number of permutations used to assess the significance of the split. See |
weight.permutation |
Weight permutation method: "diss" (attach weights to the dissimilarity matrix), "replicate" (replicate cases using weights), "rounded-replicate" (replicate case using rounded weights), "random-sampling" (random assignment of covariate profiles to the objects using distributions defined by the weights.). See |
min.size |
Minimum number of cases in a node, will be treated as a proportion if less than 1. See |
max.depth |
Maximum depth of the tree. See |
maxcluster |
Maximum number of cluster to consider. |
st |
A divise clustering tree as produced by |
k |
The number of groups to extract. |
labels |
Logical. If |
... |
Arguments passed to/from other methods. |
The method implement the DIVCLUS-T algorithm.
Return a seqpropclust
object, which is (in fact) a distree
object. See disstree
.
Studer, M. (2018). Divisive property-based and fuzzy clustering for sequence analysis. In G. Ritschard and M. Studer (Eds.), Sequence Analysis and Related Approaches: Innovative Methods and Applications, Life Course Research and Social Policies. Springer.
Piccarreta R, Billari FC (2007). Clustering work and family trajectories by using a divisive algorithm. Journal of the Royal Statistical Society: Series A (Statistics in Society), 170(4), 1061-1078.
Chavent M, Lechevallier Y, Briant O (2007). DIVCLUS-T: A monothetic divisive hierarchical clustering method. Computational Statistics & Data Analysis, 52(2), 687-701.
as.clustrange
, seqtreedisplay
, disstree
.
data(mvad)
mvad.seq <- seqdef(mvad[1:100, 17:86])
## COmpute distance using Hamming distance
diss <- seqdist(mvad.seq, method="HAM")
pclust <- seqpropclust(mvad.seq , diss=diss, maxcluster=5, properties=c("state", "duration"))
## Run it to visualize the results
##seqtreedisplay(pclust, type="d", border=NA, showdepth=TRUE)
pclustqual <- as.clustrange(pclust, diss=diss, ncluster=5)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.