HLSAD: Hodge Laplacian-based Simplicial Anomaly Detection
Florian Frantzen, Michael T. Schaub
摘要
In this paper, we propose HLSAD, a novel method for detecting anomalies in time-evolving simplicial complexes. While traditional graph anomaly detection techniques have been extensively studied, they often fail to capture changes in higher-order interactions that are crucial for identifying complex structural anomalies. These higher-order interactions can arise either directly from the underlying data itself or through graph lifting techniques. Our approach leverages the spectral properties of Hodge Laplacians of simplicial complexes to effectively model multi-way interactions among data points. By incorporating higher-dimensional simplicial structures into our method, our method enhances both detection accuracy and computational efficiency. Through comprehensive experiments on both synthetic and real-world datasets, we demonstrate that our approach outperforms existing graph methods in detecting both events and change points.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper2
相关 Paper
- Dist2Cycle: A Simplicial Neural Network for Homology LocalizationAlexandros Dimitrios Keros, Vidit Nanda, Kartic SubrAAAI 2022 · 被引用 30 次
- HSMAD: Heterophily-Driven Spectral and Manifold Learning for Graph Anomaly DetectionChen Zhu, YAYING ZHANGICML 2026
- A Generalizable Anomaly Detection Method in Dynamic GraphsXiao Yang, Xuejiao Zhao, Zhiqi ShenAAAI 2025 · 被引用 20 次
- Topological Point Cloud ClusteringVincent Peter Grande, Michael T. SchaubICML 2023 · 被引用 13 次
- Higher-Order Graph Convolutional Network with Flower-Petals Laplacians on Simplicial ComplexesYiming Huang, Yujie Zeng, Qiang Wu, Linyuan LüAAAI 2024 · 被引用 33 次
