commons-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Martin Rosellen <Martin.Rosel...@fu-berlin.de>
Subject [math] pearson and spearman correlation runtime complexity
Date Thu, 13 Dec 2012 14:57:55 GMT
Hi again,

I tried to implement the pearson and spearman algorithm myself and the 
computation took very long. That is why I now use the commons math 
solution. I am curious about the runtime complexity of the Pearson and 
the Spearman correlation coefficient. Can someone help me with that?

Greetz
Martin

---------------------------------------------------------------------
To unsubscribe, e-mail: dev-unsubscribe@commons.apache.org
For additional commands, e-mail: dev-help@commons.apache.org


Mime
View raw message