LcssTslearn
Longest Common Subsequence similarity distance, from tslearn.
Quickstart
from sktime.dists_kernels.lcss import LcssTslearn
estimator = LcssTslearn(eps=1.0, global_constraint=None, sakoe_chiba_radius=None, itakura_max_slope=None)Parameters(4)
- epsfloat (default: 1.)
- Maximum matching distance threshold.
- global_constraint{“itakura”, “sakoe_chiba”} or None (default: None)
- Global constraint to restrict admissible paths for DTW.
- sakoe_chiba_radiusint or None (default: None)
Radius to be used for Sakoe-Chiba band global constraint. If None and
global_constraintis set to"sakoe_chiba", a radius of 1 is used. If bothsakoe_chiba_radiusanditakura_max_slopeare set,global_constraintis used to infer which constraint to use among the two. In this case, ifglobal_constraintcorresponds to no global constraint, aRuntimeWarningis raised and no global constraint is used.- itakura_max_slopefloat or None (default: None)
Maximum slope for the Itakura parallelogram constraint. If None and
global_constraintis set to"itakura", a maximum slope of 2 is used. If bothsakoe_chiba_radiusanditakura_max_slopeare set,global_constraintis used to infer which constraint to use among the two. In this case, ifglobal_constraintcorresponds to no global constraint, aRuntimeWarningis raised and no global constraint is used.
References
- [1 ] M. Vlachos, D. Gunopoulos, and G. Kollios. 2002. “Discovering Similar Multidimensional Trajectories”, In Proceedings of the 18th International Conference on Data Engineering (ICDE ‘02). IEEE Computer Society, USA, 673.