28 citations · 38 across the 10 of their papers we have counts for
10 papers
Amortised Post-Hoc Explanation with Exact Preservation for Dynamic Graph Anomaly Detectors
Iyad Assaad Nekka, Hamida Seba, Walid Khaled Hidouci +1
Anomaly detection in dynamic graphs underpins financial fraud analysis, intrusion detection, and platform integrity, where automated decisions require human-interpretable justifica…
Dual Spatial-Temporal Attribution: Architecture-Aligned Post-Hoc Explainability for Recurrent Graph Anomaly Detection
Iyad Assaad Nekka, Hamida Seba, Khaled Walid Hidouci +1
Deep learning detectors for anomalies in dynamic graphs have reached strong accuracy, yet they remain opaque: when an edge is flagged, the analyst receives a score but no reason. T…
Hyperbolic Graph Embeddings: a Survey and an Evaluation on Anomaly Detection
Souhail Abdelmouaiz Sadat, Mohamed Yacine Touahria Miliani, Khadidja Hab El Hames +2
This survey reviews hyperbolic graph embedding models, and evaluate them on anomaly detection, highlighting their advantages over Euclidean methods in capturing complex structures.…
An Evaluation Tool for Backbone Extraction Techniques in Weighted Complex Networks
Ali Yassin, Abbas Haidar, Hocine Cherifi +2
Networks are essential for analyzing complex systems. However, their growing size necessitates backbone extraction techniques aimed at reducing their size while retaining critical…
CONTINUUM: Detecting APT Attacks through Spatial-Temporal Graph Neural Networks
Atmane Ayoub Mansour Bahar, Kamel Soaid Ferrahi, Mohamed-Lamine Messai +2
Advanced Persistent Threats (APTs) represent a significant challenge in cybersecurity due to their sophisticated and stealthy nature. Traditional Intrusion Detection Systems (IDS)…
Hypergraphs with Polynomial Representation: Introducing -splits
François Pitois, Mohammed Haddad, Hamida Seba +1
Inspired by the split decomposition of graphs and rank-width, we introduce the notion of -splits. We focus on the family of -splits of a graph of order , and we prove that…
A Neighborhood-preserving Graph Summarization
Abd Errahmane Kiouche, Julien Baste, Mohammed Haddad +1
We introduce in this paper a new summarization method for large graphs. Our summarization approach retains only a user-specified proportion of the neighbors of each node in the gra…
Short Paper: Privacy Comparison of Contact Tracing Mobile Applications for COVID-19
Mohamed-Lamine Messai, Hamida Seba
With the COVID-19 pandemic, quarantines took place across the globe. In the aim of stopping or slowing the progression of the COVID-19 contamination, many countries have deployed a…
Compact Neighborhood Index for Subgraph Queries in Massive Graphs
C. Nabti, T. Mecharnia, S. E. Boukhetta +2
Subgraph queries also known as subgraph isomorphism search is a fundamental problem in querying graph-like structured data. It consists to enumerate the subgraphs of a data graph t…
Comparison Issues in Large Graphs: State of the Art and Future Directions
Hamida Seba, Sofiane Lagraa, Elsen Ronando
Graph comparison is fundamentally important for many applications such as the analysis of social networks and biological data and has been a significant research area in the patter…