Asara Senaratne
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Asara Senaratne has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Graham Williams
Australian National University, Canberra, Australia
3 shared publications - Peter Christen
School of Computing, Australian National University
3 shared publications - Pouya Ghiasnezhad Omran
School of Computing, Australian National University
3 shared publications - Alistair Cowan Macvicar2 shared publications
- Leelanga Seneviratne
University of Moratuwa
2 shared publications - Matthew Stephenson
Flinders University
2 shared publications
Latest Publications
- Open Access
- 29 August 2026
- Published by Elsevier in SSRN Electronic Journal
Machine Learning Approaches for Multi-Horizon and Distributed System Photovoltaic Forecasting
Optimising energy use and storage from PV panels requires accurate solar forecasting. This paper compares machine learning approaches for two practical PV forecasting settings: multi-horizon prediction and distributed-system forecasting. Through this research, we aim to address the problem of implementing complex prediction techniques in micro-grid operations by comparing the performance of different approaches and levels of data availability. Experiments on a three-building Flinders University dataset show that temporal features dominate single-site accuracy, LSTM models perform best at the 1-hour horizon, and simpler horizon-conditioned or discrete strategies remain close to specialised references at longer horizons. For distributed forecasting, spatial analysis finds no exploitable lead-lag signal at hourly resolution among the three-building system. Graph-based models instead provide their strongest benefit in cold-start settings, where shared representations give strong zero-shot performance for new PV systems.
- 29 August 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessMachine Learning Approaches for Multi-Horizon and Distributed System Photovoltaic Forecasting
Optimising energy use and storage from PV panels requires accurate solar forecasting. This paper compares machine learning approaches for two practical PV forecasting settings: multi-horizon prediction and distributed-system forecasting. Through this research, we aim to address the problem of implementing complex prediction techniques in micro-grid operations by comparing the performance of different approaches and levels of data availability. Experiments on a three-building Flinders University dataset show that temporal features dominate single-site accuracy, LSTM models perform best at the 1-hour horizon, and simpler horizon-conditioned or discrete strategies remain close to specialised references at longer horizons. For distributed forecasting, spatial analysis finds no exploitable lead-lag signal at hourly resolution among the three-building system. Graph-based models instead provide their strongest benefit in cold-start settings, where shared representations give strong zero-shot performance for new PV systems.
- Open Access
- 22 July 2026
- Published by Elsevier in SSRN Electronic Journal
Machine Learning Approaches for Multi-Horizon and Distributed System Photovoltaic Forecasting
Optimising energy use and storage from PV panels requires accurate solar forecasting. This paper compares machine learning approaches for two practical PV forecasting settings: multi-horizon prediction and distributed-system forecasting. Through this research, we aim to address the problem of implementing complex prediction techniques in micro-grid operations by comparing the performance of different approaches and levels of data availability. Experiments on a three-building Flinders University dataset show that temporal features dominate single-site accuracy, LSTM models perform best at the 1-hour horizon, and simpler horizon-conditioned or discrete strategies remain close to specialised references at longer horizons. For distributed forecasting, spatial analysis finds no exploitable lead-lag signal at hourly resolution among the three-building system. Graph-based models instead provide their strongest benefit in cold-start settings, where shared representations give strong zero-shot performance for new PV systems.
- 22 July 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessMachine Learning Approaches for Multi-Horizon and Distributed System Photovoltaic Forecasting
Optimising energy use and storage from PV panels requires accurate solar forecasting. This paper compares machine learning approaches for two practical PV forecasting settings: multi-horizon prediction and distributed-system forecasting. Through this research, we aim to address the problem of implementing complex prediction techniques in micro-grid operations by comparing the performance of different approaches and levels of data availability. Experiments on a three-building Flinders University dataset show that temporal features dominate single-site accuracy, LSTM models perform best at the 1-hour horizon, and simpler horizon-conditioned or discrete strategies remain close to specialised references at longer horizons. For distributed forecasting, spatial analysis finds no exploitable lead-lag signal at hourly resolution among the three-building system. Graph-based models instead provide their strongest benefit in cold-start settings, where shared representations give strong zero-shot performance for new PV systems.
- 13 February 2026
- Published by Springer Nature
- p. 454-469
ETCOD: Embedding-Based Anomaly Detection and LLM-Driven Validation Framework for Knowledge Graphs
- 13 February 2026
- Published by Springer Nature
- p. 454-469
ETCOD: Embedding-Based Anomaly Detection and LLM-Driven Validation Framework for Knowledge Graphs
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 169436-169456
A Cloud-Native Framework for Explainable Machine Learning in Sleep-Health Research
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 169436-169456
Open AccessA Cloud-Native Framework for Explainable Machine Learning in Sleep-Health Research
- Open Access
Anomaly Detection and Classification in Knowledge Graphs
Anomalies such as redundant, inconsistent, contradictory, and deficient values in a Knowledge Graph (KG) are unavoidable, as these graphs are often curated manually, or extracted using machine learning and natural language processing techniques. Therefore, anomaly detection is a task that can enhance the quality of KGs. In this paper, we propose SEKA (SEeking Knowledge graph Anomalies), an unsupervised approach for the detection of abnormal triples and entities in KGs. SEKA can help improve the correctness of a KG whilst retaining its coverage. We propose an adaption of the Path Rank Algorithm (PRA), named the Corroborative Path Rank Algorithm (CPRA), which is an efficient adaptation of PRA that is customized to detect anomalies in KGs. Furthermore, we also present TAXO (TAXOnomy of anomaly types in KGs), a taxonomy of possible anomaly types that can occur in a KG. This taxonomy provides a classification of the anomalies discovered by SEKA with an extensive discussion of possible data quality issues in a KG. We evaluate both approaches using the four real-world KGs YAGO-1, KBpedia, Wikidata, and DSKG to demonstrate the ability of SEKA and TAXO to outperform the baselines.
Open AccessAnomaly Detection and Classification in Knowledge Graphs
Anomalies such as redundant, inconsistent, contradictory, and deficient values in a Knowledge Graph (KG) are unavoidable, as these graphs are often curated manually, or extracted using machine learning and natural language processing techniques. Therefore, anomaly detection is a task that can enhance the quality of KGs. In this paper, we propose SEKA (SEeking Knowledge graph Anomalies), an unsupervised approach for the detection of abnormal triples and entities in KGs. SEKA can help improve the correctness of a KG whilst retaining its coverage. We propose an adaption of the Path Rank Algorithm (PRA), named the Corroborative Path Rank Algorithm (CPRA), which is an efficient adaptation of PRA that is customized to detect anomalies in KGs. Furthermore, we also present TAXO (TAXOnomy of anomaly types in KGs), a taxonomy of possible anomaly types that can occur in a KG. This taxonomy provides a classification of the anomalies discovered by SEKA with an extensive discussion of possible data quality issues in a KG. We evaluate both approaches using the four real-world KGs YAGO-1, KBpedia, Wikidata, and DSKG to demonstrate the ability of SEKA and TAXO to outperform the baselines.
- Open Access
- 30 April 2023
- Published by Association for Computing Machinery (ACM)
- p. 568-572
SEKA: Seeking Knowledge Graph Anomalies
Knowledge Graphs (KGs) form the backbone of many knowledge dependent applications such as search engines and digital personal assistants. KGs are generally constructed either manually or automatically using a variety of extraction techniques applied over multiple data sources. Due to the diverse quality of these data sources, there are likely anomalies introduced into any KG. Hence, it is unrealistic to expect a perfect archive of knowledge. Given how large KGs can be, manual validation is impractical, necessitating an automated approach for anomaly detection in KGs. To improve KG quality, and to identify interesting and abnormal triples (edges) and entities (nodes) that are worth investigating, we introduce SEKA, a novel unsupervised approach to detect anomalous triples and entities in a KG using both the structural characteristics and the content of edges and nodes of the graph. While an anomaly can be an interesting or unusual discovery, such as a fraudulent transaction requiring human intervention, anomaly detection can also identify potential errors. We propose a novel approach named Corroborative Path Algorithm to generate a matrix of semantic features, which we then use to train a one-class Support Vector Machine to identify abnormal triples and entities with no dependency on external sources. We evaluate our approach on four real-world KGs demonstrating the ability of SEKA to detect anomalies, and to outperform comparative baselines.
- 30 April 2023
- Published by Association for Computing Machinery (ACM)
- p. 568-572
Open AccessSEKA: Seeking Knowledge Graph Anomalies
Knowledge Graphs (KGs) form the backbone of many knowledge dependent applications such as search engines and digital personal assistants. KGs are generally constructed either manually or automatically using a variety of extraction techniques applied over multiple data sources. Due to the diverse quality of these data sources, there are likely anomalies introduced into any KG. Hence, it is unrealistic to expect a perfect archive of knowledge. Given how large KGs can be, manual validation is impractical, necessitating an automated approach for anomaly detection in KGs. To improve KG quality, and to identify interesting and abnormal triples (edges) and entities (nodes) that are worth investigating, we introduce SEKA, a novel unsupervised approach to detect anomalous triples and entities in a KG using both the structural characteristics and the content of edges and nodes of the graph. While an anomaly can be an interesting or unusual discovery, such as a fraudulent transaction requiring human intervention, anomaly detection can also identify potential errors. We propose a novel approach named Corroborative Path Algorithm to generate a matrix of semantic features, which we then use to train a one-class Support Vector Machine to identify abnormal triples and entities with no dependency on external sources. We evaluate our approach on four real-world KGs demonstrating the ability of SEKA to detect anomalies, and to outperform comparative baselines.
- Open Access
- 28 December 2022
- Published by Association for Computing Machinery (ACM) in Journal of Data and Information Quality
- Vol. 15 (1) , 1-37
Unsupervised Identification of Abnormal Nodes and Edges in Graphs
Much of today’s data are represented as graphs, ranging from social networks to bibliographic citations. Nodes in such graphs correspond to records that generally represent entities, while edges represent relationships between these entities. Both nodes and edges in a graph can have attributes that characterize the entities and their relationships. Relationships are either explicitly known (like friends in a social network), or they are inferred using link prediction (such as two babies are siblings because they have the same mother). Any graph representing real-world data likely contains nodes and edges that are abnormal, and identifying these can be important for outlier detection in applications ranging from crime and fraud detection to viral marketing. We propose a novel approach to the unsupervised detection of abnormal nodes and edges in graphs. We first characterize nodes and edges using a set of features, and then employ a one-class classifier to identify abnormal nodes and edges. We extract patterns of features from these abnormal nodes and edges, and apply clustering to identify groups of patterns with similar characteristics. We finally visualize these abnormal patterns to show co-occurrences of features and relationships between those features that mostly influence the abnormality of nodes and edges. We evaluate our approach on datasets from diverse domains, including historical birth certificates, COVID patient records, e-mails, books, and movies. This evaluation demonstrates that our approach is well suited to identify both abnormal nodes and edges in graphs in an unsupervised way, and it can outperform several baseline anomaly detection techniques.
- 28 December 2022
- Published by Association for Computing Machinery (ACM) in Journal of Data and Information Quality
- Vol. 15 (1) , 1-37
Open AccessUnsupervised Identification of Abnormal Nodes and Edges in Graphs
Much of today’s data are represented as graphs, ranging from social networks to bibliographic citations. Nodes in such graphs correspond to records that generally represent entities, while edges represent relationships between these entities. Both nodes and edges in a graph can have attributes that characterize the entities and their relationships. Relationships are either explicitly known (like friends in a social network), or they are inferred using link prediction (such as two babies are siblings because they have the same mother). Any graph representing real-world data likely contains nodes and edges that are abnormal, and identifying these can be important for outlier detection in applications ranging from crime and fraud detection to viral marketing. We propose a novel approach to the unsupervised detection of abnormal nodes and edges in graphs. We first characterize nodes and edges using a set of features, and then employ a one-class classifier to identify abnormal nodes and edges. We extract patterns of features from these abnormal nodes and edges, and apply clustering to identify groups of patterns with similar characteristics. We finally visualize these abnormal patterns to show co-occurrences of features and relationships between those features that mostly influence the abnormality of nodes and edges. We evaluate our approach on datasets from diverse domains, including historical birth certificates, COVID patient records, e-mails, books, and movies. This evaluation demonstrates that our approach is well suited to identify both abnormal nodes and edges in graphs in an unsupervised way, and it can outperform several baseline anomaly detection techniques.