Skip to content
This repository has been archived by the owner on Mar 20, 2020. It is now read-only.

Quickly visualize critical distance between methods after Friedman and post-hoc Nemenyi tests

License

Notifications You must be signed in to change notification settings

niedakh/algorithms-critical-distance-visualization

Repository files navigation

algorithms-critical-distance-visualization

Python code to quickly visualize critical distances between methods after Friedman and post-hoc Nemenyi tests as introduced in Gj. Madjarov, et al., An extensive experimental comparison of methods for multi-label learning, Pattern Recognition (2012), doi:10.1016/j.patcog.2012.03.004

About

Quickly visualize critical distance between methods after Friedman and post-hoc Nemenyi tests

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages