joseph.lizier
|
32c062f880
|
Inlining norms in Nearest Neighbour search classes, and adding methods to return Collections of points within ranges
|
2014-10-31 12:02:54 +00:00 |
|
joseph.lizier
|
6ade6d4311
|
Adding fast nearest neighbour searcher for univariate data (uses only a sorted array rather than whole k-d tree). Adds an abstract nearest neighbour searcher so calling classes don't necessarily need to know whether they're dealing with uni or multi-variates. MI and conditional MI Kraskov altered to use this where possible.
|
2014-10-30 04:04:16 +00:00 |
|
joseph.lizier
|
9c05f4693a
|
Fixes issue 32 -- adds fast neighbour search to Kraskov conditional MI calculators (and by implication to TE calculators). Requires adding a neighbour search within different radii for each variable to the k-d tree class.
|
2014-10-15 10:36:58 +00:00 |
|
joseph.lizier
|
bc2783b971
|
Fixes issue 31 -- implementing fast nearest neighbour search for Kraskov MI using a k-d tree structure.
|
2014-10-15 04:48:09 +00:00 |