On 09/08/2013 07:10 PM, Olivier Grisel wrote: > BTW it might make sense to keep `SingleLinkageClustering` as a special case > as: > > - the MST algorithm can benefit from extracting the nearest neighbors > graph only using the ball tree as done in Andreas implementation: > https://github.com/amueller/information-theoretic-mst/blob/master/itm.py#L76 > and this example by Jake: It think that made quite a difference on MNIST iirc.
------------------------------------------------------------------------------ Learn the latest--Visual Studio 2012, SharePoint 2013, SQL 2012, more! Discover the easy way to master current and previous Microsoft technologies and advance your career. Get an incredible 1,500+ hours of step-by-step tutorial videos with LearnDevNow. Subscribe today and save! http://pubads.g.doubleclick.net/gampad/clk?id=58041391&iu=/4140/ostg.clktrk _______________________________________________ Scikit-learn-general mailing list Scikit-learn-general@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/scikit-learn-general
