Vikas Jain
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
Vikas Jain has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Ashish Phophalia
Indian Institute of Information Technology Vadodara
2 shared publications - Kaushal Bhardwaj
School of Computer Science Engineering and Technology, Bennett University, Greater Noida, Uttar Pradesh, India
2 shared publications Anurag Dod
Department of Electrical Engineering, Indian Institute of Technology, New Delhi 110016, India
1 shared publicationAshish Phophalia
Indian Institute of Information Technology Vadodara, Gandhinagar, India
1 shared publication- Ashwin Sharma
Bennett University
1 shared publication - Atul Rai
Bennett University
1 shared publication
Latest Publications
- 2 September 2026
- Published by Springer Nature
- p. 356-365
Choosing the Right Optimizer and Loss Function: A Deep Learning Perspective on Hyperspectral Image Classification
- 2 September 2026
- Published by Springer Nature
- p. 356-365
Choosing the Right Optimizer and Loss Function: A Deep Learning Perspective on Hyperspectral Image Classification
- 5 February 2026
- Published by Springer Nature
- p. 1-13
A Novel Approach for Diabetic Retinopathy Detection with Class Imbalanced Datasets
- 5 February 2026
- Published by Springer Nature
- p. 1-13
A Novel Approach for Diabetic Retinopathy Detection with Class Imbalanced Datasets
- 3 January 2026
- Published by Springer Nature
- p. 13-23
Enhancing Cybersecurity Log Analysis with LogGPT: A Novel LLM-Based Approach
- 3 January 2026
- Published by Springer Nature
- p. 13-23
Enhancing Cybersecurity Log Analysis with LogGPT: A Novel LLM-Based Approach
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- p. 1
Subpixel-Aware Hyperspectral Image Classification Using ETAP-Guided Autoencoder and Vision Transformer Fusion
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- p. 1
Open AccessSubpixel-Aware Hyperspectral Image Classification Using ETAP-Guided Autoencoder and Vision Transformer Fusion
- Open Access
- 31 October 2023
- Published by Qeios Ltd
Review of: "Chronic disease treatment default prediction with random sampling optimization."
Authors used over and under-sampling techniques to address class imbalance problems. They used well-known machine learning approaches such as extreme gradient boosting, gradient boosting, random forest, support vector machines, and logistic regres...
- 31 October 2023
- Published by Qeios Ltd
Open AccessReview of: "Chronic disease treatment default prediction with random sampling optimization."
Authors used over and under-sampling techniques to address class imbalance problems. They used well-known machine learning approaches such as extreme gradient boosting, gradient boosting, random forest, support vector machines, and logistic regres...
- 28 September 2022
- Published by Elsevier in Computers in Biology and Medicine
- Vol. 150, 106092
SVD-CLAHE boosting and balanced loss function for Covid-19 detection from an imbalanced Chest X-Ray dataset
- 28 September 2022
- Published by Elsevier in Computers in Biology and Medicine
- Vol. 150, 106092
SVD-CLAHE boosting and balanced loss function for Covid-19 detection from an imbalanced Chest X-Ray dataset
- Open Access
- 24 February 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 22902-22914
HML-RF: Hybrid Multi-Label Random Forest
Multi-label classification is the supervised learning problem in which an instance is associated with a set of labels. In this, labels are correlated, and hence label dependency information plays a vital role. Its always been a question of research to decide the order of labels to exploit their inter-dependency. Hence, to this end, many research works are done that, in general, can be categorized as problem transformation and algorithm adaptation techniques. The problem transformation reconstructs the multi-label problem as a multiple single class problem. The algorithm transformation modifies the existing well-known machine learning approaches to solve the multi-label classification problem. However, these two techniques have their pros and cons. In this paper, we propose a novel approach to consider the merits of both techniques, hence named Hybrid Multi-Label Random Forest (HML-RF). The multi-label decision trees are used as base classifiers in the proposed approach to construct the HML-RF model. Each base classifier is constructed over a randomly selected subset of labels to exploit the label dependency. We also formulate a way to compute the tree strength of a multi-label decision tree, which is used to construct the HML-RF with strength (HML-RFws). The efficacy of the proposed approach is tested over the ten well-known and publicly available datasets. Experimental results show the HML-RF is performing better for at-least six datasets, and the HML-RFws is performing better for at-least nine datasets in comparison to state-of-the-art approaches in terms of accuracy, hamming loss, and zero-one loss. Finally, the statistical test is also validating all the experimental results.
- 24 February 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 22902-22914
Open AccessHML-RF: Hybrid Multi-Label Random Forest
Multi-label classification is the supervised learning problem in which an instance is associated with a set of labels. In this, labels are correlated, and hence label dependency information plays a vital role. Its always been a question of research to decide the order of labels to exploit their inter-dependency. Hence, to this end, many research works are done that, in general, can be categorized as problem transformation and algorithm adaptation techniques. The problem transformation reconstructs the multi-label problem as a multiple single class problem. The algorithm transformation modifies the existing well-known machine learning approaches to solve the multi-label classification problem. However, these two techniques have their pros and cons. In this paper, we propose a novel approach to consider the merits of both techniques, hence named Hybrid Multi-Label Random Forest (HML-RF). The multi-label decision trees are used as base classifiers in the proposed approach to construct the HML-RF model. Each base classifier is constructed over a randomly selected subset of labels to exploit the label dependency. We also formulate a way to compute the tree strength of a multi-label decision tree, which is used to construct the HML-RF with strength (HML-RFws). The efficacy of the proposed approach is tested over the ten well-known and publicly available datasets. Experimental results show the HML-RF is performing better for at-least six datasets, and the HML-RFws is performing better for at-least nine datasets in comparison to state-of-the-art approaches in terms of accuracy, hamming loss, and zero-one loss. Finally, the statistical test is also validating all the experimental results.
- 30 October 2020
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 80 (28-29) , 35217-35238
M-ary Random Forest - A new multidimensional partitioning approach to Random Forest
- 30 October 2020
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 80 (28-29) , 35217-35238
M-ary Random Forest - A new multidimensional partitioning approach to Random Forest
- Open Access
- 1 January 2001
- Published by Hindawi Limited in VLSI Design
- Vol. 12 (1) , 81-99
Distributed Fault Simulation Algorithms on Parallel Virtual Machine
In this paper, we describe distributed algorithms for combinational fault simulation assuming the classical stuck-at fault model. Our algorithms have been implemented on a network of Sun workstations under the Parallel Virtual Machine (PVM) environment. Two techniques are used for subdividing work among processors – test set partition and fault set partition. The sequential algorithm for fault simulation, used on individual nodes of the network, is based on a novel path compression technique proposed in this paper. We describe experimental results on a number of ISCAS′85 benchmark circuits.
- 1 January 2001
- Published by Hindawi Limited in VLSI Design
- Vol. 12 (1) , 81-99
Open AccessDistributed Fault Simulation Algorithms on Parallel Virtual Machine
In this paper, we describe distributed algorithms for combinational fault simulation assuming the classical stuck-at fault model. Our algorithms have been implemented on a network of Sun workstations under the Parallel Virtual Machine (PVM) environment. Two techniques are used for subdividing work among processors – test set partition and fault set partition. The sequential algorithm for fault simulation, used on individual nodes of the network, is based on a novel path compression technique proposed in this paper. We describe experimental results on a number of ISCAS′85 benchmark circuits.