Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Assessing the Graph Structure Learning in Graph Deviation Networks
Halmstad University, Sweden.
Halmstad University, Sweden.
Halmstad University, Sweden.
RISE Research Institutes of Sweden, Digital Systems, Data Science. Halmstad University, Sweden.ORCID iD: 0000-0003-3272-4145
2025 (English)In: Lecture Notes in Computer Science, ISSN 03029743, Vol. 15669 LNCS, p. 97-109Article in journal (Refereed) Published
Abstract [en]

Statistical modeling of multivariate time-series data poses significant challenges due to their high dimensionality and complex inter-variable relationships. Reliable forecasts or anomaly detection on these datasets require capturing such relationships within and between the features. While traditional deep learning architectures are good at capturing temporal non-linear patterns within features, they are less efficient at modeling inter-variable relationships explicitly structured as graphs-a capability where Graph Neural Networks (GNNs) excel. Inspired by the success of GNNs, Graph Deviation Network (GDN) was originally proposed for anomaly detection on industrial multivariate time-series data. After proving its merits through experiments with real-world data, GDN gained significant popularity in the research community, claiming to learn the hidden graph structure in any multivariate time-series data. Various modifications to GDN were proposed over the years, but essentially all of them kept its Graph Structure Learning (GSL) module intact. However, until now, this module has never been rigorously evaluated. This work scrutinizes the contribution of the GSL module. Our experiments reveal that the graph learned by GSL is relatively ineffective, and the key to the overall performance achieved by GDN lies almost entirely in the downstream Graph Attention Network (GAT) module. We hope our findings will garner attention for further development of the GSL module of GDN, whose fidelity can improve the performance of GDN variants. 

Place, publisher, year, edition, pages
Springer Science and Business Media Deutschland GmbH , 2025. Vol. 15669 LNCS, p. 97-109
Keywords [en]
Anomaly detection; Graph algorithms; Graph neural networks; Network theory (graphs); Anomaly detection; Graph deviation network; Graph neural network for time-series anomaly detection; Graph neural networks; Graph structure learning; Graph structures; Multivariate time series; Structure-learning; Times series; Time series
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:ri:diva-78551DOI: 10.1007/978-3-031-91398-3_8Scopus ID: 2-s2.0-105005282687OAI: oai:DiVA.org:ri-78551DiVA, id: diva2:1998411
Conference
23rd International Symposium on Intelligent Data Analysis, IDA 2025.7 May 2025 - 9 May 2025
Available from: 2025-09-16 Created: 2025-09-16 Last updated: 2025-09-23Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Pashami, Sepideh

Search in DiVA

By author/editor
Pashami, Sepideh
By organisation
Data Science
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 32 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf