[mlpack-git] (blog) master: Lozhnikov, week 3 (ec7eaf5)

[gitdub at mlpack.org]

Repository : https://github.com/mlpack/blog
On branch  : master
Link       : https://github.com/mlpack/blog/compare/2b5d7023043b36e8176ee8cdfa606e56c26e9c17...ec7eaf5f870e7a7d7872a844e10f66dd3c650cb1

>---------------------------------------------------------------

commit ec7eaf5f870e7a7d7872a844e10f66dd3c650cb1
Author: Mikhail Lozhnikov <lozhnikovma at gmail.com>
Date:   Mon Jun 13 10:33:04 2016 +0300

    Lozhnikov, week 3


>---------------------------------------------------------------

ec7eaf5f870e7a7d7872a844e10f66dd3c650cb1
 content/blog/LozhnikovWeekThree.md | 10 ++++++++++
 1 file changed, 10 insertions(+)

diff --git a/content/blog/LozhnikovWeekThree.md b/content/blog/LozhnikovWeekThree.md
new file mode 100644
index 0000000..d13866a
--- /dev/null
+++ b/content/blog/LozhnikovWeekThree.md
@@ -0,0 +1,10 @@
+Title: Implementation of tree types : Week 3
+Date: 2016-06-13 10:30:00
+Tags: gsoc, space trees, dual-tree algorithms, single-tree algorithms
+Author: Mikhail Lozhnikov
+
+As I had planned in the previous post I modified base cases and pruning rules for the neighbor search method, the range search algorithm and the k rank-approximate-nearest-neighbors search method.
+
+In order to do that I had to modify the RectangleTree traversal algorithms. Since the methods described above represent results as a vector of the indices of points in the dataset I had to implement an approach for calculating the index for any particular point in the tree.
+
+Also I started working on the implementation of the R+ tree.