Murali Krishna Enduri

dblp:158/8460 · DBLP profile ↗
← Back
11ranked-venue papers
2as first author
5since 2021 · last 2026
0000-0002-9029-2187ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 7 · 2 first-author · 1 since 2021Databases, data management, data science and information retrieval · 3 · 2 since 2021Artificial intelligence and machine learning · 2 · 2 since 2021
YearPublicationVenuePosition
2026 A hybrid machine learning and centrality framework for key node identification in complex networks
abstract
Determining the most significant nodes in complex networks is more crucial for a broad spectrum of applications. In order to assess a node’s significance, traditional centrality metrics are largely based on the network’s structural configuration. However, the asymmetric link between a node’s structural features, including local information, and its functional value is not well captured by them. To overcome these issues, we propose a machine learning approach for node assessment that identifies the nonlinear interaction between network structure and node functionality. We implement a system that derives features for each node as a vector, by utilizing the traditional existing centrality measures like degree (D), betweenness (B), closeness (C), katz (K), clustering coefficient (CC), pagerank (PR), global relative change in average closeness (GRAC), global relative change in average clustering coefficient (GRACC), global relative change in average katz (GRAK), global relative change in average betweenness (GRAB), global relative change in average pagerank (GRAPR), and global relative change in average degree (GRAD). The system incorporates the infection rate as a key factor in contagion modelling, labelling each node by its verified spreading ability through Independent Cascade and SIR simulations. Our main objective is to comprehend the underlying relationship between a disease’s actual spreading capacity and its rate of infection using machine learning techniques. The machine learning model effectiveness is evaluated in two scenarios: (1) exhibits higher accuracy than traditional centrality measures when trained and tested on the same network, (2) while GRACC, GRAK, GRAPR, GRAB, GRAC, and GRAD outperform the machine learning techniques when trained data is from one network and tested data is from another network. The suggested machine learning method exhibits an accuracy of 25% higher than existing centrality approaches in two distinct scenarios, highlighting its potential in a wide range of applications.
ReddyPriya Madupuri, Murali Krishna Enduri, Sobin C. C., Koduru Hajarathaiah, Narendra Bandaru
Discov. Comput.2
2025 Identifying influential nodes using semi local isolating centrality based on average shortest path
ReddyPriya Madupuri, Sobin C. C., Murali Krishna Enduri, Satish Anamalamudi
J. Intell. Inf. Syst.3
2024 Navigating Social Networks: A Hypergraph Approach to Influence Optimization
Murali Krishna Enduri
COMPLEXIS1
2023 Evaluating the Efficacy of Machine Learning Algorithms in Heart Disease Prediction
Vaishnavi Devineni, Vaishnavi Ratnam Movva, Gopichand Medisetty, Srilatha Tokala, Murali Krishna Enduri, Satish Anamalamudi
HIS (1)5
2023 Predicting User Sentiments in Social Media with Machine Learning and Natural Language Processing Techniques
Kurmala Lakshmi Sathvika, Devineni Srujitha, Kavuru Tanya, Srilatha Tokala, Murali Krishna Enduri, Satish Anamalamudi
HIS (2)5
2020 Evolution of Physics Sub-fields
Murali Krishna Enduri, I. Vinod Reddy, Shivakumar Jolad
COMPLEXIS1
2020 Polynomial-time algorithm for isomorphism of graphs with clique-width at most three
Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy
Theor. Comput. Sci.2
2019 On structural parameterizations of firefighting
Bireswar Das, Murali Krishna Enduri, Masashi Kiyomi, Neeldhara Misra, Yota Otachi, I. Vinod Reddy, Shunya Yoshimura
Theor. Comput. Sci.2
2018 On the Parallel Parameterized Complexity of the Graph Isomorphism Problem
Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy
WALCOM2
2018 On NC algorithms for problems on bounded rank-width graphs
Bireswar Das, Anirban Dasgupta 0001, Murali Krishna Enduri, I. Vinod Reddy
Inf. Process. Lett.3
2016 Polynomial-Time Algorithm for Isomorphism of Graphs with Clique-Width at Most Three
Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy
COCOON2