Re: [Rd] Fast Kendall's tau

From: Adler, Avraham <Avraham.Adler_at_guycarp.com>
Date: Wed, 27 Jun 2012 10:15:48 -0500

> From: Terry Therneau [mailto:therneau_at_mayo.edu]
> Sent: Wednesday, June 27, 2012 8:16 AM
> To: r-devel_at_r-project.org; Adler_at_smtprelay.mayo.edu; Adler, Avraham
> Subject: Re: Fast Kendall's tau
>
> Note that the survConcordance function, which is equivalent to Kendall's tau, also is O(n log n)
> and it does compute a variance. The variance is about 4/5 of the work.

[snip]         

> I agree with Brian, especially since the Spearman and Kendall results rarely (ever?) disagree
> on their main message for n>50. At the very most, one might add a footnote to the the help page for
> cor.test pointing to the faster codes.
>
> Terry T.

Thank you, Terry, for pointing me to survConcordance. As for documentation, I agree that would probably be optimal in terms of reward for least amount of work/disruption.

Thank you again,

Avraham Adler



R-devel_at_r-project.org mailing list
https://stat.ethz.ch/mailman/listinfo/r-devel Received on Wed 27 Jun 2012 - 19:38:31 GMT

This quarter's messages: by month, or sorted: [ by date ] [ by thread ] [ by subject ] [ by author ]

All messages

Archive maintained by Robert King, hosted by the discipline of statistics at the University of Newcastle, Australia.
Archive generated by hypermail 2.2.0, at Thu 28 Jun 2012 - 11:20:35 GMT.

Mailing list information is available at https://stat.ethz.ch/mailman/listinfo/r-devel. Please read the posting guide before posting to the list.

list of date sections of archive