[mlpack-svn] r16281 - mlpack/trunk/doc/tutorials/emst

fastlab-svn at coffeetalk-1.cc.gatech.edu fastlab-svn at coffeetalk-1.cc.gatech.edu
Tue Feb 11 11:46:48 EST 2014


Author: rcurtin
Date: Tue Feb 11 11:46:48 2014
New Revision: 16281

Log:
Update citation format.


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

Modified: mlpack/trunk/doc/tutorials/emst/emst.txt
==============================================================================
--- mlpack/trunk/doc/tutorials/emst/emst.txt	(original)
+++ mlpack/trunk/doc/tutorials/emst/emst.txt	Tue Feb 11 11:46:48 2014
@@ -17,8 +17,22 @@
 of data.  A <em>single-linkage clustering</em> can be obtained from the EMST by deleting
 all edges longer than a given cluster length.  This technique is also referred to as a <em>Friends-of-Friends</em> clustering in the astronomy literature.
 
-MLPACK includes an implementation of <b>Dual-Tree Boruvka</b> on \f$kd\f$-trees, the empirically and
-theoretically fastest EMST algorithm.  For more details, see March, <em>et al.</em>, <em>Euclidean Minimum Spanning Tree: Algorithm, Analysis, and Applications</em>, in KDD, 2010.  An implementation using cover trees is forthcoming.
+MLPACK includes an implementation of <b>Dual-Tree Boruvka</b> on \f$kd\f$-trees,
+the empirically and theoretically fastest EMST algorithm.  For more details,
+see the following paper:
+
+ at code
+ at inproceedings{march2010fast,
+  title={Fast {E}uclidean minimum spanning tree: algorithm, analysis, and
+applications},
+  author={March, William B. and Ram, Parikshit and Gray, Alexander G.},
+  booktitle={Proceedings of the 16th ACM SIGKDD International Conference on
+Knowledge Discovery and Data Mining (KDD '10)},
+  pages={603--612},
+  year={2010},
+  organization={ACM}
+}
+ at endcode
 
 \b mlpack provides:
 



More information about the mlpack-svn mailing list