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

SciPy Trac scipy-tickets@scipy....
Sat Nov 13 20:20:18 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 josefpktd):

 In my opinion Enzo's version can go in essentially as it is. During
 summer, I compared his version, the Java version and the paper, without
 trying to understand the algorithm. Both Java and python version are close
 to the description of the algorithm in the paper, and I don't think there
 is a license problem.

 I cannot say anything about the c version, since I'm not programming in c.

 Enzo's version produces the same results as the current implementation, as
 far as I remember, so docstring and tests could be kept. Only the
 algorithm needs to be swapped after cleaning it up a bit (from numpy
 import *).

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


More information about the Scipy-tickets mailing list