Pranab K. Muhuri
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
Research Subjects
Pranab K. Muhuri has a total of 89 co-authors. Here are the top co-authors by number of shared publications:
Amit K. Shukla
25 shared publicationsRahul Nath
Department of Computer Science, South Asian University, New Delhi, India
19 shared publicationsQ. M. Danish Lohani
Department of Mathematics, South Asian University, New Delhi 110021, India
14 shared publicationsSandeep Kumar
13 shared publications- Amit K. Shukla
University of Vaasa, Vaasa, Finland
11 shared publications Amit Rauniyar
11 shared publications
Latest Publications
- 4 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 13 (2) , 1397-1410
DFCD: Density-Based Fuzzy Community Detection Approach With Biased Random Walk Guided Node Sampling
Research on overlapping community detection is still significant due to the rapid growth of different types of complex networks. Among the types of community detection, density-based clustering approaches did not get much attention in the field of overlapping community detection. We found two main drawbacks of the density-based approaches: 1) lack of research in computing the proper long-range distance (up to several hops) among the nodes in graph dataset; and 2) difficulty in computing overlapping belonging coefficients of the nodes in terms of diverse and irregular shaped clusters of graph datasets where distances among few nodes are available only (even not the positions of the nodes). In this article, we propose a novel overlapping community detection approach which we term as “density-based fuzzy community detection (DFCD)”, based on local densities of the nodes. Here, we capture the network topology in the form of bulk node-streams (node sampling) by employing biased random walk. We propose a novel way to compute long range distances among the nodes by utilizing the nodes-streams to find fixed number of global neighbors for each node, and accordingly we compute local densities of the nodes. We propose three relations between nodes and communities, where local densities and distances among the nodes are known only. Finally, we propose a novel belonging computation function based on the three relations, local densities, distances among the nodes. Our proposed approach is judged considering a number of real-life and synthetic datasets, where we consider ten state-of-the-art competitors. The experimental analysis shows superiority of the proposed approach over its competitors based on both accuracy and quality evaluations. Moreover, the detailed complexity analysis of the proposed approach shows linearly growth of the time complexity in terms of number of nodes and average degree, which is less than the same of majority overlapping community detection approaches.
- 4 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 13 (2) , 1397-1410
DFCD: Density-Based Fuzzy Community Detection Approach With Biased Random Walk Guided Node Sampling
Research on overlapping community detection is still significant due to the rapid growth of different types of complex networks. Among the types of community detection, density-based clustering approaches did not get much attention in the field of overlapping community detection. We found two main drawbacks of the density-based approaches: 1) lack of research in computing the proper long-range distance (up to several hops) among the nodes in graph dataset; and 2) difficulty in computing overlapping belonging coefficients of the nodes in terms of diverse and irregular shaped clusters of graph datasets where distances among few nodes are available only (even not the positions of the nodes). In this article, we propose a novel overlapping community detection approach which we term as “density-based fuzzy community detection (DFCD)”, based on local densities of the nodes. Here, we capture the network topology in the form of bulk node-streams (node sampling) by employing biased random walk. We propose a novel way to compute long range distances among the nodes by utilizing the nodes-streams to find fixed number of global neighbors for each node, and accordingly we compute local densities of the nodes. We propose three relations between nodes and communities, where local densities and distances among the nodes are known only. Finally, we propose a novel belonging computation function based on the three relations, local densities, distances among the nodes. Our proposed approach is judged considering a number of real-life and synthetic datasets, where we consider ten state-of-the-art competitors. The experimental analysis shows superiority of the proposed approach over its competitors based on both accuracy and quality evaluations. Moreover, the detailed complexity analysis of the proposed approach shows linearly growth of the time complexity in terms of number of nodes and average degree, which is less than the same of majority overlapping community detection approaches.
- 31 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 37 (11) , 6478-6493
Label Propagation-Based Membership Degree Computation Towards a Computationally Efficient Fuzzy Community Detection Approach
This paper proposes a novel fuzzy community detection (FCD) approach, which we term as ‘Label Propagation-Based Fuzzy Community (LaProFC)’, and shows that it has the ability to outperform the existing FCD approaches. While designing the proposed FCD approach, we introduce a new compound type similarity metric termed ‘proportion of common neighbors and edges-based similarity (CCS)’ to compute similarity between two neighboring nodes. By executing local exploration on graphs with modified local random walk (mLRW), most similar neighbors of each node are identified; and based on the directions of most similar neighbors some tentative communities are generated. Afterward, these tentative communities are corrected and stabilized by iteratively computing membership degrees of each node using a novel label propagation-based membership computation function. We also propose a novel edge-density-based technique called ‘community-weight based tie-breaking (CTB)’, which is incorporated with the membership degree computation function. We conduct extensive experiments with both real-life and synthetic datasets and show the working of the proposed approach. Our Proposed LaProFC approach outperforms baseline approaches in terms of popular quality and accuracy metrices including modularity and normalized mutual information. Further, popular multi-criteria decision making (MCDM) tools are used to show supremacy of the proposed approach by computing the ranks of different approaches through two sets of accuracy and quality metrices. Our proposed LaProFC approach supersedes other approaches in terms of faster computations and asymptotic time complexity.
- 31 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 37 (11) , 6478-6493
Label Propagation-Based Membership Degree Computation Towards a Computationally Efficient Fuzzy Community Detection Approach
This paper proposes a novel fuzzy community detection (FCD) approach, which we term as ‘Label Propagation-Based Fuzzy Community (LaProFC)’, and shows that it has the ability to outperform the existing FCD approaches. While designing the proposed FCD approach, we introduce a new compound type similarity metric termed ‘proportion of common neighbors and edges-based similarity (CCS)’ to compute similarity between two neighboring nodes. By executing local exploration on graphs with modified local random walk (mLRW), most similar neighbors of each node are identified; and based on the directions of most similar neighbors some tentative communities are generated. Afterward, these tentative communities are corrected and stabilized by iteratively computing membership degrees of each node using a novel label propagation-based membership computation function. We also propose a novel edge-density-based technique called ‘community-weight based tie-breaking (CTB)’, which is incorporated with the membership degree computation function. We conduct extensive experiments with both real-life and synthetic datasets and show the working of the proposed approach. Our Proposed LaProFC approach outperforms baseline approaches in terms of popular quality and accuracy metrices including modularity and normalized mutual information. Further, popular multi-criteria decision making (MCDM) tools are used to show supremacy of the proposed approach by computing the ranks of different approaches through two sets of accuracy and quality metrices. Our proposed LaProFC approach supersedes other approaches in terms of faster computations and asymptotic time complexity.
- Open Access
- 29 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
Fuzzy Sets-Based Approaches for Improved Medical Diagnosis: An Analysis and Overview of Major Research Directions
Today's sedentary lifestyle gives rise to a variety of diseases, making its accurate diagnosis quite essential so that proper treatment can be provided. Computational and artificial intelligence (AI) based approaches can be used to diagnose with better accuracy and reliability, and the process can be automated. However, medical diagnosis encompasses complex decision-making procedures that are often associated with uncertainty and imprecise information. Though fuzzy sets and systems have been effectively used for medical diagnosis, further attention is required to arrive at intelligent and expert systems for better and more accurate diagnosis. In this paper, we present a comprehensive overview of the fuzzy sets-based approaches utilized for diagnosis in the medical domain, and conduct a bibliometric analysis of the publications in fuzzy medical diagnosis.
- 29 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
Open AccessFuzzy Sets-Based Approaches for Improved Medical Diagnosis: An Analysis and Overview of Major Research Directions
Today's sedentary lifestyle gives rise to a variety of diseases, making its accurate diagnosis quite essential so that proper treatment can be provided. Computational and artificial intelligence (AI) based approaches can be used to diagnose with better accuracy and reliability, and the process can be automated. However, medical diagnosis encompasses complex decision-making procedures that are often associated with uncertainty and imprecise information. Though fuzzy sets and systems have been effectively used for medical diagnosis, further attention is required to arrive at intelligent and expert systems for better and more accurate diagnosis. In this paper, we present a comprehensive overview of the fuzzy sets-based approaches utilized for diagnosis in the medical domain, and conduct a bibliometric analysis of the publications in fuzzy medical diagnosis.
- Open Access
- 7 January 2025
- Published by Elsevier in Internet of Things
- Vol. 30
HYRIDE: HYbrid and Robust Intrusion DEtection approach for enhancing cybersecurity in Industry 4.0
- 7 January 2025
- Published by Elsevier in Internet of Things
- Vol. 30
Open AccessHYRIDE: HYbrid and Robust Intrusion DEtection approach for enhancing cybersecurity in Industry 4.0
- Open Access
- 28 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 157746-157760
Multi-Dilated Convolutional LSTM With U-Net for Global Sea Surface Temperature Forecasting
Accurate forecasting of sea surface temperature (SST) is pivotal for a wide range of applications ranging from climate modelling to marine ecosystem management. This study introduces an ingenious multi-dilated model that employs dilated Convolutional Long Short-Term Memory (ConvLSTM) networks alongside a U-Net architecture which aims to enhance the precision of monthly SST predictions at lead periods of 3, 6 and 12 months. Our approach innovatively combines dilated convolutions within ConvLSTM with the segmentation capabilities of U-Net to adeptly capture the complex Spatio-temporal dynamics as well as relevant attributes of SST. The study utilizes a high-resolution MPI-ESM1-2-HR SST dataset for a series of rigorous tests, achieving a Mean Square Error of 0.01, indicating a high accuracy level in SST predictions. The model at a lead time of 12 months also showed a Sea Surface Microwave Index of 0.036, illustrating its effectiveness in reflecting SST’s microwave emissivity characteristics, and an Earth Mover’s Distance score of 0.97, highlighting its ability to closely match the predicted SST distribution with the actual one. Furthermore, a cosine similarity score of 0.99 suggests a significant alignment between the predicted and actual SST patterns. By merging multi-dilated convolutions with segmentation, our model tackles the intricate challenge of simultaneously capturing the spatial and temporal dependencies of SST, setting a new standard for forecasting accuracy in the field.
- 28 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 157746-157760
Open AccessMulti-Dilated Convolutional LSTM With U-Net for Global Sea Surface Temperature Forecasting
Accurate forecasting of sea surface temperature (SST) is pivotal for a wide range of applications ranging from climate modelling to marine ecosystem management. This study introduces an ingenious multi-dilated model that employs dilated Convolutional Long Short-Term Memory (ConvLSTM) networks alongside a U-Net architecture which aims to enhance the precision of monthly SST predictions at lead periods of 3, 6 and 12 months. Our approach innovatively combines dilated convolutions within ConvLSTM with the segmentation capabilities of U-Net to adeptly capture the complex Spatio-temporal dynamics as well as relevant attributes of SST. The study utilizes a high-resolution MPI-ESM1-2-HR SST dataset for a series of rigorous tests, achieving a Mean Square Error of 0.01, indicating a high accuracy level in SST predictions. The model at a lead time of 12 months also showed a Sea Surface Microwave Index of 0.036, illustrating its effectiveness in reflecting SST’s microwave emissivity characteristics, and an Earth Mover’s Distance score of 0.97, highlighting its ability to closely match the predicted SST distribution with the actual one. Furthermore, a cosine similarity score of 0.99 suggests a significant alignment between the predicted and actual SST patterns. By merging multi-dilated convolutions with segmentation, our model tackles the intricate challenge of simultaneously capturing the spatial and temporal dependencies of SST, setting a new standard for forecasting accuracy in the field.
- 6 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 33 (10) , 3396-3409
PerCIST: A Perceptual Computing-Based Decision Support System for Nonclinical Diagnosis of Diabetes Mellitus
Diabetes Mellitus (DM) is a disease impacting the regular activities and lifestyle of a majority of the human population throughout the world. Due to its adverse effects on health, regular interactions with healthcare providers become essential for early diagnosis, prognosis and proper treatment plans. Such interactions often involve qualitative information, which when considered promote effective and practical diagnosis. This is achieved in this paper through the proposal of PerCIST, which is a perceptual computer based non-clinical diagnostic tool for prediction of DM. The proposed model is trained using cognitive understandings of individuals and takes into account the qualitative responses towards the parameters: Age, Body Mass Index (BMI), Fasting Blood Sugar (FBS) levels, HbA1c results and heredity. These parameters which are usually taken into account by medical practitioners for the diagnosis of DM, are decided through consultation of experts. The proposed model of PerCIST attains an accuracy of 93%, which is higher than any existing congeneric model, when tested on multiple individuals. Additional statistical and empirical experiments also highlight the prowess of the proposed model based on the significance of the chosen diagnostic parameters. Consequently, an Android based application, made freely available is also provided to benefit people getting diagnosed for DM at home, especially during times of a pandemic when the entire world is under lockdown
- 6 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 33 (10) , 3396-3409
PerCIST: A Perceptual Computing-Based Decision Support System for Nonclinical Diagnosis of Diabetes Mellitus
Diabetes Mellitus (DM) is a disease impacting the regular activities and lifestyle of a majority of the human population throughout the world. Due to its adverse effects on health, regular interactions with healthcare providers become essential for early diagnosis, prognosis and proper treatment plans. Such interactions often involve qualitative information, which when considered promote effective and practical diagnosis. This is achieved in this paper through the proposal of PerCIST, which is a perceptual computer based non-clinical diagnostic tool for prediction of DM. The proposed model is trained using cognitive understandings of individuals and takes into account the qualitative responses towards the parameters: Age, Body Mass Index (BMI), Fasting Blood Sugar (FBS) levels, HbA1c results and heredity. These parameters which are usually taken into account by medical practitioners for the diagnosis of DM, are decided through consultation of experts. The proposed model of PerCIST attains an accuracy of 93%, which is higher than any existing congeneric model, when tested on multiple individuals. Additional statistical and empirical experiments also highlight the prowess of the proposed model based on the significance of the chosen diagnostic parameters. Consequently, an Android based application, made freely available is also provided to benefit people getting diagnosed for DM at home, especially during times of a pandemic when the entire world is under lockdown
- 3 September 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 262
A stratified review of COVID-19 infection forecasting and an efficient methodology using multiple domain-based transfer learning
- 3 September 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 262
A stratified review of COVID-19 infection forecasting and an efficient methodology using multiple domain-based transfer learning
- 21 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 33 (10) , 3381-3395
MARSHAL: Multiple-Attribute Regret Theory and Semantically Aware Probabilistic Weights Based Hesitant Linguistic Decision-Making
With ever-increasing abundance of text data, decisionmaking problems are becoming more complex. Such complexity is often a consequence of the nuanced input linguistic information which are already highly uncertain and subjective. In this paper, a novel multi-attribute decision making (MADM) model named MARSHAL is introduced in order to capture the aforesaid nuanced characteristics from raw input linguistic data. It is for the first time in the literature of fuzzy-based linguistic MADM models that MARSHAL treats inputs as rich linguistic features from a pretrained deep learning based large language model (LLM) in addition to being uncertain and hesitant, while also presenting vector arithmetic-based information elicitation from corresponding hesitant fuzzy linguistic term sets. The idea is to introduce semantically-aware probabilistic attribute weights based on high-dimensional linguistic features learnt by an enhanced variant of BERT, utilized to solve MADM problems alongside risk and regret-aversive behaviours of experts. The proposed model is tested for applicability on a real case-study of employee flight risk detection. Additionally, extensive quantitative and qualitative experiments are performed to prove the proposed model's gained interpretability and adaptability amongst several other properties which existing congeneric models do not possess
- 21 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 33 (10) , 3381-3395
MARSHAL: Multiple-Attribute Regret Theory and Semantically Aware Probabilistic Weights Based Hesitant Linguistic Decision-Making
With ever-increasing abundance of text data, decisionmaking problems are becoming more complex. Such complexity is often a consequence of the nuanced input linguistic information which are already highly uncertain and subjective. In this paper, a novel multi-attribute decision making (MADM) model named MARSHAL is introduced in order to capture the aforesaid nuanced characteristics from raw input linguistic data. It is for the first time in the literature of fuzzy-based linguistic MADM models that MARSHAL treats inputs as rich linguistic features from a pretrained deep learning based large language model (LLM) in addition to being uncertain and hesitant, while also presenting vector arithmetic-based information elicitation from corresponding hesitant fuzzy linguistic term sets. The idea is to introduce semantically-aware probabilistic attribute weights based on high-dimensional linguistic features learnt by an enhanced variant of BERT, utilized to solve MADM problems alongside risk and regret-aversive behaviours of experts. The proposed model is tested for applicability on a real case-study of employee flight risk detection. Additionally, extensive quantitative and qualitative experiments are performed to prove the proposed model's gained interpretability and adaptability amongst several other properties which existing congeneric models do not possess
- 5 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 11 (5) , 6022-6037
XLoCoFC: A Fast Fuzzy Community Detection Approach Based on Expandable Local Communities Through Max-Membership Degree Propagation
Fuzzy community detection (FCD) aims to reveal the community structure by allocating quantitative values to nodes across different communities. This article proposes a fast FCD approach called the Expandable Local Community based Fuzzy Community (XLoCoFC) detection method based on max-membership degree propagation (max-MDP) and normalized peripheral similarity index ( n PSI). Initially, nodes having comparatively higher n PSI values are considered as topologically dominating nodes and selected as seeds. For an initial community, called local community, seed’s n PSI values from the respective neighbors’ peripheries are utilized as the neighbors’ membership degrees. Then an iterative process propagates max-membership degrees from nodes to nodes, and n PSI values are used as factors in the propagation. In this propagation, local communities having more dominating nodes expand and others contract. The propagation process converges very quickly. Such simplicity in its design makes our proposed XLoCoFC approach to be very fast in finding community structures on large networks. Time complexity of the proposed approach is O ( nd 2 xlog 2 d +klq) which is significantly less than the majority of the FCD algorithms, for whom it is either O ( n 2 ) or more. Moreover, XLoCoFC has no dependence on any network feature. It does not require tuning of any parameter which may impact its output. To demonstrate the working of the proposed XLoCoFC approach, we conduct extensive performance analysis comparatively by executing a set of existing approaches on several popular real-life and synthetic networks with number of nodes ranging from 24 to 1134 890. Evaluation of the results considering the accuracy and quality metrics as well as a group MCDM technique clearly establishes the superiority of our approach over others.
- 5 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 11 (5) , 6022-6037
XLoCoFC: A Fast Fuzzy Community Detection Approach Based on Expandable Local Communities Through Max-Membership Degree Propagation
Fuzzy community detection (FCD) aims to reveal the community structure by allocating quantitative values to nodes across different communities. This article proposes a fast FCD approach called the Expandable Local Community based Fuzzy Community (XLoCoFC) detection method based on max-membership degree propagation (max-MDP) and normalized peripheral similarity index ( n PSI). Initially, nodes having comparatively higher n PSI values are considered as topologically dominating nodes and selected as seeds. For an initial community, called local community, seed’s n PSI values from the respective neighbors’ peripheries are utilized as the neighbors’ membership degrees. Then an iterative process propagates max-membership degrees from nodes to nodes, and n PSI values are used as factors in the propagation. In this propagation, local communities having more dominating nodes expand and others contract. The propagation process converges very quickly. Such simplicity in its design makes our proposed XLoCoFC approach to be very fast in finding community structures on large networks. Time complexity of the proposed approach is O ( nd 2 xlog 2 d +klq) which is significantly less than the majority of the FCD algorithms, for whom it is either O ( n 2 ) or more. Moreover, XLoCoFC has no dependence on any network feature. It does not require tuning of any parameter which may impact its output. To demonstrate the working of the proposed XLoCoFC approach, we conduct extensive performance analysis comparatively by executing a set of existing approaches on several popular real-life and synthetic networks with number of nodes ranging from 24 to 1134 890. Evaluation of the results considering the accuracy and quality metrics as well as a group MCDM technique clearly establishes the superiority of our approach over others.