seqedist | R Documentation |
Compute Optimal-Matching-like distances between event sequences. The distance measure is described in Studer et al. 2010.
seqedist(seqe, idcost, vparam, interval="No", norm="YujianBo")
seqe |
An event sequence |
idcost |
Insertion/deletion cost of the different events (one entry per element of the event alphabet). |
vparam |
Positive real. The cost for a one-unit change in the time stamp of an event. |
norm |
Character. One of |
interval |
Character. One of |
a distance matrix.
Matthias Studer
Studer, M., Müller, N.S., Ritschard, G. & Gabadinho, A. (2010), "Classer, discriminer et visualiser des séquences d'événements", In Extraction et gestion des connaissances (EGC 2010), Revue des nouvelles technologies de l'information RNTI. Vol. E-19, pp. 37-48.
Ritschard, G., Bürgin, R., and Studer, M. (2014), "Exploratory Mining of Life Event Histories", In McArdle, J.J. & Ritschard, G. (eds) Contemporary Issues in Exploratory Data Mining in the Behavioral Sciences. Series: Quantitative Methodology, pp. 221-253. New York: Routledge.
data(actcal.tse)
actcal.seqe <- seqecreate(actcal.tse[1:200,])[1:6,]
## We have 8 different events in this dataset
idcost <- rep(1, 8)
dd <- seqedist(actcal.seqe, idcost=idcost, vparam=.1)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.