|
|
Cityblock distance of two coordinate float sequences
-
s1
:
^a seq
-
-
s2
:
^a seq
-
-
Returns:
float
-
|
|
|
Cityblock distance of two coordinate float sequences
-
s1
:
float seq
-
-
s2
:
float seq
-
-
Returns:
float
-
|
|
|
"Dissimilarity" uses 1. - pearsons correlation coefficient
-
v1
:
^a seq
-
v2
:
^a seq
-
Returns:
float
|
|
|
Euclidean distance of two coordinate sequences
-
s1
:
^a seq
-
-
s2
:
^a seq
-
-
Returns:
'c
-
|
|
|
Euclidean distance of two coordinate float sequences (ignores nan)
-
s1
:
float seq
-
-
s2
:
float seq
-
-
Returns:
float
-
|
|
|
Squared Euclidean distance of two coordinate float sequences (ignores nan)
-
s1
:
float seq
-
-
s2
:
float seq
-
-
Returns:
float
-
|
|
|
Calculates Hamming distance of two coordinate items
-
s1
:
'a
-
first sequence
-
s2
:
'a
-
second sequence
-
Returns:
int
-
Hamming distance between elements of given sequences
// e.g. s1 and s2 initialization
let s1 = seq {1; 2; 3}
let s2 = seq {9; 2; 3}
// Apply the hamming to s1 and s2
hamming s1 s2
val s1: int seq
Multiple items
val seq: sequence: 'T seq -> 'T seq
--------------------
type 'T seq = System.Collections.Generic.IEnumerable<'T>
val s2: int seq
|
|
|
The [Minkowski distance](https://en.wikipedia.org/wiki/Minkowski_distance) between two sequence of order `p`.
-
s1
:
^a seq
-
first sequence
-
s2
:
^a seq
-
second sequence
-
p
:
float
-
float constrained to `p > 0`
-
Returns:
float option
-
Minkowski distance between elements of given sequences. Returns NaN if sequences contain NaN.
// e.g. a1 and a2 initialization
let s1 = seq { 3.14; 2.0; 3.1 }
let s2 = { 9.1; 2.5; 3.7 }
// Apply the minkowski distance to s1 and s2
minkowski s1 s2 3
val s1: float seq
Multiple items
val seq: sequence: 'T seq -> 'T seq
--------------------
type 'T seq = System.Collections.Generic.IEnumerable<'T>
val s2: obj
|
|
|
The [Minkowski distance](https://en.wikipedia.org/wiki/Minkowski_distance) between two sequences (ignores NaN) of order `p`.
Non-regular differences between the sequences are ignored.
The two sequences need not have equal lengths: when one sequence is exhausted any remaining elements in the other sequence are ignored.
first sequence
second sequence
float constrained to `p > 0`
Minkowski distance between elements of given sequences.
// e.g. a1 and a2 initialization
let s1 = seq { 3.14; 2.0; 3.1 }
let s2 = { 9.1; 2.5; 3.7 }
// Apply the minkowski distance to s1 and s2
minkowskiNaN s1 s2 3
-
s1
:
^a seq
-
s2
:
^a seq
-
p
:
float
-
Returns:
float option
|
|
|
Levenshtein distance between
-
s
:
string
-
-
t
:
string
-
-
Returns:
int
-
|
FSharp.Stats