Hello,

I would like to know if an algorithm that finds the closed sequential patterns with gap constrains (or with no gap allowed at all) is available. Something like VMSP does for maximal sequencial patterns.

Thanks in advance for your answer,
Regards.

Hello,

Yes, there exists a few algorithms for mining closed sequential patterns with gap constraints. In SPMF, you would need to use the Fournier08-closed+time algorithm to get that. That algorithms actually is designed to work with timestamps but if you set all the timestamps to 0, it should do what you want.

This is the example from the documentation:

http://www.philippe-fournier-viger.com/spmf/ClosedSequentialPatterns_TimeConstraints.php

However, this algorithm is based on BIDE. It is possible that in some cases it misses some patterns if you have multiple items per itemesets, as there was bug in the BIDE implementation.

Best,



Edited 2 time(s). Last edit at 06/05/2018 04:41PM by webmasterphilfv.

Hello,

Thank you very much for your answer.

Fournier08-Closed+time works well for my purposes since I never have multiple items per itemsets. I had to use consecutive numbers as timestamps to manage the gaps and off course set the max time interval to 1.

Regards,

Dear Sandra,

Very happy to hear that it works well. :-)

Best regards,