Vijay Verma
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
Vijay Verma has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Rajesh Kumar Aggarwal
National Institute of Technology
3 shared publications Rajesh Kumar Aggarwal
National Institute of Technology, Kurukshetra
2 shared publications- Vishal Gaba
National Institute of Technology Kurukshetra
2 shared publications Aditya Sharma
National Institute of Technology, Kurukshetra
1 shared publicationAvneesh Nischal
National Institute of Technology Kurukshetra
1 shared publicationJayeeta Chakraborty
Computer Engineering, National Institute of Technology, Kurukshetra, India
1 shared publication
Latest Publications
- 27 March 2025
- Published by Springer Nature
- p. 105-116
Toward Continuous Availability: Implementing Proactive Monitoring for AWS-Hosted Web Applications with Jenkins and Bitbucket
- 27 March 2025
- Published by Springer Nature
- p. 105-116
Toward Continuous Availability: Implementing Proactive Monitoring for AWS-Hosted Web Applications with Jenkins and Bitbucket
- 31 October 2024
- Published by Springer Nature
- p. 229-237
An Empirical Analysis of Neighborhood-Based Approaches for Trustworthy Recommendations with Apache Mahout
- 31 October 2024
- Published by Springer Nature
- p. 229-237
An Empirical Analysis of Neighborhood-Based Approaches for Trustworthy Recommendations with Apache Mahout
- Open Access
- 21 December 2022
- Published by Wiley
Session-based Recommendation Using Recurrent Neural Networks: A Comparative Theoretical Analysis
Recommender Systems(RSs) are widely used for providing suggestions to users on digital platforms. Recently, there has been a significant amount of interest in the class of session-based recommender systems (SBRSs) in the RS research community. In session-based recommendation scenarios, the task is to provide suggestions to the users subject to the interactions or data available in an ongoing session. In contrast to the traditional recommendation approaches (e.g. collaborative or content-based), which model long-term preferences , the SBRSs attempt to model the short-term preferences of users. Recurrent Neural Networks (RNNs) are great tools for modelling sequential data; therefore become good choices for SBRSs. This work performs a comparative analysis of the most prominent RNN-based approaches for SBRSs. Firstly, the RNN-based approaches are classified based on the characteristics of session data (such as session length, ordering of session data, etc.) that are exploited in the recommendation process. Secondly, a concise theoretical investigation of these approaches featuring their pros and cons is provided. Further, for each of these approaches, a simplified model architecture illustrating the overall functioning of the approach is also depicted. Finally, we observe that it is difficult to comprehend the state-of-the-art for RNN-based SBRS approaches.
- 21 December 2022
- Published by Wiley
Open AccessSession-based Recommendation Using Recurrent Neural Networks: A Comparative Theoretical Analysis
Recommender Systems(RSs) are widely used for providing suggestions to users on digital platforms. Recently, there has been a significant amount of interest in the class of session-based recommender systems (SBRSs) in the RS research community. In session-based recommendation scenarios, the task is to provide suggestions to the users subject to the interactions or data available in an ongoing session. In contrast to the traditional recommendation approaches (e.g. collaborative or content-based), which model long-term preferences , the SBRSs attempt to model the short-term preferences of users. Recurrent Neural Networks (RNNs) are great tools for modelling sequential data; therefore become good choices for SBRSs. This work performs a comparative analysis of the most prominent RNN-based approaches for SBRSs. Firstly, the RNN-based approaches are classified based on the characteristics of session data (such as session length, ordering of session data, etc.) that are exploited in the recommendation process. Secondly, a concise theoretical investigation of these approaches featuring their pros and cons is provided. Further, for each of these approaches, a simplified model architecture illustrating the overall functioning of the approach is also depicted. Finally, we observe that it is difficult to comprehend the state-of-the-art for RNN-based SBRS approaches.
- 30 August 2022
- Published by Springer Nature
- p. 143-155
Topic Popularity Prediction Using Similarity Graph on Twitter
- 30 August 2022
- Published by Springer Nature
- p. 143-155
Topic Popularity Prediction Using Similarity Graph on Twitter
- 7 May 2022
- Published by Springer Nature
- p. 140-152
Sentiment Analysis of Twitter Data Using Machine Learning Approaches
- 7 May 2022
- Published by Springer Nature
- p. 140-152
Sentiment Analysis of Twitter Data Using Machine Learning Approaches
- 5 May 2020
- Published by Springer Nature
- p. 91-110
Neighborhood-Based Collaborative Recommendations: An Introduction
- 5 May 2020
- Published by Springer Nature
- p. 91-110
Neighborhood-Based Collaborative Recommendations: An Introduction
- 8 April 2020
- Published by MECS Publisher in International Journal of Intelligent Systems and Applications
- Vol. 12 (2) , 44-53
A New Similarity Measure Based on Gravitational Attraction for Improving the Accuracy of Collaborative Recommendations
- 8 April 2020
- Published by MECS Publisher in International Journal of Intelligent Systems and Applications
- Vol. 12 (2) , 44-53
A New Similarity Measure Based on Gravitational Attraction for Improving the Accuracy of Collaborative Recommendations
- Open Access
- 8 June 2019
- Published by MECS Publisher in International Journal of Information Technology and Computer Science
- Vol. 11 (6) , 37-49
A New Similarity Measure Based on Simple Matching Coefficient for Improving the Accuracy of Collaborative Recommendations
Recommender Systems (RSs) are essential tools of an e-commerce portal in making intelligent decisions for an individual to obtain product recommendations. Neighborhood-based approaches are traditional techniques for collaborative recommendations and are very popular due to their simplicity and efficiency. Neighborhood-based recommender systems use numerous kinds of similarity measures for finding similar users or items. However, the existing similarity measures function only on common ratings between a pair of users (i.e. ignore the uncommon ratings) thus do not utilize all ratings made by a pair of users. Furthermore, the existing similarity measures may either provide inadequate results in many situations that frequently occur in sparse data or involve very complex calculations. Therefore, there is a compelling need to define a similarity measure that can deal with such issues. This research proposes a new similarity measure for defining the similarities between users or items by using the rating data available in the user-item matrix. Firstly, we describe a way for applying the simple matching coefficient (SMC) to the common ratings between users or items. Secondly, the structural information between the rating vectors is exploited using the Jaccard index. Finally, these two factors are leveraged to define the proposed similarity measure for better recommendation accuracy. For evaluating the effectiveness of the proposed method, several experiments have been performed using standardized benchmark datasets (MovieLens-1M, 10M, and 20M). Results obtained demonstrate that the proposed method provides better predictive accuracy (in terms of MAE and RMSE) along with improved classification accuracy (in terms of precision-recall).
- 8 June 2019
- Published by MECS Publisher in International Journal of Information Technology and Computer Science
- Vol. 11 (6) , 37-49
Open AccessA New Similarity Measure Based on Simple Matching Coefficient for Improving the Accuracy of Collaborative Recommendations
Recommender Systems (RSs) are essential tools of an e-commerce portal in making intelligent decisions for an individual to obtain product recommendations. Neighborhood-based approaches are traditional techniques for collaborative recommendations and are very popular due to their simplicity and efficiency. Neighborhood-based recommender systems use numerous kinds of similarity measures for finding similar users or items. However, the existing similarity measures function only on common ratings between a pair of users (i.e. ignore the uncommon ratings) thus do not utilize all ratings made by a pair of users. Furthermore, the existing similarity measures may either provide inadequate results in many situations that frequently occur in sparse data or involve very complex calculations. Therefore, there is a compelling need to define a similarity measure that can deal with such issues. This research proposes a new similarity measure for defining the similarities between users or items by using the rating data available in the user-item matrix. Firstly, we describe a way for applying the simple matching coefficient (SMC) to the common ratings between users or items. Secondly, the structural information between the rating vectors is exploited using the Jaccard index. Finally, these two factors are leveraged to define the proposed similarity measure for better recommendation accuracy. For evaluating the effectiveness of the proposed method, several experiments have been performed using standardized benchmark datasets (MovieLens-1M, 10M, and 20M). Results obtained demonstrate that the proposed method provides better predictive accuracy (in terms of MAE and RMSE) along with improved classification accuracy (in terms of precision-recall).