Finding Time-Proximity Communities in Temporal Heterogeneous Information Networks

Community search in heterogeneous information networks (HINs) often neglects temporal dynamics, yielding structures that poorly reflect real-world interactions. We introduce the Temporal HIN Community Search (THCS) problem and propose a novel ( k, T q , P δ )-core model that captures both structural cohesiveness and temporal relevance. Our model uses a time span constraint δ to ensure interaction recency and a query interval T q for flexible temporal exploration, filtering irrelevant connections while preserving structural density. We develop two efficient online algorithms—Center-based Sliding Window search and Incremental Center Expansion—that exploit meta-path symmetry and dynamic connectivity tracking. For frequent queries, we design a Temporal HIN Core Interval-Index (TCI-Index), organising minimal core intervals hierarchically with innovative compression techniques. Experiments on real-world datasets show our methods significantly outperform baselines, finding temporally meaningful communities with high efficiency.

Authors

Institutions

Publication Details

Journal
Proceedings of the VLDB Endowment
Published
2025-09-01
DOI
https://doi.org/10.14778/3773731.3773747
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Finding Time-Proximity Communities in Temporal Heterogeneous Information Networks

Chengfei Liu, Yifu Tang, Rui Zhou, Jin Li et al.
Proceedings of the VLDB Endowment
Complex Network Analysis Techniques
article

Finding Time-Proximity Communities in Temporal Heterogeneous Information Networks

Chengfei Liu, Yifu Tang, Rui Zhou, Jin Li, Lu Chen
article en

Abstract

Community search in heterogeneous information networks (HINs) often neglects temporal dynamics, yielding structures that poorly reflect real-world interactions. We introduce the Temporal HIN Community Search (THCS) problem and propose a novel ( k, T q , P δ )-core model that captures both structural cohesiveness and temporal relevance. Our model uses a time span constraint δ to ensure interaction recency and a query interval T q for flexible temporal exploration, filtering irrelevant connections while preserving structural density. We develop two efficient online algorithms—Center-based Sliding Window search and Incremental Center Expansion—that exploit meta-path symmetry and dynamic connectivity tracking. For frequent queries, we design a Temporal HIN Core Interval-Index (TCI-Index), organising minimal core intervals hierarchically with innovative compression techniques. Experiments on real-world datasets show our methods significantly outperform baselines, finding temporally meaningful communities with high efficiency.

Proceedings of the VLDB EndowmentVol. 18(13)
Edith Cowan University (AU), Swinburne University of Technology (AU)
Openalex Percentile: Top 28%
Complex Network Analysis Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.