Falih Gozi Febrinanto
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Falih Gozi Febrinanto has a total of 32 co-authors. Here are the top co-authors by number of shared publications:
- Feng Xia
School of Computing Technologies, RMIT University
10 shared publications - Mujie Liu
Institute of Innovation, Science and Sustainability, Federation University Australia, Ballarat, VIC, Australia
5 shared publications - Jiangang Ma
Institute of Innovation, Science and Sustainability Federation University Australia 3353 Ballarat Australia
4 shared publications - Vidya Saikrishna
Federation University Australia, Ballarat, Australia
4 shared publications - Chandra Thapa
DATA61, CSIRO
3 shared publications - Azadeh Noori Hoshyar
Federation University Australia
2 shared publications
Latest Publications
- Open Access
- 31 December 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 307
SIGNL: A label-efficient audio deepfake detection system via spectral-temporal graph non-contrastive learning
- 31 December 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 307
Open AccessSIGNL: A label-efficient audio deepfake detection system via spectral-temporal graph non-contrastive learning
- 17 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. PP, 1-13
GraphDART: Graph Distillation for Efficient Advanced Persistent Threat Detection
Cyber–physical–social systems (CPSSs) have emerged in many applications over recent decades, requiring increased attention to security concerns. The rise of sophisticated threats such as advanced persistent threats (APTs) makes ensuring security in CPSSs particularly challenging. Provenance graph analysis has proven effective for tracing and detecting anomalies within systems, but the sheer size and complexity of these graphs hinder the efficiency of existing methods, especially those relying on graph neural networks (GNNs). To address these challenges, we present GraphDART, a modular framework designed to distill provenance graphs into compact yet informative representations, enabling scalable and effective anomaly detection. GraphDART can take advantage of diverse graph distillation techniques, including classic and modern graph distillation methods, to condense large provenance graphs while preserving essential structural and contextual information. This approach significantly reduces computational overhead, allowing GNNs to learn from distilled graphs efficiently and enhance detection performance. Extensive evaluations on benchmark datasets demonstrate the robustness of GraphDART in detecting malicious activities across CPSSs. By optimizing computational efficiency, GraphDART provides a scalable and practical solution to safeguard interconnected environments against APTs.
- 17 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. PP, 1-13
GraphDART: Graph Distillation for Efficient Advanced Persistent Threat Detection
Cyber–physical–social systems (CPSSs) have emerged in many applications over recent decades, requiring increased attention to security concerns. The rise of sophisticated threats such as advanced persistent threats (APTs) makes ensuring security in CPSSs particularly challenging. Provenance graph analysis has proven effective for tracing and detecting anomalies within systems, but the sheer size and complexity of these graphs hinder the efficiency of existing methods, especially those relying on graph neural networks (GNNs). To address these challenges, we present GraphDART, a modular framework designed to distill provenance graphs into compact yet informative representations, enabling scalable and effective anomaly detection. GraphDART can take advantage of diverse graph distillation techniques, including classic and modern graph distillation methods, to condense large provenance graphs while preserving essential structural and contextual information. This approach significantly reduces computational overhead, allowing GNNs to learn from distilled graphs efficiently and enhance detection performance. Extensive evaluations on benchmark datasets demonstrate the robustness of GraphDART in detecting malicious activities across CPSSs. By optimizing computational efficiency, GraphDART provides a scalable and practical solution to safeguard interconnected environments against APTs.
- Open Access
- 7 August 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Intelligent Systems and Technology
Entropy Causal Graphs for Multivariate Time Series Anomaly Detection
Many multivariate time series anomaly detection frameworks have been proposed and widely applied. However, most of these frameworks do not consider intrinsic relationships between variables in multivariate time series data, thus ignoring the causal relationship among variables and degrading anomaly detection performance. This work proposes a novel framework called CGAD, an entropy Causal Graph for multivariate time series Anomaly Detection. CGAD utilizes transfer entropy to construct graph structures that unveil the underlying causal relationships among time series data. Weighted graph convolutional networks combined with causal convolutions are employed to model both the causal graph structures and the temporal patterns within multivariate time series data. Furthermore, CGAD applies anomaly scoring, leveraging median absolute deviation-based normalization to improve the robustness of the anomaly identification process. Extensive experiments demonstrate that CGAD outperforms state-of-the-art methods on real-world datasets with a 9% average improvement in terms of three different multivariate time series anomaly detection metrics.
- 7 August 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Intelligent Systems and Technology
Open AccessEntropy Causal Graphs for Multivariate Time Series Anomaly Detection
Many multivariate time series anomaly detection frameworks have been proposed and widely applied. However, most of these frameworks do not consider intrinsic relationships between variables in multivariate time series data, thus ignoring the causal relationship among variables and degrading anomaly detection performance. This work proposes a novel framework called CGAD, an entropy Causal Graph for multivariate time series Anomaly Detection. CGAD utilizes transfer entropy to construct graph structures that unveil the underlying causal relationships among time series data. Weighted graph convolutional networks combined with causal convolutions are employed to model both the causal graph structures and the temporal patterns within multivariate time series data. Furthermore, CGAD applies anomaly scoring, leveraging median absolute deviation-based normalization to improve the robustness of the anomaly identification process. Extensive experiments demonstrate that CGAD outperforms state-of-the-art methods on real-world datasets with a 9% average improvement in terms of three different multivariate time series anomaly detection metrics.
- Open Access
Rehearsal with Auxiliary-Informed Sampling for Audio Deepfake Detection
The performance of existing audio deepfake detection frameworks degrades when confronted with new deepfake attacks. Rehearsal-based continual learning (CL), which updates models using a limited set of old data samples, helps preserve prior knowledge while incorporating new information. However, existing rehearsal techniques don't effectively capture the diversity of audio characteristics, introducing bias and increasing the risk of forgetting. To address this challenge, we propose Rehearsal with Auxiliary-Informed Sampling (RAIS), a rehearsal-based CL approach for audio deepfake detection. RAIS employs a label generation network to produce auxiliary labels, guiding diverse sample selection for the memory buffer. Extensive experiments show RAIS outperforms state-of-the-art methods, achieving an average Equal Error Rate (EER) of 1.953 % across five experiences. The code is available at: https://github.com/falihgoz/RAIS.
Open AccessRehearsal with Auxiliary-Informed Sampling for Audio Deepfake Detection
The performance of existing audio deepfake detection frameworks degrades when confronted with new deepfake attacks. Rehearsal-based continual learning (CL), which updates models using a limited set of old data samples, helps preserve prior knowledge while incorporating new information. However, existing rehearsal techniques don't effectively capture the diversity of audio characteristics, introducing bias and increasing the risk of forgetting. To address this challenge, we propose Rehearsal with Auxiliary-Informed Sampling (RAIS), a rehearsal-based CL approach for audio deepfake detection. RAIS employs a label generation network to produce auxiliary labels, guiding diverse sample selection for the memory buffer. Extensive experiments show RAIS outperforms state-of-the-art methods, achieving an average Equal Error Rate (EER) of 1.953 % across five experiences. The code is available at: https://github.com/falihgoz/RAIS.
- Open Access
- 3 May 2025
- Published by Springer Nature in Artificial Intelligence Review
- Vol. 58 (8) , 1-21
Refined causal graph structure learning via curvature for brain disease classification
Graph neural networks (GNNs) have been developed to model the relationship between regions of interest (ROIs) in brains and have shown significant improvement in detecting brain diseases. However, most of these frameworks do not consider the intrinsic relationship of causality factor between brain ROIs, which is arguably more essential to observe cause and effect interaction between signals rather than typical correlation values. We propose a novel framework called Causal Graphs for Brains (CGB) for brain disease classification/detection, which models refined brain networks based on the causal discovery method, transfer entropy, and geometric curvature strategy. CGB unveils causal relationships between ROIs that bring vital information to enhance brain disease classification performance. Furthermore, CGB also performs a graph rewiring through a geometric curvature strategy to refine the generated causal graph to become more expressive and reduce potential information bottlenecks when GNNs model it. Our extensive experiments show that CGB outperforms state-of-the-art methods in classification tasks on brain disease datasets, as measured by average F1 scores.
- 3 May 2025
- Published by Springer Nature in Artificial Intelligence Review
- Vol. 58 (8) , 1-21
Open AccessRefined causal graph structure learning via curvature for brain disease classification
Graph neural networks (GNNs) have been developed to model the relationship between regions of interest (ROIs) in brains and have shown significant improvement in detecting brain diseases. However, most of these frameworks do not consider the intrinsic relationship of causality factor between brain ROIs, which is arguably more essential to observe cause and effect interaction between signals rather than typical correlation values. We propose a novel framework called Causal Graphs for Brains (CGB) for brain disease classification/detection, which models refined brain networks based on the causal discovery method, transfer entropy, and geometric curvature strategy. CGB unveils causal relationships between ROIs that bring vital information to enhance brain disease classification performance. Furthermore, CGB also performs a graph rewiring through a geometric curvature strategy to refine the generated causal graph to become more expressive and reduce potential information bottlenecks when GNNs model it. Our extensive experiments show that CGB outperforms state-of-the-art methods in classification tasks on brain disease datasets, as measured by average F1 scores.
- Open Access
GraphDART: Graph Distillation for Efficient Advanced Persistent Threat Detection
Cyber-physical-social systems (CPSSs) have emerged in many applications over recent decades, requiring increased attention to security concerns. The rise of sophisticated threats like Advanced Persistent Threats (APTs) makes ensuring security in CPSSs particularly challenging. Provenance graph analysis has proven effective for tracing and detecting anomalies within systems, but the sheer size and complexity of these graphs hinder the efficiency of existing methods, especially those relying on graph neural networks (GNNs). To address these challenges, we present GraphDART, a modular framework designed to distill provenance graphs into compact yet informative representations, enabling scalable and effective anomaly detection. GraphDART can take advantage of diverse graph distillation techniques, including classic and modern graph distillation methods, to condense large provenance graphs while preserving essential structural and contextual information. This approach significantly reduces computational overhead, allowing GNNs to learn from distilled graphs efficiently and enhance detection performance. Extensive evaluations on benchmark datasets demonstrate the robustness of GraphDART in detecting malicious activities across cyber-physical-social systems. By optimizing computational efficiency, GraphDART provides a scalable and practical solution to safeguard interconnected environments against APTs.
Open AccessGraphDART: Graph Distillation for Efficient Advanced Persistent Threat Detection
Cyber-physical-social systems (CPSSs) have emerged in many applications over recent decades, requiring increased attention to security concerns. The rise of sophisticated threats like Advanced Persistent Threats (APTs) makes ensuring security in CPSSs particularly challenging. Provenance graph analysis has proven effective for tracing and detecting anomalies within systems, but the sheer size and complexity of these graphs hinder the efficiency of existing methods, especially those relying on graph neural networks (GNNs). To address these challenges, we present GraphDART, a modular framework designed to distill provenance graphs into compact yet informative representations, enabling scalable and effective anomaly detection. GraphDART can take advantage of diverse graph distillation techniques, including classic and modern graph distillation methods, to condense large provenance graphs while preserving essential structural and contextual information. This approach significantly reduces computational overhead, allowing GNNs to learn from distilled graphs efficiently and enhance detection performance. Extensive evaluations on benchmark datasets demonstrate the robustness of GraphDART in detecting malicious activities across cyber-physical-social systems. By optimizing computational efficiency, GraphDART provides a scalable and practical solution to safeguard interconnected environments against APTs.
- Open Access
- 1 January 2025
- Published by Emerald Publishing in Foundations and Trends® in Signal Processing
- Vol. 19 (4) , 371-551
Graph Learning
Publishers of Foundations and Trends, making research accessible
- 1 January 2025
- Published by Emerald Publishing in Foundations and Trends® in Signal Processing
- Vol. 19 (4) , 371-551
Open AccessGraph Learning
Publishers of Foundations and Trends, making research accessible
- 20 November 2024
- Published by Springer Nature
- p. 376-389
Motif-Induced Subgraph Generative Learning for Explainable Neurological Disorder Detection
- 20 November 2024
- Published by Springer Nature
- p. 376-389
Motif-Induced Subgraph Generative Learning for Explainable Neurological Disorder Detection
- Open Access
Motif-induced Subgraph Generative Learning for Explainable Neurological Disorder Detection
The wide variation in symptoms of neurological disorders among patients necessitates uncovering individual pathologies for accurate clinical diagnosis and treatment. Current methods attempt to generalize specific biomarkers to explain individual pathology, but they often lack analysis of the underlying pathogenic mechanisms, leading to biased biomarkers and unreliable diagnoses. To address this issue, we propose a motif-induced subgraph generative learning model (MSGL), which provides multi-tiered biomarkers and facilitates explainable diagnoses of neurological disorders. MSGL uncovers underlying pathogenic mechanisms by exploring representative connectivity patterns within brain net-works, offering motif-level biomarkers to tackle the challenge of clinical heterogeneity. Furthermore, it utilizes motif-induced information to generate enhanced brain network subgraphs as personalized biomarkers for identifying individual pathology. Experimental results demonstrate that MSGL outperforms baseline models. The identified biomarkers align with recent neuroscientific findings, enhancing their clinical applicability.
Open AccessMotif-induced Subgraph Generative Learning for Explainable Neurological Disorder Detection
The wide variation in symptoms of neurological disorders among patients necessitates uncovering individual pathologies for accurate clinical diagnosis and treatment. Current methods attempt to generalize specific biomarkers to explain individual pathology, but they often lack analysis of the underlying pathogenic mechanisms, leading to biased biomarkers and unreliable diagnoses. To address this issue, we propose a motif-induced subgraph generative learning model (MSGL), which provides multi-tiered biomarkers and facilitates explainable diagnoses of neurological disorders. MSGL uncovers underlying pathogenic mechanisms by exploring representative connectivity patterns within brain net-works, offering motif-level biomarkers to tackle the challenge of clinical heterogeneity. Furthermore, it utilizes motif-induced information to generate enhanced brain network subgraphs as personalized biomarkers for identifying individual pathology. Experimental results demonstrate that MSGL outperforms baseline models. The identified biomarkers align with recent neuroscientific findings, enhancing their clinical applicability.
- Open Access
Balanced Graph Structure Information for Brain Disease Detection
Analyzing connections between brain regions of interest (ROI) is vital to detect neurological disorders such as autism or schizophrenia. Recent advancements employ graph neural networks (GNNs) to utilize graph structures in brains, improving detection performances. Current methods use correlation measures between ROI's blood-oxygen-level-dependent (BOLD) signals to generate the graph structure. Other methods use the training samples to learn the optimal graph structure through end-to-end learning. However, implementing those methods independently leads to some issues with noisy data for the correlation graphs and overfitting problems for the optimal graph. In this work, we proposed Bargrain (balanced graph structure for brains), which models two graph structures: filtered correlation matrix and optimal sample graph using graph convolution networks (GCNs). This approach aims to get advantages from both graphs and address the limitations of only relying on a single type of structure. Based on our extensive experiment, Bargrain outperforms state-of-the-art methods in classification tasks on brain disease datasets, as measured by average F1 scores.
Open AccessBalanced Graph Structure Information for Brain Disease Detection
Analyzing connections between brain regions of interest (ROI) is vital to detect neurological disorders such as autism or schizophrenia. Recent advancements employ graph neural networks (GNNs) to utilize graph structures in brains, improving detection performances. Current methods use correlation measures between ROI's blood-oxygen-level-dependent (BOLD) signals to generate the graph structure. Other methods use the training samples to learn the optimal graph structure through end-to-end learning. However, implementing those methods independently leads to some issues with noisy data for the correlation graphs and overfitting problems for the optimal graph. In this work, we proposed Bargrain (balanced graph structure for brains), which models two graph structures: filtered correlation matrix and optimal sample graph using graph convolution networks (GCNs). This approach aims to get advantages from both graphs and address the limitations of only relying on a single type of structure. Based on our extensive experiment, Bargrain outperforms state-of-the-art methods in classification tasks on brain disease datasets, as measured by average F1 scores.