Apply "edge significance" thresholding to demonstrate difference in results between my approach and rhiver's
- Dominant language
- JavaScript
- Stars
- 0
- Forks
- 0
- PR merge metrics
- No merged PRs in 30d
Description
For visualization, use the same layout positions for nodes that are common between the two graphs. Will require calculating the union of the two graphs (because there are surely node in my graph that won't be in the significance threshold graph, but there may also be a few significance thresholded nodes that aren't in my graph). Set intersection nodes to grey, nodes/edges kept in my graph to green, significance thresholded nodes to red. Produce some statistics on on intersection and difference. Make some qualitative statements about the difference in results.
For all I know, this may actual reveal weaknesses in my approach. I consider this unlikely. If anything, I may need to set the threshold lower, or base it on a binomial proportions test instead of just a strict 10% threshold.
Contributor guide
No contributing guide indexed for this repository
Assessment
This issue has not been assessed yet.