Santanu Kumar Rath
Research Subjects
Santanu Kumar Rath has a total of 102 co-authors. Here are the top co-authors by number of shared publications:
Lov Kumar
BITS Pilani Hyderabad Campus, India
16 shared publications- Mukesh Kumar
NIT Patna
14 shared publications Ashish Kumar Dwivedi
Department of Computer Science and Engineering, National Institute of Technology Rourkela, 769008, Odisha, India
9 shared publications- Lov Kumar
National Institute of Technology Kurukshetra, Kurukshetra, India
9 shared publications - Ranjan Kumar Behera
Department of Computer Science and Engineering, National Institute of Technology, Rourkela, India
8 shared publications - Sanjay Misra
Institute for Energy Technology Halden Norway
7 shared publications
Latest Publications
- 28 June 2023
- Published by Springer Nature
- p. 409-420
Image Transformation Based Detection of Breast Cancer Using Thermograms
- 28 June 2023
- Published by Springer Nature
- p. 409-420
Image Transformation Based Detection of Breast Cancer Using Thermograms
- 19 May 2023
- Published by Springer Nature
- p. 311-321
Feature Analysis for Detection of Breast Cancer Thermograms Using Dimensionality Reduction Techniques
- 19 May 2023
- Published by Springer Nature
- p. 311-321
Feature Analysis for Detection of Breast Cancer Thermograms Using Dimensionality Reduction Techniques
- 16 May 2023
- Published by Springer Nature
- p. 793-804
Local and Global Thresholding-Based Breast Cancer Detection Using Thermograms
- 16 May 2023
- Published by Springer Nature
- p. 793-804
Local and Global Thresholding-Based Breast Cancer Detection Using Thermograms
- 1 January 2023
- Published by Springer Nature
- p. 357-369
Detection of Credit Card Fraud by Applying Genetic Algorithm and Particle Swarm Optimization
- 1 January 2023
- Published by Springer Nature
- p. 357-369
Detection of Credit Card Fraud by Applying Genetic Algorithm and Particle Swarm Optimization
- Open Access
- 2 November 2021
- Published by EasyChair
- Vol. 79, 171-180
Detection of Web Service Anti-patterns Using Various Combinations of WSDL Metrics.
- 2 November 2021
- Published by EasyChair
- Vol. 79, 171-180
Open AccessDetection of Web Service Anti-patterns Using Various Combinations of WSDL Metrics.
- 11 September 2021
- Published by Springer Nature
- p. 263-276
An Empirical Analysis on the Prediction of Web Service Anti-patterns Using Source Code Metrics and Ensemble Techniques
- 11 September 2021
- Published by Springer Nature
- p. 263-276
An Empirical Analysis on the Prediction of Web Service Anti-patterns Using Source Code Metrics and Ensemble Techniques
- 4 May 2021
- Published by Springer Nature in Arabian Journal for Science and Engineering
- Vol. 46 (9) , 1-20
Credit Card Fraud Detection Technique by Applying Graph Database Model
- 4 May 2021
- Published by Springer Nature in Arabian Journal for Science and Engineering
- Vol. 46 (9) , 1-20
Credit Card Fraud Detection Technique by Applying Graph Database Model
- 23 March 2021
- Published by Springer Nature in SN Computer Science
- Vol. 2 (3) , 1-9
Service-Based Credit Card Fraud Detection Using Oracle SOA Suite
- 23 March 2021
- Published by Springer Nature in SN Computer Science
- Vol. 2 (3) , 1-9
Service-Based Credit Card Fraud Detection Using Oracle SOA Suite
- Open Access
- 25 February 2021
- Published by Association for Computing Machinery (ACM)
- p. 1-5
An Empirical Study to investigate the Effectiveness of Different Variants of SMOTE for Improving Web Service Anti-Patterns Prediction
In today’s world, IT professionals must ensure that all enterprise applications are running smoothly and are communicating with each other. Service-Oriented Architecture(SOA) provides the organization with a framework that makes the management of information technology systems affordable and manageable. Service-Based Systems(SBS) need to adapt themselves over time to fit in the new client prerequisites. These outcomes in the weakening of the software systems quality and plan and may cause the emergence of poor solutions called Anti-patterns. An anti-pattern is a repeated application of code or design that leads to a bad outcome. The research uncovered that the presence of anti-patterns thwarts the software systems advancement and maintenance. The early prediction of these anti-pattern using extracted features from source code helps to reduce the software system’s maintenance and enhance the quality of the software. This present work’s ideology is to investigate the viability of different data sampling technique variants empirically and the machine learning technique, Naive Bayes, in the anti-patterns prediction in web services.
- 25 February 2021
- Published by Association for Computing Machinery (ACM)
- p. 1-5
Open AccessAn Empirical Study to investigate the Effectiveness of Different Variants of SMOTE for Improving Web Service Anti-Patterns Prediction
In today’s world, IT professionals must ensure that all enterprise applications are running smoothly and are communicating with each other. Service-Oriented Architecture(SOA) provides the organization with a framework that makes the management of information technology systems affordable and manageable. Service-Based Systems(SBS) need to adapt themselves over time to fit in the new client prerequisites. These outcomes in the weakening of the software systems quality and plan and may cause the emergence of poor solutions called Anti-patterns. An anti-pattern is a repeated application of code or design that leads to a bad outcome. The research uncovered that the presence of anti-patterns thwarts the software systems advancement and maintenance. The early prediction of these anti-pattern using extracted features from source code helps to reduce the software system’s maintenance and enhance the quality of the software. This present work’s ideology is to investigate the viability of different data sampling technique variants empirically and the machine learning technique, Naive Bayes, in the anti-patterns prediction in web services.
- 29 September 2020
- Published by Springer Nature
- Vol. 12252, 906-917
Quantifying Influential Communities in Granular Social Networks Using Fuzzy Theory
Community detection and centrality analysis in social networks are identified as pertinent research topics in the field of social network analysis. Community detection focuses on identifying the sub-graphs (communities) which have dense connections within it as compared to outside of it, whereas centrality analysis focuses on identifying significant nodes in a social network based on different aspects of importance. A number of research works have focused on identifying community structure in large-scale network. However, very less effort has been emphasized on quantifying the influence of the communities. In this paper, group of nodes that are likely to form communities are first uncovered and then they are quantified based on the influencing ability in the network. Identifying exact boundaries of communities are quite challenging in large scale network. The major contribution in this paper is to develop a model termed as FRC-FGSN (Fuzzy Rough Communities in Fuzzy Granular Social Network), to identify the communities with the help of fuzzy and rough set theory. The proposed model is based on a idea that, the degree of belongingness a node in a community may not be binary but can be models through fuzzy membership. The second contribution is to quantifying the influence of the community using eigenvector centrality. In order to improve the scalability, several steps in the proposed model have been implemented using map-reduce programming paradigm in a cluster-computing framework like Hadoop. Comparative analysis of FRC-FGSN with other parallel algorithms as available in the literature has been presented to demonstrate the scalability and effectiveness of the algorithm.
- 29 September 2020
- Published by Springer Nature
- Vol. 12252, 906-917
Quantifying Influential Communities in Granular Social Networks Using Fuzzy Theory
Community detection and centrality analysis in social networks are identified as pertinent research topics in the field of social network analysis. Community detection focuses on identifying the sub-graphs (communities) which have dense connections within it as compared to outside of it, whereas centrality analysis focuses on identifying significant nodes in a social network based on different aspects of importance. A number of research works have focused on identifying community structure in large-scale network. However, very less effort has been emphasized on quantifying the influence of the communities. In this paper, group of nodes that are likely to form communities are first uncovered and then they are quantified based on the influencing ability in the network. Identifying exact boundaries of communities are quite challenging in large scale network. The major contribution in this paper is to develop a model termed as FRC-FGSN (Fuzzy Rough Communities in Fuzzy Granular Social Network), to identify the communities with the help of fuzzy and rough set theory. The proposed model is based on a idea that, the degree of belongingness a node in a community may not be binary but can be models through fuzzy membership. The second contribution is to quantifying the influence of the community using eigenvector centrality. In order to improve the scalability, several steps in the proposed model have been implemented using map-reduce programming paradigm in a cluster-computing framework like Hadoop. Comparative analysis of FRC-FGSN with other parallel algorithms as available in the literature has been presented to demonstrate the scalability and effectiveness of the algorithm.