Online Density-Based Clustering for Real-Time Narrative Evolution Monitorin

Ostap Vykhopen, Viktoria Skorik, Maksym Tereshchenko, Veronika Solopova
1/28/2026
cs.CL

No confident code implementation found for this paper.

Abstract

Automated narrative intelligence systems for social media monitoring face significant scalability challenges when relying on batch clustering methods to process continuous data streams. We investigate replacing offline HDBSCAN with online density-based clustering algorithms in a production narrative report generation pipeline that processes large volumes of multilingual social media data. While HDBSCAN effectively discovers hierarchical clusters and handles noise, its batch-only nature requires full retraining for each time window, limiting scalability and real-time adaptability. We evaluate online clustering methods with respect to cluster quality, computational efficiency, memory footprint, and integration with downstream narrative extraction. Our evaluation combines standard clustering metrics, narrative-specific measures, and human validation of cluster correctness to assess both structural quality and semantic interpretability. Experiments using sliding-window simulations on historical data from the Ukrainian information space reveal trade-offs between temporal stability and narrative coherence, with DenStream achieving the strongest overall performance. These findings bridge the gap between batch-oriented clustering approaches and the streaming requirements of large-scale narrative monitoring systems.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{vykhopen2026online,
  title  = {Online Density-Based Clustering for Real-Time Narrative Evolution Monitorin},
  author = {Ostap Vykhopen and Viktoria Skorik and Maksym Tereshchenko and Veronika Solopova},
  year   = {2026},
  eprint = {2601.20680},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2601.20680v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2601.20680.svg)](https://codeofpaper.com/paper/2601.20680)

Discussion