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: http://www.astroml.org/paper_figures/CIDU2012/fig_great_wall_MST.html : being able to do so might impose some restrictions on the list of metrics we want to support for this class. - the AgglomerativeClustering implementation supports connectivity constraints which might not be easily implementable when the MST is built on top of nearest neighbors graph that is itself implemented on top of a KD-tree or Ball Tree. ------------------------------------------------------------------------------ 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
