3 ms·
This boils down to a following old algo: 1. plot all possible scatterplots 2. order them due to an area of white space left 3. claim the top-whatever novel exci
by mbq 15y ago
This boils down to a following old algo: 1. plot all possible scatterplots 2. order them due to an area of white space left 3. claim the top-whatever novel exciting relationships. This way it is anti-robust and produces too much false-postives to be seriously useful.
- baltcode 15y agoI think you can correct for the false-positives to some extent. I am more skeptical of the computational load of basically testing all sorts of relationships. They have an approximate algorithm for doing that.
- mbq 15y agoYeah... do it exact and no hit will survive; do it with Bonferroni and nothing will really change. And in fact it is only checking two-way relationships, which is already a minor fraction of "all sorts".