[SciPy-dev] Fast (O(n log(n)) ) implementation of Kendall Tau
Wed Sep 30 09:03:34 CDT 2009
A few days ago I posted to http://projects.scipy.org/scipy/ticket/999 a
drop-in replacement for scipy.stats.kendalltau. My code implements the
algorithm with complexity O(n log()) described by William R. Knight in a
paper of 1966 archived at http://www.jstor.org/pss/2282833 , whereas the
function currently in SciPy has complexity O(n^2), which makes it unusable
with large data sets.
One potential issue here is that my code is in part derived from a Java
implementation contained in the Java package called "Law"
That code is GPL'd, but its authors
have already informally confirmed to me by e-mail that they have no
objections to the release of my Python code under a BSD-style license. Now
my question is: exactly which steps should I take in order to clear the path
to a possible inclusion in SciPy?
All the best,
More information about the Scipy-dev