BERTilda: Explainable Topic Lifecycle Tracking with Split/Merge Detection via Similarity-and-Flow Temporal Graphs

Abstract:Longitudinal text streams exhibit topic birth and death, but also discrete structural reorganizations in which themes split into subtopics or merge into broader narratives. Many dynamic topic models emphasize smooth drift, while snapshot topic models (fit independently per time window) leave temporal correspondence underspecified. We present BERTilda, an explainable framework that discovers topics independently in each window (using an embedding-based topic model) and then constructs a temporal topic graph linking topics across adjacent windows. Links are supported by two complementary signals: (i) semantic similarity between topic representations and (ii) a bidirectional coverage signal that estimates document outflow (where a topic goes) and inflow (where a topic comes from) via cross-window tweet-to-topic attribution. Graph-based rules label continuations, splits, merges, disappearances, and unclear transitions. We evaluate BERTilda on political corpora, including U.S. congressional tweets and historical speech datasets, report topic-quality and temporal-stability diagnostics, and validate lifecycle labels on a gold-standard subset annotated by three independent annotators. On the annotated subset, BERTilda reaches majority agreement rates up to 87% and attains the highest macro-average agreement across the compared methods, with particularly strong disappearance detection relative to similarity-only and forward-only baselines.

16 pages, 2 figures, 7 tables, with 4-page supplementary material. Accepted at ECML PKDD 2026 (Naples, 7-11 September 2026). Authors' accepted version; the revised version of record will appear in the proceedings (Springer, Lecture Notes in Computer Science)

Computation and Language (cs.CL); Machine Learning (cs.LG)

I.2.7; I.5.3; H.3.3

arXiv:2608.18101 [cs.CL]

(or arXiv:2608.18101v1 [cs.CL] for this version)