seqedist: Distances between event sequences

View source: R/seqedist.R

seqedistR Documentation

Distances between event sequences

Description

Compute Optimal-Matching-like distances between event sequences. The distance measure is described in Studer et al. 2010.

Usage

seqedist(seqe, idcost, vparam, interval="No", norm="YujianBo")

Arguments

seqe

An event sequence seqelist object as defined by the seqecreate function.

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 "YujianBo" (respects triangle inequality), "max" (maximum distance) or "none".

interval

Character. One of "No" (absolute ages), "previous" (time spent since previous event) or "next" (time spent until next event).

Value

a distance matrix.

Author(s)

Matthias Studer

References

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.

Examples

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)

TraMineRextras documentation built on Aug. 19, 2024, 3:02 p.m.