Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

103207310413 · Jun 202019922001200920172026
48 results for graph anomaly detection

Graph neural networks detect anomalies in object-centric business processes.

problem Detecting anomalies in graph-like business processes.
method Graph convolutional autoencoder architecture for anomaly detection.
result Promising performance in detecting anomalies at the activity type and attributes level.

Study detects anomalies in financial markets using GNN and nonextensive entropy.

problem Detecting anomalies in global financial markets with many correlated assets.
method Used Graph Neural Networks (GNN) with nonextensive entropy to measure uncertainty.
result Anomalies are statistically different for nonextensive entropy parameters before, during, and after a crisis.

StrGNN detects anomalies in dynamic graphs by analyzing subgraphs and temporal features.

problem Detecting anomalies in dynamic graphs with structural changes.
method StrGNN is an end-to-end model that uses structural subgraphs and temporal features for anomaly detection.
result StrGNN effectively detects anomalies in dynamic graphs, as shown by extensive experiments.

GUIDE detects anomalies in attributed networks by reconstructing node attributes and higher-order structures.

problem Lack of effective mechanisms for detecting anomalies in complex network interactions.
method GUIDE uses attribute and structure autoencoders, graph attention, and reconstruction errors to identify anomalies.
result GUIDE significantly outperforms state-of-the-art methods on multiple real-world datasets.

This work presents a novel modeling and analysis framework for graph sequences which addresses the challenge of detecting and contextualizing anomalies in labelled, streaming graph data. We introduce a generalization of the BTER model of Seshadhri et al. by adding flexibility to community structure, and use this model …

2014-10-16abs ↗pdf ↗

We propose a simple yet effective method for detecting anomalous instances on an attribute graph with label information of a small number of instances. Although with standard anomaly detection methods it is usually assumed that instances are independent and identically distributed, in many real-world applications, inst…

2020-02-27abs ↗pdf ↗

Graph-based methods for anomaly detection and semi-supervised learning.

problem Detecting unusual clinical actions and anomalies in hospital data.
method Label propagation, harmonic solution, regularization, graph connectivity analysis.
result Effective anomaly detection and semi-supervised learning methods for healthcare data.

Bi-directional Curriculum Learning improves graph anomaly detection by considering both homogeneity and heterogeneity.

problem Existing graph anomaly detection methods often ignore the different contributions of nodes to training.
method Introduces Bi-directional Curriculum Learning (BCL) to optimize GAD methods by considering both homogeneity and heterogeneity of nodes.
result Extensive experiments show that BCL significantly improves the performance of GAD anomaly detection models.

GANF uses normalizing flows to detect anomalies in multiple time series.

problem Detecting anomalies in multiple time series with interdependencies.
method Bayesian network integration with normalizing flows for unsupervised anomaly detection.
result GANF effectively detects anomalies and identifies distribution drift in time series data.

ADSAGE detects anomalies in graph edge sequences for insider threat detection.

problem Detecting insider threats in fine-grained audit logs using graph and text features.
method Anomaly detection at edge level, supporting numeric, categorical, and text attributes.
result ADSAGE detects anomalies in authentications and email communications effectively.

This work builds a sensor graph from DC sensors for anomaly detection.

problem Anomaly detection in data centers with complex sensor relationships.
method Data-driven pipeline (ts2graph) to build a sensor graph from sensor time series.
result Graph neural network (GNN) outperforms existing methods by 2-3 times in anomaly detection.

Study examines unsupervised and graph-based methods for anomaly detection in IoBT, outperformed by supervised stacking ensemble.

problem Anomaly detection in adversarial environments of IoBT.
method Unsupervised learning, graph-based methods, ensemble supervised learning, adversarial training.
result Supervised stacking ensemble method outperforms unsupervised and graph-based methods in detecting anomalies.

Unified benchmark for GLAD and GLOD methods across 35 datasets.

problem Gap between GLAD and GLOD research due to distinct evaluation setups.
method Comprehensive evaluation framework that unifies GLAD and GLOD.
result Multi-dimensional analyses of existing methods' strengths and limitations.

A graph-based sampling and consensus (GraphSAC) approach is introduced to effectively detect anomalous nodes in large-scale graphs. Existing approaches rely on connectivity and attributes of all nodes to assign an anomaly score per node. However, nodal attributes and network links might be compromised by adversaries, r…

2019-10-21abs ↗pdf ↗

ResGCN detects anomalies in attributed networks by capturing sparsity and nonlinearity.

problem Detecting anomalous nodes in attributed networks.
method Attention-based deep residual modeling using Graph Convolutional Networks.
result ResGCN effectively detects anomalies in attributed networks.

Survey on LSTM-based anomaly detection for technical systems.

problem Detect anomalies in technical systems due to complex dynamics.
method Use LSTM networks and other AI techniques to detect anomalies considering temporal and contextual characteristics.
result Demonstrates the potential of LSTM networks and graph-based approaches for anomaly detection.

Dissertation tackles zero-shot anomaly detection, focusing on consistent anomalies and proposing CoDeGraph framework.

problem Consistent anomalies bias distance-based zero-shot anomaly detection methods.
method Formalized consistent anomalies, identified similarity scaling and neighbor-burnout phenomena, introduced CoDeGraph framework.
result CoDeGraph effectively suppresses consistent anomalies in zero-shot anomaly detection.

DECAF-GAD improves fairness in autoencoder-based GAD models without sacrificing performance.

problem Fairness in autoencoder-based GAD models for node-level anomaly detection.
method DECAF-GAD uses a structural causal model to disentangle sensitive attributes from learned representations, along with a fairness-guided loss function.
result DECAF-GAD significantly enhances fairness metrics while maintaining anomaly detection performance.

Paper introduces an unsupervised tensor-based anomaly detection method for spatiotemporal data.

problem Challenges in detecting anomalies in spatiotemporal data, especially in urban traffic monitoring and medical imaging.
method Formulates anomaly detection as a regularized robust low-rank + sparse tensor decomposition, incorporating spatiotemporal smoothness and local dependencies.
result Demonstrates improved anomaly detection performance on both synthetic and real data.

In general, anomaly detection is the problem of distinguishing between normal data samples with well defined patterns or signatures and those that do not conform to the expected profiles. Financial transactions, customer reviews, social media posts are all characterized by relational information. In these networks, fra…

2019-10-24abs ↗pdf ↗

In this paper, we use variational recurrent neural network to investigate the anomaly detection problem on graph time series. The temporal correlation is modeled by the combination of recurrent neural network (RNN) and variational inference (VI), while the spatial information is captured by the graph convolutional netw…

2017-08-09abs ↗pdf ↗

LGKDE learns graph density using neural networks and perturbations.

problem Graph density estimation challenges in capturing structural patterns and semantic variations.
method LGKDE uses graph neural networks to represent graphs as discrete distributions and learns graph metrics via maximum mean discrepancy.
result LGKDE outperforms state-of-the-art baselines in graph anomaly detection.

We propose a non-parametric anomaly detection algorithm for high dimensional data. We first rank scores derived from nearest neighbor graphs on nn-point nominal training data. We then train limited complexity models to imitate these scores based on the max-margin learning-to-rank framework. A test-point is declared as…

2016-01-22abs ↗pdf ↗

Adversarial training improves graph autoencoder generalization.

problem Improving graph autoencoder generalization.
method Formulated L2 and L1 adversarial training for graph autoencoders and variational graph autoencoders.
result Adversarial training boosts graph autoencoder and variational graph autoencoder generalization.

PieClam autoencodes graphs into communities, improving graph anomaly detection.

problem Graph anomaly detection and universal graph autoencoding.
method Probabilistic graph model with overlapping inclusive and exclusive communities.
result PieClam is a universal autoencoder that uniformly approximates any graph.

Intrusion detection systems (IDSs) generate valuable knowledge about network security, but an abundance of false alarms and a lack of methods to capture the interdependence among alerts hampers their utility for network defense. Here, we explore a graph-based approach for fusing alerts generated by multiple IDSs (e.g.,…

2018-12-06abs ↗pdf ↗

We propose a novel non-parametric adaptive anomaly detection algorithm for high dimensional data based on rank-SVM. Data points are first ranked based on scores derived from nearest neighbor graphs on n-point nominal data. We then train a rank-SVM using this ranked data. A test-point is declared as an anomaly at alpha-…

2014-05-02abs ↗pdf ↗

We propose a non-parametric anomaly detection algorithm for high dimensional data. We score each datapoint by its average KK-NN distance, and rank them accordingly. We then train limited complexity models to imitate these scores based on the max-margin learning-to-rank framework. A test-point is declared as an anomaly…

2015-02-06abs ↗pdf ↗

Improves anomaly detection with contaminated unlabeled data.

problem Weakness in existing semi-supervised anomaly detection methods when unlabeled data contain anomalies.
method Integrates positive-unlabeled learning with deep anomaly detection models.
result Achieves better detection performance on various datasets.