Partha Sarathi Bishnu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Partha Sarathi Bishnu has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Vandana Bhattacharjee
Birla Institute of Technology, MESRA, India
9 shared publications - Abhishek Kumar
Birla Institute of Technology, Mesra
5 shared publications - Umang Gupta
Amity Institute of Information Technology, Amity University Jharkhand, Ranchi, India
4 shared publications - Ritesh Kumar
Cambridge Institute of Technology
3 shared publications - Abhishek
Department of Computer Science and Engineering, Birla Institute of Technology, Mesra, Ranchi, Jharkhand, India
2 shared publications - Aditya Sinha
Birla Institute of Technology
1 shared publication
Latest Publications
- 21 September 2026
- Published by IOP Publishing in Physica Scripta
- Vol. 101 (38) , 386001
Inverse Ising problem: attention-guided physics-regularized reconstruction of corrupted spin configurations
Objective. Reconstructing clean spin configurations from corrupted or partially observed lattice data is an important inverse problem in statistical physics and scientific machine learning. This paper proposes an attention-guided physics -regularized deep learning framework to reconstruct corrupted two-dimensional Ising spin configurations. Approach. The proposed framework receives a degraded spin lattice together with its corresponding observation mask and jointly reconstructs the unknown spin configuration while estimating its global thermodynamic state. A convolutional encoder–decoder with residual connections and spatial attention is employed to recover the underlying clean spin field. Physical consistency is enforced during training through a composite objective combining reconstruction fidelity with constraints on energy ( E ), absolute magnetization ( | M | ), second-neighbor correlation ( C 2 ) at lattice separation r l = 2 , and binary spin consistency, together with temperature regression and phase classification. Main results. Experiments on Monte Carlo generated datasets for lattice sizes L show that the proposed model achieves a high reconstruction accuracy of approximately 0.88 , with an observed-spin accuracy around 0.90 and a missing-spin accuracy around 0.83 . The model also attains a low temperature prediction error, with the mean absolute error decreasing from 0.197 ( L = 32 ) to 0.088 ( L = 128 ), together with strong phase classification performance ranging from 0.985 to 0.999 . Significance. The reconstructed configurations preserve key thermodynamic observables across temperature, including magnetization, energy, correlation, and heat capacity, demonstrating that the framework successfully maintains physical consistency while performing inverse reconstruction from corrupted Ising data.
- 21 September 2026
- Published by IOP Publishing in Physica Scripta
- Vol. 101 (38) , 386001
Inverse Ising problem: attention-guided physics-regularized reconstruction of corrupted spin configurations
Objective. Reconstructing clean spin configurations from corrupted or partially observed lattice data is an important inverse problem in statistical physics and scientific machine learning. This paper proposes an attention-guided physics -regularized deep learning framework to reconstruct corrupted two-dimensional Ising spin configurations. Approach. The proposed framework receives a degraded spin lattice together with its corresponding observation mask and jointly reconstructs the unknown spin configuration while estimating its global thermodynamic state. A convolutional encoder–decoder with residual connections and spatial attention is employed to recover the underlying clean spin field. Physical consistency is enforced during training through a composite objective combining reconstruction fidelity with constraints on energy ( E ), absolute magnetization ( | M | ), second-neighbor correlation ( C 2 ) at lattice separation r l = 2 , and binary spin consistency, together with temperature regression and phase classification. Main results. Experiments on Monte Carlo generated datasets for lattice sizes L show that the proposed model achieves a high reconstruction accuracy of approximately 0.88 , with an observed-spin accuracy around 0.90 and a missing-spin accuracy around 0.83 . The model also attains a low temperature prediction error, with the mean absolute error decreasing from 0.197 ( L = 32 ) to 0.088 ( L = 128 ), together with strong phase classification performance ranging from 0.985 to 0.999 . Significance. The reconstructed configurations preserve key thermodynamic observables across temperature, including magnetization, energy, correlation, and heat capacity, demonstrating that the framework successfully maintains physical consistency while performing inverse reconstruction from corrupted Ising data.
- 2 June 2026
- Published by Springer Nature
- p. 437-446
Curriculum Learning-Driven Haematological Anaemia Detection: A Progressive Approach Using CBC Parameters
- 2 June 2026
- Published by Springer Nature
- p. 437-446
Curriculum Learning-Driven Haematological Anaemia Detection: A Progressive Approach Using CBC Parameters
- 21 April 2026
- Published by Elsevier in Physica B: Condensed Matter
- Vol. 736
Physics-constrained deep inverse framework for noisy Ising spin reconstruction and state estimation
- 21 April 2026
- Published by Elsevier in Physica B: Condensed Matter
- Vol. 736
Physics-constrained deep inverse framework for noisy Ising spin reconstruction and state estimation
- Open Access
- 12 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. PP, 1
An Adaptive Hybrid Clustering Framework with Iterative Noise Filtering and a Novel DBNS Ratio Validity Measure for Outlier- Resilient High-Dimensional Data
Clustering high-dimensional data while assuring robustness to noise and outliers remains a significant challenge in unsupervised learning. This paper proposes an adaptive hybrid clustering framework that integrates the Mahalanobis distance in the latent space and iterative noise filtering to enhance outlier resilience. The framework employs an autoencoder to transform raw data into a compact latent representation, where clustering is performed using the Mahalanobis distance for outlier detection. An adaptive re-weighting mechanism iteratively minimizes the impact of noisy data points, refining cluster assignments. A hybrid loss function is proposed that integrates reconstruction accuracy, an outlier penalty, and the novel Davies-Bouldin Index Normalized Silhouette Score (DBNS) ratio. This combined loss optimizes clustering quality by jointly enhancing intra-cluster cohesion and inter-cluster separation. Experimental results on synthetic and real datasets demonstrate the superior robustness and precision of the proposed approach, outperforming the latest clustering methods in noisy environments.
- 12 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. PP, 1
Open AccessAn Adaptive Hybrid Clustering Framework with Iterative Noise Filtering and a Novel DBNS Ratio Validity Measure for Outlier- Resilient High-Dimensional Data
Clustering high-dimensional data while assuring robustness to noise and outliers remains a significant challenge in unsupervised learning. This paper proposes an adaptive hybrid clustering framework that integrates the Mahalanobis distance in the latent space and iterative noise filtering to enhance outlier resilience. The framework employs an autoencoder to transform raw data into a compact latent representation, where clustering is performed using the Mahalanobis distance for outlier detection. An adaptive re-weighting mechanism iteratively minimizes the impact of noisy data points, refining cluster assignments. A hybrid loss function is proposed that integrates reconstruction accuracy, an outlier penalty, and the novel Davies-Bouldin Index Normalized Silhouette Score (DBNS) ratio. This combined loss optimizes clustering quality by jointly enhancing intra-cluster cohesion and inter-cluster separation. Experimental results on synthetic and real datasets demonstrate the superior robustness and precision of the proposed approach, outperforming the latest clustering methods in noisy environments.
- 2 January 2026
- Published by Springer Nature
- p. 329-338
CNN-Based Hybrid Framework for Accurate Metal Surface Defect Classification
- 2 January 2026
- Published by Springer Nature
- p. 329-338
CNN-Based Hybrid Framework for Accurate Metal Surface Defect Classification
- Open Access
- 28 September 2025
- Published by MDPI AG in Diagnostics
- Vol. 15 (19) , 2485
A Robust Semi-Supervised Brain Tumor MRI Classification Network for Data-Constrained Clinical Environments
Background: The accurate classification of brain tumor subtypes from MRI scans is critical for timely diagnosis, yet the manual annotation of large datasets remains prohibitively labor-intensive. Method: We present SSPLNet (Semi-Supervised Pseudo-Labeling Network), a dual-branch deep learning framework that synergizes confidence-guided iterative pseudo-labelling with deep feature fusion to enable robust MRI-based tumor classification in data-constrained clinical environments. SSPLNet integrates a custom convolutional neural network (CNN) and a pretrained ResNet50 model, trained semi-supervised using adaptive confidence thresholds () to iteratively refine pseudo-labels for unlabelled MRI scans. Feature representations from both branches are fused via a dense network, combining localized texture patterns with hierarchical deep features. Results: SSPLNet achieves state-of-the-art accuracy across labelled–unlabelled data splits ( to ), outperforming supervised baselines in extreme low-label regimes (10:90) by up to 5.34% from Custom CNN and 5.58% from ResNet50. The framework reduces annotation dependence and with 40% unlabeled data maintains 98.17% diagnostic accuracy, demonstrating its viability for scalable deployment in resource-limited healthcare settings. Conclusions: Statistical Evaluation and Robustness Analysis of SSPLNet Performance confirms that SSPLNet’s lower error rate is not due to chance. The bootstrap results also confirm that SSPLNet’s reported accuracy falls well within the 95% CI of the sampling distribution.- 28 September 2025
- Published by MDPI AG in Diagnostics
- Vol. 15 (19) , 2485
Open AccessA Robust Semi-Supervised Brain Tumor MRI Classification Network for Data-Constrained Clinical Environments
Background: The accurate classification of brain tumor subtypes from MRI scans is critical for timely diagnosis, yet the manual annotation of large datasets remains prohibitively labor-intensive. Method: We present SSPLNet (Semi-Supervised Pseudo-Labeling Network), a dual-branch deep learning framework that synergizes confidence-guided iterative pseudo-labelling with deep feature fusion to enable robust MRI-based tumor classification in data-constrained clinical environments. SSPLNet integrates a custom convolutional neural network (CNN) and a pretrained ResNet50 model, trained semi-supervised using adaptive confidence thresholds () to iteratively refine pseudo-labels for unlabelled MRI scans. Feature representations from both branches are fused via a dense network, combining localized texture patterns with hierarchical deep features. Results: SSPLNet achieves state-of-the-art accuracy across labelled–unlabelled data splits ( to ), outperforming supervised baselines in extreme low-label regimes (10:90) by up to 5.34% from Custom CNN and 5.58% from ResNet50. The framework reduces annotation dependence and with 40% unlabeled data maintains 98.17% diagnostic accuracy, demonstrating its viability for scalable deployment in resource-limited healthcare settings. Conclusions: Statistical Evaluation and Robustness Analysis of SSPLNet Performance confirms that SSPLNet’s lower error rate is not due to chance. The bootstrap results also confirm that SSPLNet’s reported accuracy falls well within the 95% CI of the sampling distribution. - 22 September 2025
- Published by American Physical Society (APS) in Physical Review E
- Vol. 112 (3) , 035316
Temperature-conditioned deep generative framework for scalable Ising spin configuration synthesis with physics-informed constraints
This study presents a temperature-conditioned deep generative approach for efficiently generating spin configurations of the two-dimensional (2D) Ising model. The method employs a convolutional generator network, conditioned on spin states, temperature embeddings, and random noise, to generate thermodynamically accurate spin configurations on a 2D square lattice. Physics-based constraints, derived from magnetization, energy, and nearest-neighbor correlations obtained via Monte Carlo simulations, are integrated as auxiliary loss terms during training to ensure physical consistency. The model accurately captures phase transition behaviors near the critical temperature and supports the scalable generation of synthetic configurations for further analysis. Investigations across lattice sizes L=16, 32, and 64 demonstrate close alignment with Monte Carlo baselines, with generated configurations achieving mean absolute errors as low as 0.0016 for magnetization, 0.0063 for energy, and 0.0016 for correlation in the L=64 case. Phase classification using standard machine learning models further validates the quality of the generated data, with ensemble classifiers yielding F1 scores above 0.99. These findings highlight the proposed framework as a scalable, computationally efficient solution for generating spin configurations in an Ising model.
- 22 September 2025
- Published by American Physical Society (APS) in Physical Review E
- Vol. 112 (3) , 035316
Temperature-conditioned deep generative framework for scalable Ising spin configuration synthesis with physics-informed constraints
This study presents a temperature-conditioned deep generative approach for efficiently generating spin configurations of the two-dimensional (2D) Ising model. The method employs a convolutional generator network, conditioned on spin states, temperature embeddings, and random noise, to generate thermodynamically accurate spin configurations on a 2D square lattice. Physics-based constraints, derived from magnetization, energy, and nearest-neighbor correlations obtained via Monte Carlo simulations, are integrated as auxiliary loss terms during training to ensure physical consistency. The model accurately captures phase transition behaviors near the critical temperature and supports the scalable generation of synthetic configurations for further analysis. Investigations across lattice sizes L=16, 32, and 64 demonstrate close alignment with Monte Carlo baselines, with generated configurations achieving mean absolute errors as low as 0.0016 for magnetization, 0.0063 for energy, and 0.0016 for correlation in the L=64 case. Phase classification using standard machine learning models further validates the quality of the generated data, with ensemble classifiers yielding F1 scores above 0.99. These findings highlight the proposed framework as a scalable, computationally efficient solution for generating spin configurations in an Ising model.
- 15 September 2025
- Published by Springer Nature in Cognitive Neurodynamics
- Vol. 19 (1) , 1-19
Analyzing mental disorders with a CNN-GRU deep learning model on motor activity
Mood disorders can significantly interfere with daily life, ranging from mild to severe, impacting relationships, work, and overall well-being. Globally, the scarcity of mental health resources and the stigma attached to mental illness are significant obstacles. Existing approaches for mood disorder detection often rely on static clinical data or other modalities (e.g., imaging or questionnaires), and the potential of continuous motor activity data remains underexplored. Continuous wearable motor activity recordings represent an objective, non-invasive method that tracks an individual’s behavioral patterns relevant to their mood states, while enabling ongoing monitoring in contrast to the episodic clinical assessments. Our primary goal in this paper is to employ a Deep Learning Model utilizing CNN-GRU architecture for analyzing motor activity sequences. Through rigorous experimentation on Depresjon datasets recorded via wrist worn actigraphy, our approach achieves an accuracy of 98.1%, surpassing the accuracy levels achieved by state-of-the-art techniques.
- 15 September 2025
- Published by Springer Nature in Cognitive Neurodynamics
- Vol. 19 (1) , 1-19
Analyzing mental disorders with a CNN-GRU deep learning model on motor activity
Mood disorders can significantly interfere with daily life, ranging from mild to severe, impacting relationships, work, and overall well-being. Globally, the scarcity of mental health resources and the stigma attached to mental illness are significant obstacles. Existing approaches for mood disorder detection often rely on static clinical data or other modalities (e.g., imaging or questionnaires), and the potential of continuous motor activity data remains underexplored. Continuous wearable motor activity recordings represent an objective, non-invasive method that tracks an individual’s behavioral patterns relevant to their mood states, while enabling ongoing monitoring in contrast to the episodic clinical assessments. Our primary goal in this paper is to employ a Deep Learning Model utilizing CNN-GRU architecture for analyzing motor activity sequences. Through rigorous experimentation on Depresjon datasets recorded via wrist worn actigraphy, our approach achieves an accuracy of 98.1%, surpassing the accuracy levels achieved by state-of-the-art techniques.
- 21 June 2025
- Published by Springer Nature
- p. 34-43
Diabetes Prediction Enhancement via Cellular Automata and Machine Learning
- 21 June 2025
- Published by Springer Nature
- p. 34-43
Diabetes Prediction Enhancement via Cellular Automata and Machine Learning
- 24 April 2025
- Published by Taylor & Francis
- p. 20-41
From Data to Decisions: K-Means Clustering for Product Development and Marketing
In the competitive landscape of modern product development, prioritizing features that resonate with customers and deliver maximum value is crucial. This chapter explores the application of clustering algorithms in enhancing decision-making processes across various domains. Beginning with an overview of the K-Means clustering algorithm, the chapter delves into its implementation for feature prioritization and advertising item selection. Key topics include the importance of data collection and preprocessing, interpreting clustering results and integrating insights into product development workflows. Practical case studies and examples illustrate the effectiveness of clustering in real-world scenarios, while discussions on challenges and best practices provide essential guidance for maximizing clustering outcomes. The chapter concludes with a proposed approach for leveraging clustering in advertising strategy, highlighting its role in optimizing marketing efforts through customer segmentation. The chapter aims to equip readers with practical insights into leveraging clustering algorithms for strategic decision-making and innovation.
- 24 April 2025
- Published by Taylor & Francis
- p. 20-41
From Data to Decisions: K-Means Clustering for Product Development and Marketing
In the competitive landscape of modern product development, prioritizing features that resonate with customers and deliver maximum value is crucial. This chapter explores the application of clustering algorithms in enhancing decision-making processes across various domains. Beginning with an overview of the K-Means clustering algorithm, the chapter delves into its implementation for feature prioritization and advertising item selection. Key topics include the importance of data collection and preprocessing, interpreting clustering results and integrating insights into product development workflows. Practical case studies and examples illustrate the effectiveness of clustering in real-world scenarios, while discussions on challenges and best practices provide essential guidance for maximizing clustering outcomes. The chapter concludes with a proposed approach for leveraging clustering in advertising strategy, highlighting its role in optimizing marketing efforts through customer segmentation. The chapter aims to equip readers with practical insights into leveraging clustering algorithms for strategic decision-making and innovation.