Repository navigation
Implement VMSP algorithm (Vertical mining of Maximal Sequential) to measure routineness. #28
Description
From Fournier-Viger et al. (2014b). This is the algorithm that Hansson and Haerem have been using to compute the measures of routineness. It is better than just using n-grams because it excludes substrings that are subsumed withing larger patterns.
Activity
ThreadNet commentedon Dec 1, 2017
I think there is open source code available in Java
http://www.philippe-fournier-viger.com/spmf/
Here is an article about it: http://www.philippe-fournier-viger.com/spmf/VMSP_maximal_sequential_patterns_2014.pdf