Statistical learning for change point and anomaly detection in graphs

• URL: http://arxiv.org/abs/2011.06080v1
• Date: Tue, 10 Nov 2020 17:15:53 GMT
• Title: Statistical learning for change point and anomaly detection in graphs
• Authors: Anna Malinovskaya, Philipp Otto and Torben Peters
• Abstract summary: We discuss the possibility of bringing together statistical process control and deep learning algorithms. We propose to monitor the response times of ambulance services, applying jointly the control chart for quantile function values and a graph convolutional network.
• Score: 0.32228025627337864
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Complex systems which can be represented in the form of static and dynamic graphs arise in different fields, e.g. communication, engineering and industry. One of the interesting problems in analysing dynamic network structures is to monitor changes in their development. Statistical learning, which encompasses both methods based on artificial intelligence and traditional statistics, can be used to progress in this research area. However, the majority of approaches apply only one or the other framework. In this paper, we discuss the possibility of bringing together both disciplines in order to create enhanced network monitoring procedures focussing on the example of combining statistical process control and deep learning algorithms. Together with the presentation of change point and anomaly detection in network data, we propose to monitor the response times of ambulance services, applying jointly the control chart for quantile function values and a graph convolutional network.

Related papers

• Anomaly Detection in Dynamic Graphs: A Comprehensive Survey [0.23020018305241333]
  This survey paper presents a comprehensive and conceptual overview of anomaly detection using dynamic graphs. We focus on existing graph-based anomaly detection (AD) techniques and their applications to dynamic networks.
  arXiv  Detail & Related papers  (2024-05-31T18:54:00Z)
• Graph Learning under Distribution Shifts: A Comprehensive Survey on Domain Adaptation, Out-of-distribution, and Continual Learning [53.81365215811222]
  We provide a review and summary of the latest approaches, strategies, and insights that address distribution shifts within the context of graph learning. We categorize existing graph learning methods into several essential scenarios, including graph domain adaptation learning, graph out-of-distribution learning, and graph continual learning. We discuss the potential applications and future directions for graph learning under distribution shifts with a systematic analysis of the current state in this field.
  arXiv  Detail & Related papers  (2024-02-26T07:52:40Z)
• Coupled Attention Networks for Multivariate Time Series Anomaly Detection [10.620044922371177]
  We propose a coupled attention-based neural network framework (CAN) for anomaly detection in multivariate time series data. To capture inter-sensor relationships and temporal dependencies, a convolutional neural network based on the global-local graph is integrated with a temporal self-attention module.
  arXiv  Detail & Related papers  (2023-06-12T13:42:56Z)
• Graph Neural Networks for Multi-Robot Active Information Acquisition [15.900385823366117]
  A team of mobile robots, communicating through an underlying graph, estimates a hidden state expressing a phenomenon of interest. Existing approaches are either not scalable, unable to handle dynamic phenomena or not robust to changes in the communication graph. We propose an Information-aware Graph Block Network (I-GBNet) that aggregates information over the graph representation and provides sequential-decision making in a distributed manner.
  arXiv  Detail & Related papers  (2022-09-24T21:45:06Z)
• Learning the Evolutionary and Multi-scale Graph Structure for Multivariate Time Series Forecasting [50.901984244738806]
  We show how to model the evolutionary and multi-scale interactions of time series. In particular, we first provide a hierarchical graph structure cooperated with the dilated convolution to capture the scale-specific correlations. A unified neural network is provided to integrate the components above to get the final prediction.
  arXiv  Detail & Related papers  (2022-06-28T08:11:12Z)
• Graph similarity learning for change-point detection in dynamic networks [15.694880385913534]
  We consider dynamic networks that are temporal sequences of graph snapshots. This task is often termed network change-point detection and has numerous applications, such as fraud detection or physical motion monitoring. We design a method to perform online network change-point detection that can adapt to the specific network domain and localise changes with no delay.
  arXiv  Detail & Related papers  (2022-03-29T12:16:38Z)
• Mutually exciting point process graphs for modelling dynamic networks [0.0]
  A new class of models for dynamic networks is proposed, called mutually exciting point process graphs (MEG) MEG is a scalable network-wide statistical model for point processes with dyadic marks, which can be used for anomaly detection. The model is tested on simulated graphs and real world computer network datasets, demonstrating excellent performance.
  arXiv  Detail & Related papers  (2021-02-11T10:14:55Z)
• Graph-Based Neural Network Models with Multiple Self-Supervised Auxiliary Tasks [79.28094304325116]
  Graph Convolutional Networks are among the most promising approaches for capturing relationships among structured data points. We propose three novel self-supervised auxiliary tasks to train graph-based neural network models in a multi-task fashion.
  arXiv  Detail & Related papers  (2020-11-14T11:09:51Z)
• Controlling Graph Dynamics with Reinforcement Learning and Graph Neural Networks [86.05566365115729]
  We consider the problem of controlling a partially-observed dynamic process on a graph by a limited number of interventions. This problem naturally arises in contexts such as scheduling virus tests to curb an epidemic. We formulate this as a decision problem over a temporal graph process.
  arXiv  Detail & Related papers  (2020-10-11T18:44:50Z)
• Graph signal processing for machine learning: A review and new perspectives [57.285378618394624]
  We review a few important contributions made by GSP concepts and tools, such as graph filters and transforms, to the development of novel machine learning algorithms. We discuss exploiting data structure and relational priors, improving data and computational efficiency, and enhancing model interpretability. We provide new perspectives on future development of GSP techniques that may serve as a bridge between applied mathematics and signal processing on one side, and machine learning and network science on the other.
  arXiv  Detail & Related papers  (2020-07-31T13:21:33Z)
• End-to-End Models for the Analysis of System 1 and System 2 Interactions based on Eye-Tracking Data [99.00520068425759]
  We propose a computational method, within a modified visual version of the well-known Stroop test, for the identification of different tasks and potential conflicts events. A statistical analysis shows that the selected variables can characterize the variation of attentive load within different scenarios. We show that Machine Learning techniques allow to distinguish between different tasks with a good classification accuracy.
  arXiv  Detail & Related papers  (2020-02-03T17:46:13Z)

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.