On 07/09/2013 12:35, Lars Buitinck wrote: > 2013/9/7 Robert Layton <robertlay...@gmail.com>: >> This algorithm finds a minimum spanning tree, then cuts any edge higher than >> a given threshold. >> >> This is equivalent to the single linkage clustering. Olivier and I are >> talking about which name would be best to use. The leading option at the >> moment is SingleLinkageClustering. >> >> What do people think about this? Any better suggesttions? >> Scikit-learn-general@lists.sourceforge.net >> https://lists.sourceforge.net/lists/listinfo/scikit-learn-general > I think single-linkage is what people are going to look for when they > want a clustering algorithm. The fact that this is equivalent to > finding an MST is an implementation detail (although it's still a good > thing to have that in the docs, since it immediately evokes the > complexity of MST algos to computer scientists). +1
------------------------------------------------------------------------------ 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
