You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Right now the HClustering often generates long 'strings' of graphs where the depth of the graph is very deep and each level is only a binary split with just one/few node(s) joining in. This means the visualization is just a bunch of concentric circles. We need to review the find_root/find_parent logic to see if we can generate a flatter tree where sibling counts are higher.
The text was updated successfully, but these errors were encountered:
Right now the HClustering often generates long 'strings' of graphs where the depth of the graph is very deep and each level is only a binary split with just one/few node(s) joining in. This means the visualization is just a bunch of concentric circles. We need to review the find_root/find_parent logic to see if we can generate a flatter tree where sibling counts are higher.
The text was updated successfully, but these errors were encountered: