[mlpack-git] (blog) master: Lozhnikov. Week 5. Some fixes. (7702acd)

[gitdub at mlpack.org]

Repository : https://github.com/mlpack/blog
On branch  : master
Link       : https://github.com/mlpack/blog/compare/f8f65d3ca1c67f8e1ac55ffb91528a9624d817da...7702acd3b5039103ea326b726ba9f16a91a4f2df

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

commit 7702acd3b5039103ea326b726ba9f16a91a4f2df
Author: Mikhail Lozhnikov <lozhnikovma at gmail.com>
Date:   Mon Jun 27 18:49:16 2016 +0300

    Lozhnikov. Week 5. Some fixes.


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

7702acd3b5039103ea326b726ba9f16a91a4f2df
 content/blog/LozhnikovWeekFive.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/content/blog/LozhnikovWeekFive.md b/content/blog/LozhnikovWeekFive.md
index 33c1227..4db986b 100644
--- a/content/blog/LozhnikovWeekFive.md
+++ b/content/blog/LozhnikovWeekFive.md
@@ -3,6 +3,6 @@ Date: 2016-06-27 18:30:00
 Tags: gsoc, space trees, R+ tree, R++ tree, Vantage point tree
 Author: Mikhail Lozhnikov
 
-As I had planned in the previous post I did the refactoring of the R+/R++ tree. I added a template parameter SweepType to the RPlusTreeSplit class and implemented a sweep method that tries to partition an intermediate node with the minimum number of splits. All sweep techniques are designed in  tree-independent manner. In order to do that I introduced a template parameter SplitPolicy. This parameter helps to determine the subtree in which we should insert any particular child of an intermediate node that is being split. Also I fixed some errors.
+As I had planned in the previous post I did the refactoring of the R+/R++ tree. I added a template parameter SweepType to the RPlusTreeSplit class and implemented a sweep method that tries to partition an intermediate node with the minimum number of splits. All sweep techniques are designed in a tree-independent manner. In order to do that I introduced a template parameter SplitPolicy. This parameter helps to determine the subtree in which we should insert any particular child of an intermediate node that is being split. Also I fixed some errors.
 
 Moreover, I began the vantage point tree implementation. Right now the split method (VantagePointSplit class) is implemented. I have to implement a piecewise ball boundary type since the BallBound is not suitable for the vantage point tree. Also I did not think about vantage point tree-specific tests.