A Hybrid Approach to Temporal Pattern Matching

• URL: http://arxiv.org/abs/2001.01661v2
• Date: Fri, 24 Jan 2020 11:22:10 GMT
• Title: A Hybrid Approach to Temporal Pattern Matching
• Abstract summary: We propose a hybrid approach that achieves effective filtering of potential matches based on structure and time. We present experiments with real datasets that illustrate the efficiency of our approach.
• Score: 2.5001363890681336
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The primary objective of graph pattern matching is to find all appearances of an input graph pattern query in a large data graph. Such appearances are called matches. In this paper, we are interested in finding matches of interaction patterns in temporal graphs. To this end, we propose a hybrid approach that achieves effective filtering of potential matches based both on structure and time. Our approach exploits a graph representation where edges are ordered by time. We present experiments with real datasets that illustrate the efficiency of our approach.

Related papers

• A Versioned Unified Graph Index for Dynamic Timestamp-Aware Nearest Neighbor Search [4.414455125136369]
  TiGER is a novel approach for performing fast time-aware approximate nearest neighbor searches on dynamic vector datasets.<n>Our proposed algorithm builds and maintains a unified graph for all vectors by leveraging an index structure based on integrated versioned connectivity.
  arXiv  Detail & Related papers  (2026-08-27T19:51:28Z)
• Graphint: Graph-based Time Series Clustering Visualisation Tool [21.763409747687348]
  Graphint is an innovative system based on the $k$-Graph methodology. It integrates a robust time series clustering algorithm with an interactive tool for comparison and interpretation.
  arXiv  Detail & Related papers  (2025-03-10T17:20:02Z)
• Classification of Temporal Graphs using Persistent Homology [0.0]
  Temporal graphs effectively model dynamic systems by representing interactions as timestamped edges. We propose a novel method for analyzing temporal graphs using Persistent Homology. Our approach is node class free, offering flexibility for a wide range of temporal graph analysis.
  arXiv  Detail & Related papers  (2025-02-14T10:55:15Z)
• Gotta match 'em all: Solution diversification in graph matching matched filters [13.841897638543033]
  We present a novel approach for finding multiple noisily embedded template graphs in a very large background graph. Our method builds upon the graph-matching-matched-filter technique proposed in Sussman et al.
  arXiv  Detail & Related papers  (2023-08-25T15:53:30Z)
• Entropy Neural Estimation for Graph Contrastive Learning [9.032721248598088]
  Contrastive learning on graphs aims at extracting distinguishable high-level representations of nodes. We propose a simple yet effective subset sampling strategy to contrast pairwise representations between views of a dataset. We conduct extensive experiments on seven graph benchmarks, and the proposed approach achieves competitive performance.
  arXiv  Detail & Related papers  (2023-07-26T03:55:08Z)
• Learnable Graph Matching: A Practical Paradigm for Data Association [74.28753343714858]
  We propose a general learnable graph matching method to address these issues. Our method achieves state-of-the-art performance on several MOT datasets. For image matching, our method outperforms state-of-the-art methods on a popular indoor dataset, ScanNet.
  arXiv  Detail & Related papers  (2023-03-27T17:39:00Z)
• Learning Optimal Graph Filters for Clustering of Attributed Graphs [20.810096547938166]
  Many real-world systems can be represented as graphs where the different entities in the system are presented by nodes and their interactions by edges. An important task in studying large datasets with graphical structure is graph clustering. We introduce a graph signal processing based approach, where we learn the parameters of Finite Impulse Response (FIR) and Autoregressive Moving Average (ARMA) graph filters optimized for clustering.
  arXiv  Detail & Related papers  (2022-11-09T01:49:23Z)
• Reinforcement Learning Based Query Vertex Ordering Model for Subgraph Matching [58.39970828272366]
  Subgraph matching algorithms enumerate all is embeddings of a query graph in a data graph G. matching order plays a critical role in time efficiency of these backtracking based subgraph matching algorithms. In this paper, for the first time we apply the Reinforcement Learning (RL) and Graph Neural Networks (GNNs) techniques to generate the high-quality matching order for subgraph matching algorithms.
  arXiv  Detail & Related papers  (2022-01-25T00:10:03Z)
• Joint Graph Learning and Matching for Semantic Feature Correspondence [69.71998282148762]
  We propose a joint emphgraph learning and matching network, named GLAM, to explore reliable graph structures for boosting graph matching. The proposed method is evaluated on three popular visual matching benchmarks (Pascal VOC, Willow Object and SPair-71k) It outperforms previous state-of-the-art graph matching methods by significant margins on all benchmarks.
  arXiv  Detail & Related papers  (2021-09-01T08:24:02Z)
• Effective and Efficient Graph Learning for Multi-view Clustering [173.8313827799077]
  We propose an effective and efficient graph learning model for multi-view clustering. Our method exploits the view-similar between graphs of different views by the minimization of tensor Schatten p-norm. Our proposed algorithm is time-economical and obtains the stable results and scales well with the data size.
  arXiv  Detail & Related papers  (2021-08-15T13:14:28Z)
• Stochastic Iterative Graph Matching [11.128153575173213]
  We propose a new model, Iterative Graph MAtching, to address the graph matching problem. Our model defines a distribution of matchings for a graph pair so the model can explore a wide range of possible matchings. We conduct extensive experiments across synthetic graph datasets as well as biochemistry and computer vision applications.
  arXiv  Detail & Related papers  (2021-06-04T02:05:35Z)
• Line Graph Neural Networks for Link Prediction [71.00689542259052]
  We consider the graph link prediction task, which is a classic graph analytical problem with many real-world applications. In this formalism, a link prediction problem is converted to a graph classification task. We propose to seek a radically different and novel path by making use of the line graphs in graph theory. In particular, each node in a line graph corresponds to a unique edge in the original graph. Therefore, link prediction problems in the original graph can be equivalently solved as a node classification problem in its corresponding line graph, instead of a graph classification task.
  arXiv  Detail & Related papers  (2020-10-20T05:54:31Z)
• Multi-view Graph Learning by Joint Modeling of Consistency and Inconsistency [65.76554214664101]
  Graph learning has emerged as a promising technique for multi-view clustering with its ability to learn a unified and robust graph from multiple views. We propose a new multi-view graph learning framework, which for the first time simultaneously models multi-view consistency and multi-view inconsistency in a unified objective function. Experiments on twelve multi-view datasets have demonstrated the robustness and efficiency of the proposed approach.
  arXiv  Detail & Related papers  (2020-08-24T06:11:29Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.