Sakkarapani, Krishnaveni
Unknown Affiliation

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

Improved half-maximal inhibitory concentration regression model using amyotrophic lateral sclerosis data Selvaraj, Devipriya; M S, Vijaya; Sakkarapani, Krishnaveni
Bulletin of Electrical Engineering and Informatics Vol 14, No 3: June 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/eei.v14i3.8520

Abstract

The current research addresses the critical need for precise half-maximal inhibitory concentration regression in the neurodegenerative condition amyotrophic lateral sclerosis (ALS). Unavailable drug-induced gene expressions and irrelevant molecular descriptors have yielded regression models with less accuracy using traditional machine learning (ML). Drugs can be converted to graph format and integrated with gene expressions to learn drug-gene interactions better thereby producing precise half-maximal inhibitory concentration regression models. To accomplish this, three variants of graph neural networks (GNN) namely graph attention networks (GAT), message passing neural networks, and graph isomorphism networks are utilized in the proposed work. The gene expression profiles of ALS drugrelated genes were retrieved from the DepMap PRISM drug repurposing hub, and the drug graphs with their accompanying half-maximal inhibitory concentration values were obtained from the ChEMBL databases. The graph is constructed for ninety approved drugs connected to 32 key protein targets of ALS and its related conditions. The half-maximal inhibitory concentration regression model trained with optimized hyperparameters in GAT performs well with an R2 score of 0.92, a mean absolute error (MAE) of 0.20, and a root mean square error (RMSE) of 0.17. This model produced better results than other ML and deep learning models.
Evaluating the detected communities using traditional algorithms on keyword co-occurrence networks R., Kiruthika; Sakkarapani, Krishnaveni
IAES International Journal of Artificial Intelligence (IJ-AI) Vol 15, No 1: February 2026
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijai.v15.i1.pp919-928

Abstract

Community detection is one of the most significant research areas in network analysis, which helps to understand the internal structure of large networks. This work utilizes the traditional community detection methods on a keyword co-occurrence graph derived from the Scopus bibliographic database. This research article primarily focused on the index keywords of deep learning driven publications obtained from three major network Scopus bibliometric datasets (SBD), namely SBD_1 as 2006-2013, SBD_2 as 2014-2016, and SBD_3 as 2017. For this proposed model framework, the existing traditional algorithms, including Louvain, greedy modularity optimization (GMO), Leiden, Infomap, speaker-listener label propagation algorithm (SLPA), Walktrap, SpinGlass, K-Clique, and Clauset, Newman and Moore (CNM) methods are applied to detect communities from the network and carried out through Python. Comparisons among these algorithms, Leiden, SpinGlass, and Louvain are considered as better algorithms for our work based on the detected communities, modularity score and other metrics to evaluate the performance of detected communities from the network. This research proposes an ideology for the selection process of algorithms that depends on different factors like network characteristics, network structure, dataset size, and computational efficiency. This analysis suggests a unique perspective on the effectiveness of each method in the Scopus bibliometric network and its potential to enhance research topic exploration.