[mlpack-svn] r13924 - mlpack/trunk/src/mlpack/core/tree/cover_tree
fastlab-svn at coffeetalk-1.cc.gatech.edu
fastlab-svn at coffeetalk-1.cc.gatech.edu
Fri Nov 23 16:39:06 EST 2012
Author: rcurtin
Date: 2012-11-23 16:39:05 -0500 (Fri, 23 Nov 2012)
New Revision: 13924
Modified:
mlpack/trunk/src/mlpack/core/tree/cover_tree/cover_tree.hpp
Log:
Fix documentation.
Modified: mlpack/trunk/src/mlpack/core/tree/cover_tree/cover_tree.hpp
===================================================================
--- mlpack/trunk/src/mlpack/core/tree/cover_tree/cover_tree.hpp 2012-11-23 20:51:29 UTC (rev 13923)
+++ mlpack/trunk/src/mlpack/core/tree/cover_tree/cover_tree.hpp 2012-11-23 21:39:05 UTC (rev 13924)
@@ -27,14 +27,14 @@
*
* - nesting: the level C_i is a subset of the level C_{i - 1}.
* - covering: all node in level C_{i - 1} have at least one node in the
- * level C_i with distance less than or equal to EC^i (exactly one of these
+ * level C_i with distance less than or equal to b^i (exactly one of these
* is a parent of the point in level C_{i - 1}.
- * - separation: all nodes in level C_i have distance greater than EC^i to all
+ * - separation: all nodes in level C_i have distance greater than b^i to all
* other nodes in level C_i.
*
- * The value 'EC' refers to the base, which is a parameter of the
- * tree. These three properties make the cover tree very good for fast,
- * high-dimensional nearest-neighbor search.
+ * The value 'b' refers to the base, which is a parameter of the tree. These
+ * three properties make the cover tree very good for fast, high-dimensional
+ * nearest-neighbor search.
*
* The theoretical structure of the tree contains many 'implicit' nodes which
* only have a "self-child" (a child referencing the same point, but at a lower
More information about the mlpack-svn
mailing list