[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: p value for spearman's correlation

From: Alan Mead
Subject: Re: p value for spearman's correlation
Date: Sun, 27 Dec 2020 14:43:05 -0600
User-agent: Mozilla/5.0 (Windows NT 6.1; Win64; x64; rv:78.0) Gecko/20100101 Thunderbird/78.6.0

On 12/27/2020 12:00 PM, Ben Pfaff wrote:
On Sun, Dec 27, 2020 at 3:23 AM John Darrington
<> wrote:
On Sat, Dec 26, 2020 at 07:58:40PM -0600, Alan Mead wrote:
     Alternatively, I wouldn't be upset if PSPP refuses to print any p-value
     for N < 30. I think ideally we would add a keyword requesting a more
     advanced algorithm.

I think this is probably the best course of action at least in the short
If not printing a p-value for this case is likely to confuse others, perhaps the
procedure should add a footnote indicating why the p-value is not output.

I had the same thought but I didn't know how easy it would be. Something like "Asymptotic approximations are inaccurate in samples of N<30."



Alan D. Mead, Ph.D.
President, Talent Algorithms Inc.

science + technology = better workers

The irony of this ... is that the Internet is
both almost-infinitely expandable, while at the
same time constrained within its own pre-defined
box. And if that makes no sense to you, just
reflect on the existence of Facebook. We have
the vastness of the internet and yet billions
of people decided to spend most of them time
within a horribly designed, fake-news emporium
of a website that sucks every possible piece of
personal information out of you so it can sell it
to others. And they see nothing wrong with that.

-- Kieren McCarthy, commenting on why we are not 
                    all using IPv6

reply via email to

[Prev in Thread] Current Thread [Next in Thread]