Package | Description |
---|---|
de.unibi.citec.tcs.alignment.comparators |
This package contains comparators that define distances between Values.
|
Modifier and Type | Method and Description |
---|---|
double |
DTWKernelComparator.calculateLocalDerivative(int paramIdent,
VectorialValue a,
VectorialValue b,
OperationType type)
TODO: think about opterationType
This is called by an AlignmentDerivativeAlgorithm and should calculate
the local derivative for only one comparison of the values a and b.
|
double |
DTWKernelComparator.compare(VectorialValue a,
VectorialValue b)
This has to return a distance between a and b with the following
restrictions:
The return value has to lie between 0 and 1.
1 means maximum dissimilarity between a and b.
0 means maximum similarity between a and b (especially it should be
true that a = b implies a zero distance).
distance(a,b) should be equal or at least close to
distance(b,a)
Please note that this has to be well-defined, even if an input is null.
|
double |
EuclidianComparator.compare(VectorialValue a,
VectorialValue b)
This has to return a distance between a and b with the following
restrictions:
The return value has to lie between 0 and 1.
1 means maximum dissimilarity between a and b.
0 means maximum similarity between a and b (especially it should be
true that a = b implies a zero distance).
distance(a,b) should be equal or at least close to
distance(b,a)
Please note that this has to be well-defined, even if an input is null.
|
double |
L1NormComparator.compare(VectorialValue a,
VectorialValue b)
This has to return a distance between a and b with the following
restrictions:
The return value has to lie between 0 and 1.
1 means maximum dissimilarity between a and b.
0 means maximum similarity between a and b (especially it should be
true that a = b implies a zero distance).
distance(a,b) should be equal or at least close to
distance(b,a)
Please note that this has to be well-defined, even if an input is null.
|
double |
EuclidianComparator.delete(VectorialValue a)
This should be called during an alignment to retrieve the costs for a
deletion of value a from the first sequence.
|
double |
L1NormComparator.delete(VectorialValue a)
This should be called during an alignment to retrieve the costs for a
deletion of value a from the first sequence.
|
double |
EuclidianComparator.insert(VectorialValue b)
This should be called during an alignment to retrieve the costs for an
insertion of value b into the first sequence.
|
double |
L1NormComparator.insert(VectorialValue b)
This should be called during an alignment to retrieve the costs for an
insertion of value b into the first sequence.
|
double |
EuclidianComparator.skipDelete(VectorialValue a)
This should be called during an alignment to retrieve the costs for a
skip deletion of value a from the first sequence.
|
double |
L1NormComparator.skipDelete(VectorialValue a)
This should be called during an alignment to retrieve the costs for a
skip deletion of value a from the first sequence.
|
double |
EuclidianComparator.skipInsert(VectorialValue b)
This should be called during an alignment to retrieve the costs for a
skip insertion of value b into the first sequence.
|
double |
L1NormComparator.skipInsert(VectorialValue b)
This should be called during an alignment to retrieve the costs for a
skip insertion of value b into the first sequence.
|
Copyright © 2014. All rights reserved.