2011/10/4 Conrad Lee <[email protected]>: > I just noticed this recent paper on arXiv about faster hierarchical > clustering. The author has come up with algorithms to reduce the asymptotic > complexity of many variants from O(N^3) to O(N^2). Even better, he has come > up with a C++ implementation with a python/numpy interface that is drop-in > compatible with scipy.cluster.hierarchy.
You must mean from Θ(n² lg n) to Θ(n²). A generic Θ(n² lg n) algo is listed in many textbooks [1], I sure hope we don't have the naive algo scikit-learn? [1] http://nlp.stanford.edu/IR-book/pdf/17hier.pdf -- Lars Buitinck Scientific programmer, ILPS University of Amsterdam ------------------------------------------------------------------------------ All the data continuously generated in your IT infrastructure contains a definitive record of customers, application performance, security threats, fraudulent activity and more. Splunk takes this data and makes sense of it. Business sense. IT sense. Common sense. http://p.sf.net/sfu/splunk-d2dcopy1 _______________________________________________ Scikit-learn-general mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/scikit-learn-general
