Swadhin Kumar Barisal
Swadhin Kumar Barisal has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Gayatri Nayak
Siksha ‘O’ Anusandhan Deemed to be University
5 shared publications - Mitrabinda Ray
Siksha ‘O’ Anusandhan (Deemed to be) University
2 shared publications - Abhilash Pati
Department of CSE, Siksha ‘O’ Anusandhan (Deemed to be University), Bhubaneswar, India
1 shared publication Arpita Dutta
National University of Singapore
1 shared publicationBibhudatta Sahoo
National Institute of Technology
1 shared publication- Bichitrananda Patra
Department of Computer Application, ITER, Siksha ’O’ Anusandhan (Deemed to be) University, Bhubaneswar, India
1 shared publication
Latest Publications
- Open Access
- 1 February 2026
- Published by Springer Nature in Discover Applied Sciences
- Vol. 8 (3)
Conflict aware retail recommendation decision support system
Retail recommendation systems play a crucial role in enhancing customer engagement and driving sales across modern commerce platforms. Traditional Association Rule Mining (ARM) based approaches often prioritize consistency and completeness in recommendations, overlooking the inherent uncertainty and contradictions in real-world retail data. To address these challenges, this study introduces the Conflict Aware Retail Recommendation Decision Support (CAR2DS) framework, which integrates Paraconsistent Annotated Logic (PAL) with evidential analysis to enable conflict-tolerant and transparent retail recommendations. This framework prioritizes ARM-derived rules based on support-confidence strength, temporal consistency, and reliability indices, ensuring coherent and explainable decision-making under uncertainty. Empirical evaluation reveals that CAR2DS achieves superior performance, attaining an average accuracy of 95.8% and demonstrating mean gains of 23.6% over ARM and 14.3% over FARM . It provides an interpretable decision with validating its transparency and reliability. Additionally, the model demonstrates balanced performance across key metrics, including conflict resolution, stability, and temporal adaptivity. The proposed system establishes a new paradigm for explainable, Conflict Aware retail intelligence.
- 1 February 2026
- Published by Springer Nature in Discover Applied Sciences
- Vol. 8 (3)
Open AccessConflict aware retail recommendation decision support system
Retail recommendation systems play a crucial role in enhancing customer engagement and driving sales across modern commerce platforms. Traditional Association Rule Mining (ARM) based approaches often prioritize consistency and completeness in recommendations, overlooking the inherent uncertainty and contradictions in real-world retail data. To address these challenges, this study introduces the Conflict Aware Retail Recommendation Decision Support (CAR2DS) framework, which integrates Paraconsistent Annotated Logic (PAL) with evidential analysis to enable conflict-tolerant and transparent retail recommendations. This framework prioritizes ARM-derived rules based on support-confidence strength, temporal consistency, and reliability indices, ensuring coherent and explainable decision-making under uncertainty. Empirical evaluation reveals that CAR2DS achieves superior performance, attaining an average accuracy of 95.8% and demonstrating mean gains of 23.6% over ARM and 14.3% over FARM . It provides an interpretable decision with validating its transparency and reliability. Additionally, the model demonstrates balanced performance across key metrics, including conflict resolution, stability, and temporal adaptivity. The proposed system establishes a new paradigm for explainable, Conflict Aware retail intelligence.
- 4 July 2024
- Published by Springer Nature
- p. 41-49
An Intelligent Diagnostic System for Type 2 Diabetes Mellitus
- 4 July 2024
- Published by Springer Nature
- p. 41-49
An Intelligent Diagnostic System for Type 2 Diabetes Mellitus
- 1 December 2023
- Published by Pleiades Publishing Ltd in Programming and Computer Software
- Vol. 49 (8) , 942-953
CGWO: An Improved Grey Wolf Optimization Technique for Test Case Prioritization
The convergence rate has been widely accepted as a performance measure for choosing a better metaheuristic algorithm. So, we propose a novel technique to improve the performance of the existing Grey Wolf Optimization (GWO) algorithm in terms of its convergence rate. The proposed approach also prioritizes the test cases that are obtained after executing the input benchmark programs. This paper has three technical contributions. In our first contribution, we generate test cases for the input benchmark programs. Our second contribution prioritizes test cases using an improved version of the existing GWO algorithm (CGWO). Our third contribution analyzes the obtained result and compares it with state-of-the-art metaheuristic techniques. This work is validated after running the proposed model on six benchmark programs. The obtained results show that our proposed approach has achieved 48% better APFD score for the prioritized order of test cases than the non-prioritized order. We also achieved a better convergence rate, which takes around 4000 fewer iterations, when compared with the existing methods on the same platform.
- 1 December 2023
- Published by Pleiades Publishing Ltd in Programming and Computer Software
- Vol. 49 (8) , 942-953
CGWO: An Improved Grey Wolf Optimization Technique for Test Case Prioritization
The convergence rate has been widely accepted as a performance measure for choosing a better metaheuristic algorithm. So, we propose a novel technique to improve the performance of the existing Grey Wolf Optimization (GWO) algorithm in terms of its convergence rate. The proposed approach also prioritizes the test cases that are obtained after executing the input benchmark programs. This paper has three technical contributions. In our first contribution, we generate test cases for the input benchmark programs. Our second contribution prioritizes test cases using an improved version of the existing GWO algorithm (CGWO). Our third contribution analyzes the obtained result and compares it with state-of-the-art metaheuristic techniques. This work is validated after running the proposed model on six benchmark programs. The obtained results show that our proposed approach has achieved 48% better APFD score for the prioritized order of test cases than the non-prioritized order. We also achieved a better convergence rate, which takes around 4000 fewer iterations, when compared with the existing methods on the same platform.
- 18 October 2022
- Published by Springer Nature
- p. 10-19
Source Code Features Based Branch Coverage Prediction Using Ensemble Technique
- 18 October 2022
- Published by Springer Nature
- p. 10-19
Source Code Features Based Branch Coverage Prediction Using Ensemble Technique
- 4 June 2022
- Published by Springer Nature
- p. 231-241
Concolic-Based Software Vulnerability Prediction Using Ensemble Learning
- 4 June 2022
- Published by Springer Nature
- p. 231-241
Concolic-Based Software Vulnerability Prediction Using Ensemble Learning
- 22 April 2022
- Published by Springer Nature
- p. 255-266
GWO Based Test Sequence Generation and Prioritization
- 22 April 2022
- Published by Springer Nature
- p. 255-266
GWO Based Test Sequence Generation and Prioritization