PulseAugur
EN
LIVE 07:09:45

New DigDag algorithm efficiently mines spatio-temporal event data patterns

By PulseAugur Editorial · [2 sources] ·

Researchers have developed a new algorithm called DigDag to discover recurring interaction patterns in spatio-temporal event data. This method represents event instances as nodes and their relationships as edges, focusing on frequent closed embedded sub-Directed Acyclic Graphs (DAGs) for compact pattern representation. Experiments show DigDag is significantly more efficient than existing approaches like SLEUTH and CSTPM for mining these patterns. AI

IMPACT This research could lead to more efficient methods for analyzing complex event data, potentially impacting fields that rely on understanding temporal and spatial relationships.

RANK_REASON The cluster contains a research paper published on arXiv detailing a new algorithm and its experimental comparison to existing methods.

Read on arXiv cs.LG →

AI-generated summary · Google Gemini · from 2 sources. How we write summaries →

New DigDag algorithm efficiently mines spatio-temporal event data patterns

COVERAGE [2]

  1. arXiv cs.LG TIER_1 English(EN) · Piotr S. Maci\k{a}g ·

    Discovering Frequent Closed Embedded Sub-DAGs in Spatio-Temporal Event Data

    arXiv:2607.05995v1 Announce Type: cross Abstract: We propose a novel approach to mine patterns in spatio-temporal event data based on discovering frequent closed embedded sub-Directed Acyclic Graphs (DAGs). In our method, event instances are represented as nodes labelled by event…

  2. arXiv cs.LG TIER_1 English(EN) · Piotr S. Maciąg ·

    Discovering Frequent Closed Embedded Sub-DAGs in Spatio-Temporal Event Data

    We propose a novel approach to mine patterns in spatio-temporal event data based on discovering frequent closed embedded sub-Directed Acyclic Graphs (DAGs). In our method, event instances are represented as nodes labelled by event types, while edges capture spatio-temporal follow…

RELATED ENTITIES

RELATED TOPICS