Papers › Effective Hierarchical Information Threading Using Network Community Detection

Effective Hierarchical Information Threading Using Network Community Detection

17 Mar 2023European Conference on Information Retrieval 2023 3archive 2025-07-28

Hitarth Narvala, Graham McDonald, Iadh Ounis

With the tremendous growth in the volume of information produced online every day (e.g. news articles), there is a need for automatic methods to identify related information about events as the events evolve over time (i.e., information threads). In this work, we propose a novel unsupervised approach, called HINT, which identifies coherent Hierarchical Information Threads. These threads can enable users to easily interpret a hierarchical association of diverse evolving information about an event or discussion. In particular, HINT deploys a scalable architecture based on network community detection to effectively identify hierarchical links between documents based on their chronological relatedness and answers to the 5W1H questions (i.e., who, what, where, when, why & how). On the NewSHead collection, we show that HINT markedly outperforms existing state-of-the-art approaches in terms of the quality of the identified threads. We also conducted a user study that shows that our proposed network-based hierarchical threads are significantly (p<0.05) preferred by users compared to cluster-based sequential threads.

PaperPDFCode

Code

hitt08/HINT official report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

ArticlesCommunity DetectionEvent ExtractionInformation Threading

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Information Threading NewSHead HINT NMI 0.797 #1 of 4 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Methods

Introduced by this paper: HINT

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections