| 1 |
|
| 2 |
|
| 3 |
mcxarray speed up using metric inequality: |
| 4 |
The choice of reference objects, from which all object distances will be |
| 5 |
calculated, can vary in different approaches. Examples of metric trees include |
| 6 |
the Vantage Point (VP) tree (Yianilos, 1992), M-tree (Ciaccia et al., 1997) |
| 7 |
and GNAT (Brin, 1995). All variations of such trees, exploit the distances to |
| 8 |
the reference points in conjunction with the triangle inequality to prune |
| 9 |
parts of the tree, where no closer matches (to the ones already discovered) |
| 10 |
can be found. A recent use of VP-trees for time-series search under Euclidean |
| 11 |
distance using compressed Fourier descriptors can be found in (Vlachos et al., |
| 12 |
2004). |
| 13 |
|
| 14 |
mcxtest utilised a flat collection of vantage points. |
| 15 |
Incorporating a tree might add significant power? |
| 16 |
|