[Traminer-users] How to find frequent sequences.

[Gilbert Ritschard]

Hi Vineet,

From what I understand, you want find substrings rather than subsequences.

Currently, I am in vacancy and do not have access to TraMineR.
But I am quite sure you can find substrings by setting the max gap constraint to one. 
Look at the seqeconstraint function.

Good luck.
Gilbert


WEnvoyé de mon iPad

Le Jul 12, 2012 à 23:22, Vineet Shukla <shuklvineet at gmail.com> a écrit :

> I have independent event sequences for example as follows :
> 
> Independent event sequence   1 : A , B , C , D
> Independent event sequence   2 : A, C , B
> Independent event sequence   3 :D, A, B, X,Y, Z
> Independent event sequence   4 :C,A,A,B
> Independent event sequence   5 :B,A,D
> 
> I want to able to find that most common sequence patters as
> 
> {A, B }  = > 3 
> from lines 1,3,5.
> 
> Pls note that A,C,B must not be considered because C comes in between
> and line 5 also must not be considered because order of A,B is reversed.
> 
> In simple words I am looking for "most frequent independent event sequent" for any length.
> 
> I tried SPADE but it does not work for me because there event sequences are not independent.  
> 
> Pls let me know which R algo/package I can use ?
> 
> 
> Rgds,
> Vineet
> _______________________________________________
> Traminer-users mailing list
> Traminer-users at lists.r-forge.r-project.org
> https://lists.r-forge.r-project.org/cgi-bin/mailman/listinfo/traminer-users
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.r-forge.r-project.org/pipermail/traminer-users/attachments/20120716/d1280390/attachment.html>