Hierarchical Change Point Detection on Dynamic Networks

Aniket Chakrabarti; David Sivakoff; Srinivasan Parthasarathy; Yu Wang

REVIEW

Hierarchical Change Point Detection on Dynamic Networks

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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

arxiv 1706.02186 v2 pith:2YZKAT55 submitted 2017-06-07 cs.SI physics.soc-ph

Yu Wang , Aniket Chakrabarti , David Sivakoff , Srinivasan Parthasarathy This is my paper · ORCID

classification cs.SIphysics.soc-ph

keywords networkschangechangesdetectionframeworkpointdesigndetect

verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments

read the original abstract

This paper studies change point detection on networks with community structures. It proposes a framework that can detect both local and global changes in networks efficiently. Importantly, it can clearly distinguish the two types of changes. The framework design is generic and as such several state-of-the-art change point detection algorithms can fit in this design. Experiments on both synthetic and real-world networks show that this framework can accurately detect changes while achieving up to 800X speedup.

Discussion (0). Continue with ORCID to comment.

Pith tools