[mlpack-svn] r16379 - mlpack/trunk/doc/tutorials/neighbor_search

[fastlab-svn at coffeetalk-1.cc.gatech.edu]

Author: rcurtin
Date: Tue Mar 25 10:03:12 2014
New Revision: 16379

Log:
Don't use the squared Euclidean distance.


Modified:
   mlpack/trunk/doc/tutorials/neighbor_search/neighbor_search.txt

Modified: mlpack/trunk/doc/tutorials/neighbor_search/neighbor_search.txt
==============================================================================
--- mlpack/trunk/doc/tutorials/neighbor_search/neighbor_search.txt	(original)
+++ mlpack/trunk/doc/tutorials/neighbor_search/neighbor_search.txt	Tue Mar 25 10:03:12 2014
@@ -209,7 +209,7 @@
 distance.
 
 @code
-typedef NeighborSearch<NearestNeighborSort, metric::SquaredEuclideanDistance>
+typedef NeighborSearch<NearestNeighborSort, metric::EuclideanDistance>
     AllkNN;
 @endcode
 
@@ -292,7 +292,7 @@
 @code
 template<
   typename SortPolicy = NearestNeighborSort,
-  typename MetricType = mlpack::metric::SquaredEuclideanDistance,
+  typename MetricType = mlpack::metric::EuclideanDistance,
   typename TreeType = mlpack::tree::BinarySpaceTree<bound::HRectBound<2>,
                                                     QueryStat<SortPolicy> >
 >
@@ -370,7 +370,7 @@
 // Construct a NeighborSearch object with ball bounds.
 NeighborSearch<
   NearestNeighborSort,
-  metric::SquaredEuclideanDistance,
+  metric::EuclideanDistance,
   tree::BinarySpaceTree<bound::BallBound<2>,
                         QueryStat<SortPolicy> >
 > neighborSearch(dataset);