Skip to content

Conversation

@ariyapour
Copy link

@ariyapour ariyapour commented Sep 5, 2022

In the slide 12 of t04_benchmarking we have lower bound of k>5 for precise friedman test. On the other hand in the exercise the number of algorithms are k=5 which contradicts with the slides. Checking WikiPedia, it also confirms the lower bounds of n>15 and k>4.
WikiPedia link: https://en.wikipedia.org/wiki/Friedman_test#:~:text=Finally%2C%20when%20n,would%20be%20performed.

Also in the slide number 14, professor says "Our critical difference is 1.2" but in the slide the critical difference is 1.3. Either the image or the audio should change.

In the slide 12 we have lower bound of k>5 for precise friedman test. On the other hand in the exercise the number of
algorithms are k=5 which contradicts with the slides. Checking WikiPedia, it also confirms the lower bounds of n>15 and k>4.
WikiPedia link: https://en.wikipedia.org/wiki/Friedman_test#:~:text=Finally%2C%20when%20n,would%20be%20performed.
@ariyapour ariyapour changed the title Fix k>5 to k>4 in slide 12. Fix k>5 to k>4 in slide 12 in t04_benchmarking. Sep 5, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant