VRVijay Raghavan

Vijay Raghavan

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Vijay Raghavan has a total of 57 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • SSE-TSR: An Approach to Integrate Secondary Structure Elements Into Triangular Spatial Relationships for Protein Classification

    by Poorya Khajouie, Titli Sarkar, Krishna Rauniyar, Li Chen, Wu Xu, Vijay Raghavan

    Protein structures are fundamental to understanding biological function, yet many detailed similarities remain hidden from conventional alignment-based or 3D superposition methods. Triangular Spatial Relationship (TSR) offers an alignment-free encoding of backbone geometry; however, classical TSR ignores the context of secondary structure elements (SSEs), such as helices, strands, and coils. To address this, we introduce SSE-TSR, which enriches each TSR key by categorizing it into one of 18 helix-strand-coil combination labels derived from DSSP-style annotations in PDB HELIX/SHEET records. By mapping the protein representation involving SSE-TSR keys into a sparse tensor, SSE-TSR compactly captures both tertiary geometry and local secondary motifs. We evaluated SSE-TSR on four datasets, two structural (CATH-based, 9.2K; SCOP-based, 7.0K) and two functional (published, 7.8K; new, 7.2K), using a 3D convolutional neural network. On structure-based tasks, SSETSR noticeably boosts accuracy from 96.00% to 98.33% (CATHbased) and from 95.46% to 99.00% (SCOP-based). On functional tasks, it yields modest yet consistent gains (e.g., from 99.41% to 99.50% and 95.83% to 98.83%). Comparisons to Foldseek confirm competitive accuracy across diverse tasks. Additionally, the sparse tensor representation enables memory-efficient handling of large-scale datasets, making SSE-TSR practical for extensive bioinformatics analyses. These results demonstrate SSE-TSR as a scalable, interpretable, and robust method, enhancing protein classification and structural bioinformatics.

  • Open Access

    Simple and Efficient Pruning and Indexing for Top-n Angle-Based Outlier Detection

    by Shaaban M. Abbady, Mehmet Engin Tozal, Vijay V. Raghavan

  • Detecting Anomalous Links in Networked Systems Exhibiting Scale-Free-Like Behaviors

    by Mehedi Hassan, Mehmet Engin Tozal, Vipin Swarup, Steven Noel, Raju Gottumukkala, Vijay Raghavan

    Anomaly detection acts as the first line of defense against cyber-attacks to ensure the security and integrity of networked systems. Recent anomaly detection techniques employ dynamic graph representations to capture the complex interactions in networked systems that evolve over time. However, many existing methods focus on identifying anomalous node behavior and often rely on additional information, such as node features, node attributes, and edge features to detect them effectively. In this study, we propose a probabilistic approach to predict future anomalous links in dynamically evolving scale-free-like networks. Specifically, we introduce three probabilistic models exploiting the scale-free property of networked systems based on past communication patterns. We perform a grid search on the receiver operating characteristic curves of the proposed models to determine the best decision boundaries for identifying anomalous links. Our approach is able to determine the direction of future links and estimate their probabilities based on link orientations. We evaluate our proposed models on a synthetic dataset derived from a dynamically evolving real-world communication network. Our empirical results show that the accuracy rates of the proposed models change between 63.20% to 96.50%, while the F1 score is between 66.25% and 96.52%. Lastly, we show that the proposed approach outperforms two popular walk-based and two contemporary neural network-based methods.

  • Detecting Anomalous Communication Behaviors in Dynamically Evolving Networked Systems

    by Mehedi Hassan, Mehmet Engin Tozal, Vipin Swarup, Steven Noel, Raju Gottumukkala, Vijay Raghavan

    Devices in real-world networked systems typically exhibit a consistent communication behavior over time. Hence, anomalous communication behaviors may often indicate cyber attacks taking place in these systems. As a result, identifying anomalous communication links can help us to activate appropriate response mechanisms to ensure the integrity and security of such networked systems. In this study, we propose an approach to detect anomalous communication links in dynamically evolving networked systems. Furthermore, we employ the External Direct Sum of Vector Spaces (EDSoVS) to enable edge/dyad representation learning from node representations. We then use the dyad representations as features to train an SVM model and detect future anomalous links. We evaluate our approach on a synthetic dataset representing a real-world communication network provided by the MITRE Corporation and twelve real-world datasets provided by Cisco. Our empirical results show that the accuracy rates of the proposed model vary between 70.54% to 95.79%, while the F1 score is between 78.22% and 95.97%. We compare our approach against four techniques involving neural networks and graph neural networks. We show that our approach achieves higher accuracy, precision, and recall rates. 2024 The MITRE Corporation. ALL RIGHTS RESERVED. Approved for Public Release; Distribution Unlimited. Public Release Case Number 24-0207.

  • Open Access

    The specific applications of the TSR-based method in identifying Zn2+ binding sites of proteases and ACE/ACE2

    by Titli Sarkar, Camille R. Reaux, Jianxiong Li, Vijay V. Raghavan, Wu Xu


  • Open Access

    Intrusion Detection Using Payload Embeddings

    by Mehedi Hassan, Enamul Haque, Mehmet Engin Tozal, Vijay Raghavan, Rajeev Agrawal

    Attacks launched over the Internet often degrade or disrupt the quality of online services. Various Intrusion Detection Systems (IDSs), with or without prevention capabilities, have been proposed to defend networks or hosts against such attacks. While most of these IDSs extract features from the packet headers to detect any irregularities in the network traffic, some others use payloads alongside the headers. In this study, we propose a payload-based intrusion detection scheme, PayloadEmbeddings, using byte embeddings of the payloads of network packets. We employ a shallow neural network to generate vector representations for bytes and their corresponding payloads. Our feature extraction technique is coupled with the k-Nearest Neighbours (kNN) algorithm for the classification of packets as intrusive or non-intrusive. In our experiments, we evaluated 34 publicly available datasets, and used ten distinct payload-based, labeled intrusion detection datasets to train and evaluate our approach. Our empirical results show that PayloadEmbeddings reaches between 75% and 99% accuracy across all datasets. Finally, we compare our approach to other state-of-the-art and traditional intrusion detection techniques. Our findings suggest that PayloadEmbeddings demonstrates significant advantages over the other techniques on most of the datasets.


  • Open Access

    Development of a TSR-Based Method for Protein 3-D Structural Comparison With Its Applications to Protein Classification and Motif Discovery

    by Sarika Kondra, Titli Sarkar, Vijay Raghavan, Wu Xu

    Development of protein 3-D structural comparison methods is important in understanding protein functions. At the same time, developing such a method is very challenging. In the last 40 years, ever since the development of the first automated structural method, ~200 papers were published using different representations of structures. The existing methods can be divided into five categories: sequence-, distance-, secondary structure-, geometry-based, and network-based structural comparisons. Each has its uniqueness, but also limitations. We have developed a novel method where the 3-D structure of a protein is modeled using the concept of Triangular Spatial Relationship (TSR), where triangles are constructed with the Cα atoms of a protein as vertices. Every triangle is represented using an integer, which we denote as “key,” A key is computed using the length, angle, and vertex labels based on a rule-based formula, which ensures assignment of the same key to identical TSRs across proteins. A structure is thereby represented by a vector of integers. Our method is able to accurately quantify similarity of structure or substructure by matching numbers of identical keys between two proteins. The uniqueness of our method includes: (i) a unique way to represent structures to avoid performing structural superimposition; (ii) use of triangles to represent substructures as it is the simplest primitive to capture shape; (iii) complex structure comparison is achieved by matching integers corresponding to multiple TSRs. Every substructure of one protein is compared to every other substructure in a different protein. The method is used in the studies of proteases and kinases because they play essential roles in cell signaling, and a majority of these constitute drug targets. The new motifs or substructures we identified specifically for proteases and kinases provide a deeper insight into their structural relations. Furthermore, the method provides a unique way to study protein conformational changes. In addition, the results from CATH and SCOP data sets clearly demonstrate that our method can distinguish alpha helices from beta pleated sheets and vice versa. Our method has the potential to be developed into a powerful tool for efficient structure-BLAST search and comparison, just as BLAST is for sequence search and alignment.


  • Deep Multi-View Learning to Rank

    by Guanqun Cao, Alexandros Iosifidis, Moncef Gabbouj, Vijay Raghavan, Raju Gottumukkala

    We study the problem of learning to rank from multiple information sources. Though multi-view learning and learning to rank have been studied extensively leading to a wide range of applications, multi-view learning to rank as a synergy of both topics has received little attention. The aim of the paper is to propose a composite ranking method while keeping a close correlation with the individual rankings simultaneously. We present a generic framework for multi-view subspace learning to rank (MvSL2R), and two novel solutions are introduced under the framework. The first solution captures information of feature mappings from within each view as well as across views using autoencoder-like networks. Novel feature embedding methods are formulated in the optimization of multi-view unsupervised and discriminant autoencoders. Moreover, we introduce an end-to-end solution to learning towards both the joint ranking objective and the individual rankings. The proposed solution enhances the joint ranking with minimum view-specific ranking loss, so that it can achieve the maximum global view agreements in a single optimization process. The proposed method is evaluated on three different ranking problems, i.e. university ranking, multi-view lingual text ranking and image data ranking, providing superior results compared to related methods.