|
24 | 24 | Create a matrix with the distances between each pair of points of the |
25 | 25 | time series `x` and `y` using `metric`. |
26 | 26 |
|
27 | | -The time series `x` and `y` can be `Dataset`s or matrices with data points in rows. |
| 27 | +The time series `x` and `y` can be `Dataset`s or vectors or matrices with data points |
| 28 | +in rows. |
28 | 29 | The data point dimensions (or number of columns) must be the same for `x` and `y`. |
29 | 30 | The returned value is a `n×m` matrix, with `n` being the length (or number of rows) |
30 | 31 | of `x`, and `m` the length of `y`. |
@@ -97,7 +98,7 @@ The recurrence matrix is a numeric representation of a "recurrence plot" [1, 2], |
97 | 98 | in the form of a sparse square matrix of Boolean values. |
98 | 99 |
|
99 | 100 | `x` must be `Dataset` or a Vector or Matrix with data points in rows |
100 | | -(possibly representing and embedded phase, space; see [`embed`](@ref)). |
| 101 | +(possibly representing and embedded phase space; see [`embed`](@ref)). |
101 | 102 | If `d(x[i], x[j]) ≤ ε` (with `d` the distance function), |
102 | 103 | then the cell `(i, j)` of the matrix will have a `true` |
103 | 104 | value. The criteria to evaluate distances between data points are defined |
@@ -137,7 +138,7 @@ Create a cross recurrence matrix from the time series `x` and `y`. |
137 | 138 |
|
138 | 139 | The cross recurrence matrix is a bivariate extension of the recurrence matrix. |
139 | 140 | For the time series `x`, `y`, of length `n` and `m`, respectively, it is a |
140 | | -sparse `n×m` matrix of Boolean values, such that if `∥x[i] – y[j]∥ ≤ ε`, |
| 141 | +sparse `n×m` matrix of Boolean values, such that if `d(x[i], y[j]) ≤ ε`, |
141 | 142 | then the cell `(i, j)` of the matrix will have a `true` value. |
142 | 143 |
|
143 | 144 | See [`recurrencematrix`](@ref) for details, references and keywords. |
|
0 commit comments