Towards a "Swiss Army Knife" for Scalable User-Defined Temporal (k,๐ณ)-Core Analysis
share
Querying cohesive subgraphs on temporal graphs (e.g., social network, finance network, etc.) with various conditions has attracted intensive research interests recently. In this paper, we study a novel Temporal (k,๐ณ)-Core Query (TXCQ) that extends a fundamental Temporal k-Core Query (TCQ) proposed in our conference paper by optimizing or constraining an arbitrary metric ๐ณ of k-core, such as size, engagement, interaction frequency, time span, burstiness, periodicity, etc. Our objective is to address specific TXCQ instances with conditions on different ๐ณ in a unified algorithm framework that guarantees scalability. For that, this journal paper proposes a taxonomy of measurement ๐ณ(ยท) and achieve our objective using a two-phase framework while ๐ณ(ยท) is time-insensitive or time-monotonic. Specifically, Phase 1 still leverages the query processing algorithm of TCQ to induce all distinct k-cores during a given time range, and meanwhile locates the "time zones" in which the cores emerge. Then, Phase 2 conducts fast local search and ๐ณ evaluation in each time zone with respect to the time insensitivity or monotonicity of ๐ณ(ยท). By revealing two insightful concepts named tightest time interval and loosest time interval that bound time zones, the redundant core induction and unnecessary ๐ณ evaluation in a zone can be reduced dramatically. Our experimental results demonstrate that TXCQ can be addressed as efficiently as TCQ, which achieves the latest state-of-the-art performance, by using a general algorithm framework that leaves ๐ณ(ยท) as a user-defined function.
READ FULL TEXT