X
- the class of the elements in the left input sequence.Y
- the class of the elements in the right input sequence.public class StrictDTWFullAlgorithm<X,Y> extends AbstractStrictDTWAlgorithm<X,Y,Alignment>
Constructor and Description |
---|
StrictDTWFullAlgorithm(Comparator<X,Y> comp) |
Modifier and Type | Method and Description |
---|---|
Alignment<X,Y> |
transformToResult(double[][] dtwMatrix,
double[][] repCosts,
double[][] delRepCosts,
double[][] insRepCosts,
List<X> a,
List<Y> b)
This method has to be implemented by sub classes to transform a calculated dynamic
programming matrix to a valid result of that implementation.
|
calculateAlignment, getComparator, getLastDTWMatrix, getResultClass, normalizeDissimilarity, requires, setComparator
public StrictDTWFullAlgorithm(@NonNull Comparator<X,Y> comp)
public Alignment<X,Y> transformToResult(@NonNull double[][] dtwMatrix, @NonNull double[][] repCosts, @NonNull double[][] delRepCosts, @NonNull double[][] insRepCosts, @NonNull List<X> a, @NonNull List<Y> b)
AbstractStrictDTWAlgorithm
transformToResult
in class AbstractStrictDTWAlgorithm<X,Y,Alignment>
dtwMatrix
- a dynamic programming matrix calculated with respect to both input
sequences.repCosts
- the matrix of pairwise REPLACEMENT costs for each pairwise combination of
elements in the input sequences.delRepCosts
- the matrix of pairwise DELETIONREPLACEMENT costs for each pairwise
combination of elements in the input sequences.insRepCosts
- the matrix of pairwise INSERTIONREPLACEMENT costs for each pairwise
combination of elements in the input sequences.a
- the first input sequence.b
- the second input sequence.Copyright (C) 2016-2018 Benjamin Paaßen, AG Theoretical Computer Science, Centre of Excellence Cognitive Interaction Technology (CITEC), University of Bielefeld, licensed under the AGPL v. 3: http://openresearch.cit-ec.de/projects/tcs . This documentation is licensed under the conditions of CC-BY-SA 4.0: https://creativecommons.org/licenses/by-sa/4.0/