Rajeev Kumar
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
Rajeev Kumar has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Akanksha Mukhriya
Jawaharlal Nehru University
3 shared publications - Mahesh Shirole
Department of Computer Engineering and Information Technology, Veermata Jijabai Technological Institute, Mumbai 400019, India
3 shared publications - Sonal Tuteja
Jaypee Institute of Information Technology, India
3 shared publications Sonam Chhikara
Data to Knowledge (D2K) Lab, School of Computer & Systems Sciences, Jawaharlal Nehru University, New Delhi, India
3 shared publications- Law Kumar
Jawaharlal Nehru University
2 shared publications - Roopam Sadh
Jawaharlal Nehru University
2 shared publications
Latest Publications
- Open Access
- 28 March 2025
- Published by Pensoft Publishers in JUCS - Journal of Universal Computer Science
- Vol. 31 (4) , 312-337
A Java Compiler Plugin for Type-Safe Inferences in Generics
The two most significant yet complex elements of Java generics are wildcards and type argument inference. Both processes rely on the compiler. Even though type argument inference and wildcard execution are implicit processes, a programmer should be aware of them to make the most of the features. A compiler error message tells much about the code and the process mechanism. If the error message is unambiguous and sound, it is easy for the programmer to debug the code. However, in the context of wildcard-type argument inference, the current Javac compiler emits cryptic and imprecise error messages. A programmer may get confused about the inference outcome and failure, so it will be difficult to resolve the errors easily. In this paper, we propose a few additions to the current Wildcard-based type inference algorithm to get detailed and valuable error messages. We implement a Java compiler plugin tool based on the proposed algorithm. The plugin can be easily executed through the Java command line. It gives a comprehensive error message that aids programmers in resolving errors more effectively.
- 28 March 2025
- Published by Pensoft Publishers in JUCS - Journal of Universal Computer Science
- Vol. 31 (4) , 312-337
Open AccessA Java Compiler Plugin for Type-Safe Inferences in Generics
The two most significant yet complex elements of Java generics are wildcards and type argument inference. Both processes rely on the compiler. Even though type argument inference and wildcard execution are implicit processes, a programmer should be aware of them to make the most of the features. A compiler error message tells much about the code and the process mechanism. If the error message is unambiguous and sound, it is easy for the programmer to debug the code. However, in the context of wildcard-type argument inference, the current Javac compiler emits cryptic and imprecise error messages. A programmer may get confused about the inference outcome and failure, so it will be difficult to resolve the errors easily. In this paper, we propose a few additions to the current Wildcard-based type inference algorithm to get detailed and valuable error messages. We implement a Java compiler plugin tool based on the proposed algorithm. The plugin can be easily executed through the Java command line. It gives a comprehensive error message that aids programmers in resolving errors more effectively.
- 19 September 2024
- Published by Springer Nature
- p. 317-327
Feature-Based Anomaly Detection in Static Social Networks
- 19 September 2024
- Published by Springer Nature
- p. 317-327
Feature-Based Anomaly Detection in Static Social Networks
- 17 September 2024
- Published by Elsevier in Pattern Recognition
- Vol. 158
Iterative target updation based boosting ensembles for outlier detection
- 17 September 2024
- Published by Elsevier in Pattern Recognition
- Vol. 158
Iterative target updation based boosting ensembles for outlier detection
- 2 August 2024
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 84 (20) , 22139-22159
3D U-Net-Norm architecture for improving generalization of BraTS images
- 2 August 2024
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 84 (20) , 22139-22159
3D U-Net-Norm architecture for improving generalization of BraTS images
- Open Access
- 22 February 2024
- Published by Springer Nature in Research Square
Test Scenario Generation from Nested ConcurrentActivity Diagrams
UML is a de-facto standard for system and test cases design, yet test scenariogeneration for concurrent systems is challenging due to constructs such as forkjoinand their nesting. Systematically exploring complete interleaving space ofsuch test scenarios is an exponential task. Existing activity diagram test scenariogeneration algorithms explore a restricted interleaving space, which maybe insufficient to uncover most concurrency errors. Therefore, in this work, weuse evolutionary search for exploring wider interleaving space from concurrentactivity diagrams. The naive evolutionary search yields many infeasible interleavingpaths, therefore, we design evolutionary search operators, traversals andfitness functions, using graph-theoretic domain knowledge, for optimizing functionvalues with constraint satisfaction for feasible interleaving paths. We presentevolutionary and hybrid evolutionary search algorithms for generating concurrenttest scenarios from activity diagrams. We have observed, empirically, that evolutionarysearch satisfies 5-50% interleavings activity path coverage at the costof higher convergence time. However, such high convergence time is significantlyreduced in the range of 40-50% using hybrid evolutionary search with the samecoverage.
- 22 February 2024
- Published by Springer Nature in Research Square
Open AccessTest Scenario Generation from Nested ConcurrentActivity Diagrams
UML is a de-facto standard for system and test cases design, yet test scenariogeneration for concurrent systems is challenging due to constructs such as forkjoinand their nesting. Systematically exploring complete interleaving space ofsuch test scenarios is an exponential task. Existing activity diagram test scenariogeneration algorithms explore a restricted interleaving space, which maybe insufficient to uncover most concurrency errors. Therefore, in this work, weuse evolutionary search for exploring wider interleaving space from concurrentactivity diagrams. The naive evolutionary search yields many infeasible interleavingpaths, therefore, we design evolutionary search operators, traversals andfitness functions, using graph-theoretic domain knowledge, for optimizing functionvalues with constraint satisfaction for feasible interleaving paths. We presentevolutionary and hybrid evolutionary search algorithms for generating concurrenttest scenarios from activity diagrams. We have observed, empirically, that evolutionarysearch satisfies 5-50% interleavings activity path coverage at the costof higher convergence time. However, such high convergence time is significantlyreduced in the range of 40-50% using hybrid evolutionary search with the samecoverage.
- Open Access
- 22 January 2024
- Published by AGH University Press in Computer Science
- Vol. 25 (1) , 47-77
Generalizing Clustering Inferences with ML Augmentation of Ordinal Survey Data
In this paper, we attempt to generalize the ability to achieve quality inferences of survey data for a larger population through data augmentation and unification. Data augmentation techniques have proven effective in enhancing models' performance by expanding the dataset's size. We employ ML data augmentation, unification, and clustering techniques. First, we augment the \textit{limited} survey data size using data augmentation technique(s). Next, we carry out data unification, followed by clustering for inferencing. We took two benchmark survey datasets to demonstrate the effectiveness of augmentation and unification. One is on features of students to be entrepreneurs, and the second is breast cancer survey data. We compare the results of the inference obtained from the raw survey data and the newly converted data. The results of this study indicate that the machine learning approach, data augmentation with the unification of data followed by clustering, can be beneficial for generalizing the inferences drawn from the survey data.
- 22 January 2024
- Published by AGH University Press in Computer Science
- Vol. 25 (1) , 47-77
Open AccessGeneralizing Clustering Inferences with ML Augmentation of Ordinal Survey Data
In this paper, we attempt to generalize the ability to achieve quality inferences of survey data for a larger population through data augmentation and unification. Data augmentation techniques have proven effective in enhancing models' performance by expanding the dataset's size. We employ ML data augmentation, unification, and clustering techniques. First, we augment the \textit{limited} survey data size using data augmentation technique(s). Next, we carry out data unification, followed by clustering for inferencing. We took two benchmark survey datasets to demonstrate the effectiveness of augmentation and unification. One is on features of students to be entrepreneurs, and the second is breast cancer survey data. We compare the results of the inference obtained from the raw survey data and the newly converted data. The results of this study indicate that the machine learning approach, data augmentation with the unification of data followed by clustering, can be beneficial for generalizing the inferences drawn from the survey data.
- 25 November 2023
- Published by Springer Nature
- p. 333-343
Community Detection Algorithms in Social Networks: An Empirical Evaluation
- 25 November 2023
- Published by Springer Nature
- p. 333-343
Community Detection Algorithms in Social Networks: An Empirical Evaluation
- 8 August 2023
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 83 (8) , 22749-22771
A unified generalization enabled ML architecture for manipulated multi-modal social media
- 8 August 2023
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 83 (8) , 22749-22771
A unified generalization enabled ML architecture for manipulated multi-modal social media
- Open Access
- 10 March 2023
- Published by AGH University Press in Computer Science
- Vol. 24 (2) , 211-230
TRANSFORMATION AND CLASSIFICATION OF ORDINAL SURVEY DATA
Currently, Machine Learning is being significantly used in almost all of the research domains. However, its applicability in survey research is still in its infancy. We in this paper, attempt to highlight the applicability of Machine Learning in survey research while working on two different aspects in parallel. First, we introduce a pattern-based transformation method for ordinal survey data. Our purpose behind developing such a transformation method is twofold. Our transformation facilitates easy interpretation of ordinal survey data and provides convenience while applying standard Machine Learning approaches. Second, we demonstrate the application of various classification techniques over real and transformed ordinal survey data and interpret their results in terms of their suitability in survey research. Our experimental results suggest that Machine Learning coupled with the Pattern Recognition paradigm has a tremendous scope in survey research.
- 10 March 2023
- Published by AGH University Press in Computer Science
- Vol. 24 (2) , 211-230
Open AccessTRANSFORMATION AND CLASSIFICATION OF ORDINAL SURVEY DATA
Currently, Machine Learning is being significantly used in almost all of the research domains. However, its applicability in survey research is still in its infancy. We in this paper, attempt to highlight the applicability of Machine Learning in survey research while working on two different aspects in parallel. First, we introduce a pattern-based transformation method for ordinal survey data. Our purpose behind developing such a transformation method is twofold. Our transformation facilitates easy interpretation of ordinal survey data and provides convenience while applying standard Machine Learning approaches. Second, we demonstrate the application of various classification techniques over real and transformed ordinal survey data and interpret their results in terms of their suitability in survey research. Our experimental results suggest that Machine Learning coupled with the Pattern Recognition paradigm has a tremendous scope in survey research.