RMRashmi Nagawara Muralinath

Rashmi Nagawara Muralinath

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Rashmi Nagawara Muralinath has a total of 3 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Metastable Substructure Embedding and Robust Classification of Multichannel EEG Data Using Spectral Graph Kernels

    by Rashmi N. Muralinath, Vishwambhar Pathak, Prabhat K. Mahanti

    Classification of neurocognitive states from Electroencephalography (EEG) data is complex due to inherent challenges such as noise, non-stationarity, non-linearity, and the high-dimensional and sparse nature of connectivity patterns. Graph-theoretical approaches provide a powerful framework for analysing the latent state dynamics using connectivity measures across spatio-temporal-spectral dimensions. This study applies the graph Koopman embedding kernels (GKKE) method to extract latent neuro-markers of seizures from epileptiform EEG activity. EEG-derived graphs were constructed using correlation and mean phase locking value (mPLV), with adjacency matrices generated via threshold-binarised connectivity. Graph kernels, including Random Walk, Weisfeiler–Lehman (WL), and spectral-decomposition (SD) kernels, were evaluated for latent space feature extraction by approximating Koopman spectral decomposition. The potential of graph Koopman embeddings in identifying latent metastable connectivity structures has been demonstrated with empirical analyses. The robustness of these features was evaluated using classifiers such as Decision Trees, Support Vector Machine (SVM), and Random Forest, on Epilepsy-EEG from the Children’s Hospital Boston’s (CHB)-MIT dataset and cognitive-load-EEG datasets from online repositories. The classification workflow combining mPLV connectivity measure, WL graph Koopman kernel, and Decision Tree (DT) outperformed the alternative combinations, particularly considering the accuracy (91.7%) and F1-score (88.9%), The comparative investigation presented in results section convinces that employing cost-sensitive learning improved the F1-score for the mPLV-WL-DT workflow to 91% compared to 88.9% without cost-sensitive learning. This work advances EEG-based neuro-marker estimation, facilitating reliable assistive tools for prognosis and cognitive training protocols.


  • Open Access

    Optimizing Spectral Graph Kernels for Time-Delay Embedding of Multichannel EEG Data

    by Rashmi Nagawara Muralinath, Vishwambhar Pathak, Prabhat K. Mahanti

    The task of determining the dynamic patterns of causal connectivity among brain regions from EEG data is challenging due to inherent noise in EEG signals, sparse connections. High volume and dimensionality of data add substantial computational demands. Koopman embedding kernels offer a promising approach for capturing the low-dimensional linear embeddings of complex nonlinear system dynamics. This study focuses on leveraging the Graph Kernel Koopman Embedding (GKKE) method to extract latent factors, a novel application within the realm of EEG analysis. Specifically, the research pioneers the adaptation of the GKKE algorithm to estimate the inherent connectivity substructures, that enable investigations of the neuro-markers of cognitive load states and disorders like seizures from EEG signals. The graph for each segment was constructed by computing the correlation coefficients among the channel pairs. The algorithmic workflow was applied to a labelled cognitive load dataset from an online repository. The features were extracted in terms of Koopman-spectral decomposed clusters of eigenfunctions of the gram matrices produced by two different graph kernels applied for approximation of the Koopman operator over each EEG-segment. These features, representing the latent metastable states, were fed into machine learning classifiers, including SVM and Random Forest, and Decision Tree classifiers. Weisfeiler-Lehman Kernel (WL)-Kernel yielded an average accuracy of around 84% for all the classifiers and outperformed the Random-walk kernel. The significance of this work lies in its pioneering use of graph Koopman spectral decomposition-based low-dimensional embedding of the metastable structures of connectivity to provide an algorithm that enables neuro-marker estimation. Specific contribution is the workflow that determines the optimal combination of the graph kernel and classifier ensemble. This equips deeper understanding of the connectivity dynamics of brain regions related to cognitive states offers a new avenue for prognosis and training protocols to improve cognitive states.