Fix k>5 to k>4 in slide 12 in t04_benchmarking.#54
Open
ariyapour wants to merge 1 commit intoautoml-edu:masterfrom
Open
Fix k>5 to k>4 in slide 12 in t04_benchmarking.#54ariyapour wants to merge 1 commit intoautoml-edu:masterfrom
ariyapour wants to merge 1 commit intoautoml-edu:masterfrom
Conversation
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
changed the title
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
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.