Himanshu Mittal
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
Himanshu Mittal has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
Ashish Kumar Tripathi
Department of Computer Science, Malaviya National Institute of Technology, Jaipur, India
3 shared publications- Avinash Chandra Pandey
PDPM Indian Institute of Information Technology, Design and Manufacturing, Jabalpur, India
3 shared publications - Raju Pal
Gautam Buddha University
3 shared publications - Ashish Kumar Tripathi
Malaviya National Institute of Technology Jaipur, Jaipur, India
2 shared publications Avinash Chandra Pandey
Department of Computer Science & Engineering, PDPM Indian Institute of Inormation Technology, Design & Manufacturing, Jabalpur, India
2 shared publicationsMukesh Saraswat
Jaypee Institute of Information Technology
2 shared publications
Latest Publications
- 14 February 2026
- Published by Springer Nature in Theoretical and Applied Climatology
- Vol. 157 (3) , 141
GOA-SSVR: a novel parallel architecture approach for air pollution forecasting using apache spark and grasshopper optimizer
- 14 February 2026
- Published by Springer Nature in Theoretical and Applied Climatology
- Vol. 157 (3) , 141
GOA-SSVR: a novel parallel architecture approach for air pollution forecasting using apache spark and grasshopper optimizer
- 1 July 2025
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 16 (10) , 8215-8235
SGSA-C: a new spiky gravitational search algorithm clustering method for segmentation
- 1 July 2025
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 16 (10) , 8215-8235
SGSA-C: a new spiky gravitational search algorithm clustering method for segmentation
- 14 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 24 (9) , 9561-9570
CAT-CapsNet: A Convolutional and Attention Based Capsule Network to Detect the Driver’s Distraction
Worldwide inflation in the count of road accidents has raised an alarming scenario wherein driver distraction is identified as one of the main causes. According to the National Highway Traffic Safety Administration survey, talking over the mobile or fellow passengers, eating or drinking while driving, and operating in-vehicle menus can lead to distract the driver. Therefore, this paper presents a new driver distraction detection method to cater such scenarios. The proposed method is a convolution-based capsule network with attention mechanism, termed as CAT-CapsNet, that combines the computation capabilities of capsule network with attention module and convolution filters. We evaluate the proposed CAT-CapsNet on two publicly available driver distraction datasets namely, American University in Cairo (AUC) distracted driver dataset and Statefarmŝ dataset. A comparative analysis of the proposed model is conducted against 16 (approx) state-of-the-art methods in terms of accuracy, number of parameters, and AUC curves. Experiments affirm that CAT-CapsNet outperforms with the accuracy of $99.88\%$ on SFD dataset and $96.7\%$ accuracy on the AUC dataset. Moreover, the proposed model has only $8.5M$ parameters to train and no data augmentation is needed in-case training samples are less.
- 14 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 24 (9) , 9561-9570
CAT-CapsNet: A Convolutional and Attention Based Capsule Network to Detect the Driver’s Distraction
Worldwide inflation in the count of road accidents has raised an alarming scenario wherein driver distraction is identified as one of the main causes. According to the National Highway Traffic Safety Administration survey, talking over the mobile or fellow passengers, eating or drinking while driving, and operating in-vehicle menus can lead to distract the driver. Therefore, this paper presents a new driver distraction detection method to cater such scenarios. The proposed method is a convolution-based capsule network with attention mechanism, termed as CAT-CapsNet, that combines the computation capabilities of capsule network with attention module and convolution filters. We evaluate the proposed CAT-CapsNet on two publicly available driver distraction datasets namely, American University in Cairo (AUC) distracted driver dataset and Statefarmŝ dataset. A comparative analysis of the proposed model is conducted against 16 (approx) state-of-the-art methods in terms of accuracy, number of parameters, and AUC curves. Experiments affirm that CAT-CapsNet outperforms with the accuracy of $99.88\%$ on SFD dataset and $96.7\%$ accuracy on the AUC dataset. Moreover, the proposed model has only $8.5M$ parameters to train and no data augmentation is needed in-case training samples are less.
- Open Access
- 3 January 2023
- Published by MDPI AG in Algorithms
- Vol. 16 (1) , 28
Augmentation of Densest Subgraph Finding Unsupervised Feature Selection Using Shared Nearest Neighbor Clustering
Determining the optimal feature set is a challenging problem, especially in an unsupervised domain. To mitigate the same, this paper presents a new unsupervised feature selection method, termed as densest feature graph augmentation with disjoint feature clusters. The proposed method works in two phases. The first phase focuses on finding the maximally non-redundant feature subset and disjoint features are added to the feature set in the second phase. To experimentally validate, the efficiency of the proposed method has been compared against five existing unsupervised feature selection methods on five UCI datasets in terms of three performance criteria, namely clustering accuracy, normalized mutual information, and classification accuracy. The experimental analyses have shown that the proposed method outperforms the considered methods.
- 3 January 2023
- Published by MDPI AG in Algorithms
- Vol. 16 (1) , 28
Open AccessAugmentation of Densest Subgraph Finding Unsupervised Feature Selection Using Shared Nearest Neighbor Clustering
Determining the optimal feature set is a challenging problem, especially in an unsupervised domain. To mitigate the same, this paper presents a new unsupervised feature selection method, termed as densest feature graph augmentation with disjoint feature clusters. The proposed method works in two phases. The first phase focuses on finding the maximally non-redundant feature subset and disjoint features are added to the feature set in the second phase. To experimentally validate, the efficiency of the proposed method has been compared against five existing unsupervised feature selection methods on five UCI datasets in terms of three performance criteria, namely clustering accuracy, normalized mutual information, and classification accuracy. The experimental analyses have shown that the proposed method outperforms the considered methods.
- 29 November 2022
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 82 (16) , 23979-24029
Improved exponential cuckoo search method for sentiment analysis
- 29 November 2022
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 82 (16) , 23979-24029
Improved exponential cuckoo search method for sentiment analysis
- 8 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 10 (5) , 2617-2626
A N2CNN-Based Anomaly Detection Method for Cardiovascular Data in Cyber-Physical System
Internet-of-medical-things is the new means of monitoring patient health remotely. However, the real-time detection of anomalies in the patient data is a challenging task, especially on ECG-data. To ease the same, a novel method, NSGA-II based convolution neural network, is presented in this paper for efficient anomaly detection. In the proposed method, non-dominated sorting genetic algorithm-II is employed to obtain optimal hyper-parameters of CNN by evaluating three objective functions namely, accuracy, precision, and recall. Further, the performance validation of the proposed method is conducted on two public datasets and compared against seven state-of-the-art methods. Experimental results affirm that the proposed method outperforms the considered methods with an accuracy of 94.83% and 94.96% on MIT-BIH arrhythmia dataset and INCART dataset, respectively. Therefore, it can be claimed that the proposed method is an efficient alternative for anomaly detection.
- 8 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 10 (5) , 2617-2626
A N2CNN-Based Anomaly Detection Method for Cardiovascular Data in Cyber-Physical System
Internet-of-medical-things is the new means of monitoring patient health remotely. However, the real-time detection of anomalies in the patient data is a challenging task, especially on ECG-data. To ease the same, a novel method, NSGA-II based convolution neural network, is presented in this paper for efficient anomaly detection. In the proposed method, non-dominated sorting genetic algorithm-II is employed to obtain optimal hyper-parameters of CNN by evaluating three objective functions namely, accuracy, precision, and recall. Further, the performance validation of the proposed method is conducted on two public datasets and compared against seven state-of-the-art methods. Experimental results affirm that the proposed method outperforms the considered methods with an accuracy of 94.83% and 94.96% on MIT-BIH arrhythmia dataset and INCART dataset, respectively. Therefore, it can be claimed that the proposed method is an efficient alternative for anomaly detection.
- 23 January 2021
- Published by Springer Nature in Applied Intelligence
- Vol. 51 (5) , 2988-3011
A new clustering method for the diagnosis of CoVID19 using medical images
With the spread of COVID-19, there is an urgent need for a fast and reliable diagnostic aid. For the same, literature has witnessed that medical imaging plays a vital role, and tools using supervised methods have promising results. However, the limited size of medical images for diagnosis of CoVID19 may impact the generalization of such supervised methods. To alleviate this, a new clustering method is presented. In this method, a novel variant of a gravitational search algorithm is employed for obtaining optimal clusters. To validate the performance of the proposed variant, a comparative analysis among recent metaheuristic algorithms is conducted. The experimental study includes two sets of benchmark functions, namely standard functions and CEC2013 functions, belonging to different categories such as unimodal, multimodal, and unconstrained optimization functions. The performance comparison is evaluated and statistically validated in terms of mean fitness value, Friedman test, and box-plot. Further, the presented clustering method tested against three different types of publicly available CoVID19 medical images, namely X-ray, CT scan, and Ultrasound images. Experiments demonstrate that the proposed method is comparatively outperforming in terms of accuracy, precision, sensitivity, specificity, and F1-score.
- 23 January 2021
- Published by Springer Nature in Applied Intelligence
- Vol. 51 (5) , 2988-3011
A new clustering method for the diagnosis of CoVID19 using medical images
With the spread of COVID-19, there is an urgent need for a fast and reliable diagnostic aid. For the same, literature has witnessed that medical imaging plays a vital role, and tools using supervised methods have promising results. However, the limited size of medical images for diagnosis of CoVID19 may impact the generalization of such supervised methods. To alleviate this, a new clustering method is presented. In this method, a novel variant of a gravitational search algorithm is employed for obtaining optimal clusters. To validate the performance of the proposed variant, a comparative analysis among recent metaheuristic algorithms is conducted. The experimental study includes two sets of benchmark functions, namely standard functions and CEC2013 functions, belonging to different categories such as unimodal, multimodal, and unconstrained optimization functions. The performance comparison is evaluated and statistically validated in terms of mean fitness value, Friedman test, and box-plot. Further, the presented clustering method tested against three different types of publicly available CoVID19 medical images, namely X-ray, CT scan, and Ultrasound images. Experiments demonstrate that the proposed method is comparatively outperforming in terms of accuracy, precision, sensitivity, specificity, and F1-score.
- Open Access
- 27 September 2020
- Published by Springer Nature in Complex & Intelligent Systems
- Vol. 7 (1) , 297-309
A new recommendation system using map-reduce-based tournament empowered Whale optimization algorithm
In the era of Web 2.0, the data are growing immensely and is assisting E-commerce websites for better decision-making. Collaborative filtering, one of the prominent recommendation approaches, performs recommendation by finding similarity. However, this approach fails in managing large-scale datasets. To mitigate the same, an efficient map-reduce-based clustering recommendation system is presented. The proposed method uses a novel variant of the whale optimization algorithm, tournament selection empowered whale optimization algorithm, to attain the optimal clusters. The clustering efficiency of the proposed method is measured on four large-scale datasets in terms of F-measure and computation time. The experimental results are compared with state-of-the-art map-reduce-based clustering methods, namely map-reduce-based K-means, map-reduce-based bat algorithm, map-reduce-based Kmeans particle swarm optimization, map-reduce-based artificial bee colony, and map-reduce-based whale optimization algorithm. Furthermore, the proposed method is tested as a recommendation system on the publicly available movie-lens dataset. The performance validation is measured in terms of mean absolute error, precision and recall, over a different number of clusters. The experimental results assert that the proposed method is a permissive approach for the recommendation over large-scale datasets.
- 27 September 2020
- Published by Springer Nature in Complex & Intelligent Systems
- Vol. 7 (1) , 297-309
Open AccessA new recommendation system using map-reduce-based tournament empowered Whale optimization algorithm
In the era of Web 2.0, the data are growing immensely and is assisting E-commerce websites for better decision-making. Collaborative filtering, one of the prominent recommendation approaches, performs recommendation by finding similarity. However, this approach fails in managing large-scale datasets. To mitigate the same, an efficient map-reduce-based clustering recommendation system is presented. The proposed method uses a novel variant of the whale optimization algorithm, tournament selection empowered whale optimization algorithm, to attain the optimal clusters. The clustering efficiency of the proposed method is measured on four large-scale datasets in terms of F-measure and computation time. The experimental results are compared with state-of-the-art map-reduce-based clustering methods, namely map-reduce-based K-means, map-reduce-based bat algorithm, map-reduce-based Kmeans particle swarm optimization, map-reduce-based artificial bee colony, and map-reduce-based whale optimization algorithm. Furthermore, the proposed method is tested as a recommendation system on the publicly available movie-lens dataset. The performance validation is measured in terms of mean absolute error, precision and recall, over a different number of clusters. The experimental results assert that the proposed method is a permissive approach for the recommendation over large-scale datasets.
- 13 August 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 29 (11) , 3249-3258
A New Fuzzy Cluster Validity Index for Hyperellipsoid or Hyperspherical Shape Close Clusters With Distant Centroids
Determining the correct number of clusters is essential for efficient clustering and cluster validity indices are widely used for the same. Generally, the effectiveness of a cluster validity index relies on two factors: first, separation, defined by the distance between a pair of cluster centroids or a pair of data points belonging to different clusters and second, compactness, which is determined in terms of the distance between a data point and a centroid or between a pair of data points belonging to the same cluster. However, the existing cluster validity indices for centroid-based clustering are unreliable when the clusters are too close, but corresponding centroids are distant. To mitigate this, a new cluster validity index, Saraswat-and-Mittal index, has been proposed in this article for hyperellipsoid or hyperspherical shape close clusters with distant centroids, generated by fuzzy c-means. The proposed index computes compactness in terms of the distance between data points and corresponding centroids, whereas the distance between data points of disjoint clusters defines separation. These parameters benefit the proposed index in the analysis of close clusters with distinct centroids efficiently. The performance of the proposed index is validated against ten state-of-the-art cluster validity indices on artificial, UCI, and image datasets, clustered by the fuzzy c-means.
- 13 August 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 29 (11) , 3249-3258
A New Fuzzy Cluster Validity Index for Hyperellipsoid or Hyperspherical Shape Close Clusters With Distant Centroids
Determining the correct number of clusters is essential for efficient clustering and cluster validity indices are widely used for the same. Generally, the effectiveness of a cluster validity index relies on two factors: first, separation, defined by the distance between a pair of cluster centroids or a pair of data points belonging to different clusters and second, compactness, which is determined in terms of the distance between a data point and a centroid or between a pair of data points belonging to the same cluster. However, the existing cluster validity indices for centroid-based clustering are unreliable when the clusters are too close, but corresponding centroids are distant. To mitigate this, a new cluster validity index, Saraswat-and-Mittal index, has been proposed in this article for hyperellipsoid or hyperspherical shape close clusters with distant centroids, generated by fuzzy c-means. The proposed index computes compactness in terms of the distance between data points and corresponding centroids, whereas the distance between data points of disjoint clusters defines separation. These parameters benefit the proposed index in the analysis of close clusters with distinct centroids efficiently. The performance of the proposed index is validated against ten state-of-the-art cluster validity indices on artificial, UCI, and image datasets, clustered by the fuzzy c-means.
- 5 December 2018
- Published by Springer Nature in Evolutionary Intelligence
- Vol. 14 (3) , 1293-1305
An image segmentation method using logarithmic kbest gravitational search algorithm based superpixel clustering
- 5 December 2018
- Published by Springer Nature in Evolutionary Intelligence
- Vol. 14 (3) , 1293-1305
An image segmentation method using logarithmic kbest gravitational search algorithm based superpixel clustering