[Scipy-tickets] [SciPy] #999: Fast (O(n log(n)) ) implementation of Kendall's Tau

SciPy Trac scipy-tickets@scipy....
Sun Nov 21 09:44:39 CST 2010


#999: Fast (O(n log(n)) ) implementation of Kendall's Tau
-------------------------+--------------------------------------------------
 Reporter:  enzo         |       Owner:  somebody    
     Type:  enhancement  |      Status:  needs_review
 Priority:  normal       |   Milestone:  0.9.0       
Component:  scipy.stats  |     Version:  0.7.0       
 Keywords:  kendall tau  |  
-------------------------+--------------------------------------------------

Comment(by rgommers):

 Josef reminded me what would happen in case there is a license issue -
 basically just the code has to be taken out again. Given the Java guys
 basically said yes, that's a small risk. So here's a reworked version of
 Enzo's algorithm: https://github.com/rgommers/scipy/tree/stats-work.

 That branch also contains a few other commits on stats.py - Josef, can you
 look at all of that at once? Please double check the definition in the
 Notes section of the docstring. I took it from the end of a long
 discussion on-list about kendalltau in March 2009.

-- 
Ticket URL: <http://projects.scipy.org/scipy/ticket/999#comment:12>
SciPy <http://www.scipy.org>
SciPy is open-source software for mathematics, science, and engineering.


More information about the Scipy-tickets mailing list