[mlpack-git] (blog) master: Lozhnikov, week 11. Fixed an error. (8be88ce)
gitdub at mlpack.org
gitdub at mlpack.org
Wed Aug 10 04:16:26 EDT 2016
Repository : https://github.com/mlpack/blog
On branch : master
Link : https://github.com/mlpack/blog/compare/12cc51a1222032441916efcf491aab52f90bbcfa...8be88ce1b8524e97cb9703b236e8b105e7f31be6
>---------------------------------------------------------------
commit 8be88ce1b8524e97cb9703b236e8b105e7f31be6
Author: Mikhail Lozhnikov <lozhnikovma at gmail.com>
Date: Wed Aug 10 11:16:26 2016 +0300
Lozhnikov, week 11. Fixed an error.
>---------------------------------------------------------------
8be88ce1b8524e97cb9703b236e8b105e7f31be6
content/blog/LozhnikovWeekEleven.md | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/content/blog/LozhnikovWeekEleven.md b/content/blog/LozhnikovWeekEleven.md
index f9a6352..6f8ff57 100644
--- a/content/blog/LozhnikovWeekEleven.md
+++ b/content/blog/LozhnikovWeekEleven.md
@@ -12,7 +12,7 @@ I made some minor fixes of random projection trees and wrote a simple test that
I fixed a problem in the address-to-point conversion method. The method had led to wrong results if some addresses correspond to negative numbers. Moreover, since floating point data types have some excess information, some addresses correspond to infinite points. Thus, I have to add some restrictions in the conversion algorithm.
### Vantage point tree
-I implemented a method that tries to get a tighter bound by investigating the parent bound. The method calculates the distance to the "corner" (the intersection of two (n-1)-dimensional spheres that is an (n-2)-dimensional sphere) using properties of orthogonal transforms. The results appears to be worse since this calculation requires too many arithmetic operations and the number of base cases has decreased slightly.
+I implemented a method that tries to get a tighter bound by investigating the parent bound. The method calculates the distance to the "corner" (the intersection of two (n-1)-dimensional spheres that is an (n-2)-dimensional sphere) using properties of orthogonal transforms. The results appear to be worse since this calculation requires too many arithmetic operations and the number of base cases has decreased slightly.
### Hollow hyperrectangle vantage point tree
I implemented a bound that consists of an outer rectangle and a number of rectangular hollows. I tried to test the vantage point tree with this bound. Right now, the original VP-tree bound outperforms this one, but I think the hollow-hrect bound should work faster. So, I'll continue working on the optimization of the bound.
More information about the mlpack-git
mailing list