REVIEW 1 cited by
Evaluating network partitions through visualization
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Network clustering requires making many decisions manually, such as the number of groups and a statistical model to be used. Even after filtering using an information criterion or regularizing with a nonparametric framework, we are commonly left with multiple candidates with reasonable partitions. In the end, the user has to decide which inferred groups should be regarded as informative. Here we propose a visualization method that efficiently represents network partitioning based on statistical inference algorithms. Our non-statistical assessment procedure based on visualization helps users extract informative groups when they cannot uniquely determine significant groups on the basis of statistical assessments. The proposed visualization is also effective for use as a benchmark test of different clustering algorithms.
Forward citations
Cited by 1 Pith paper
-
HOTVis: Higher-Order Time-Aware Visualisation of Dynamic Graphs
A static graph layout that adds forces from higher-order causal path models to expose temporal clusters and temporal closeness in dynamic networks.
Discussion (0). Continue with ORCID to comment.