A. Jeyasekar
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
A. Jeyasekar has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Annie Uthra Rajan
Department of Computer Science and Engineering SRM University Tamil Nadu India
1 shared publication - Anthony J. Lattanze
Carnegie Mellon University
1 shared publication J. Ansulin Jerusha
SRM Valliammai Engineering College
1 shared publication- K. Akshay
Department of Computer Science and Engineering, Kattankulathur, Chennai - 603203, Tamil Nadu
1 shared publication - Karan
Department of Computer Science and Engineering, Kattankulathur, Chennai - 603203, Tamil Nadu
1 shared publication S. Antony Sheela
University College of Engineering
1 shared publication
Latest Publications
- Open Access
- 6 October 2016
- Published by Indian Society for Education and Environment in Indian Journal of Science and Technology
- Vol. 9 (37)
Collaborative Filtering using Euclidean Distance in Recommendation Engine
Objectives: Recommendation engine is a part of information filtering system that tries to predict the ‘preference’ or ‘rating’ of an item in the E-commerce. Recommendation engines have become extremely common in recent days to make an appropriate recommendation rapidly and effectively about any products on which the user is interested. Methods/ Statistical Analysis: One of popular information filtering systems in the recommendation engine is collaborative filtering where the predictions are made based on the usage patterns of the users who are similar to another user. The accuracy of a recommendation engine using collaborative filtering depends on the techniques used to measure the similarity between the user’s preferences. Therefore, in this paper we use two metrics to measure the similarity between the user’s preferences namely KL Divergences and Euclidean distance. The proposed algorithm works by first clustering the users using k means clustering by utilising the similarity metrics and then computing the global Markov matrix for that cluster. Next, the PageRank value for each user is computed and those values are combined with the global Markov matrix to find the recommendations. Findings: We consider the problem of collaborative filtering to recommend potential items of interest to a user already engaged in a session, using past session of the user and other users. Our algorithm leads to the personalized PageRank, where context is captured by the personalization vector. The results show that the collaborative filtering using Euclidean distance metrics for similarity measure performs well than the KL divergence. Application/ Improvements: The proposed recommendation engine can be used in a wide variety of applications such music, movies, books, news, research articles, social media, search queries, and products in general in order to provide a effective recommendation.
- 6 October 2016
- Published by Indian Society for Education and Environment in Indian Journal of Science and Technology
- Vol. 9 (37)
Open AccessCollaborative Filtering using Euclidean Distance in Recommendation Engine
Objectives: Recommendation engine is a part of information filtering system that tries to predict the ‘preference’ or ‘rating’ of an item in the E-commerce. Recommendation engines have become extremely common in recent days to make an appropriate recommendation rapidly and effectively about any products on which the user is interested. Methods/ Statistical Analysis: One of popular information filtering systems in the recommendation engine is collaborative filtering where the predictions are made based on the usage patterns of the users who are similar to another user. The accuracy of a recommendation engine using collaborative filtering depends on the techniques used to measure the similarity between the user’s preferences. Therefore, in this paper we use two metrics to measure the similarity between the user’s preferences namely KL Divergences and Euclidean distance. The proposed algorithm works by first clustering the users using k means clustering by utilising the similarity metrics and then computing the global Markov matrix for that cluster. Next, the PageRank value for each user is computed and those values are combined with the global Markov matrix to find the recommendations. Findings: We consider the problem of collaborative filtering to recommend potential items of interest to a user already engaged in a session, using past session of the user and other users. Our algorithm leads to the personalized PageRank, where context is captured by the personalization vector. The results show that the collaborative filtering using Euclidean distance metrics for similarity measure performs well than the KL divergence. Application/ Improvements: The proposed recommendation engine can be used in a wide variety of applications such music, movies, books, news, research articles, social media, search queries, and products in general in order to provide a effective recommendation.
- 12 March 2014
- Published by Zhejiang University Press in Journal of Zhejiang University SCIENCE C
- Vol. 15 (3) , 187-199
A probabilistic approach for predictive congestion control in wireless sensor networks
Any node in a wireless sensor network is a resource constrained device in terms of memory, bandwidth, and energy, which leads to a large number of packet drops, low throughput, and significant waste of energy due to retransmission. This paper presents a new approach for predicting congestion using a probabilistic method and controlling congestion using new rate control methods. The probabilistic approach used for prediction of the occurrence of congestion in a node is developed using data traffic and buffer occupancy. The rate control method uses a back-off selection scheme and also rate allocation schemes, namely rate regulation (RRG) and split protocol (SP), to improve throughput and reduce packet drop. A back-off interval selection scheme is introduced in combination with rate reduction (RR) and RRG. The back-off interval selection scheme considers channel state and collision-free transmission to prevent congestion. Simulations were conducted and the results were compared with those of decentralized predictive congestion control (DPCC) and adaptive duty-cycle based congestion control (ADCC). The results showed that the proposed method reduces congestion and improves performance.
- 12 March 2014
- Published by Zhejiang University Press in Journal of Zhejiang University SCIENCE C
- Vol. 15 (3) , 187-199
A probabilistic approach for predictive congestion control in wireless sensor networks
Any node in a wireless sensor network is a resource constrained device in terms of memory, bandwidth, and energy, which leads to a large number of packet drops, low throughput, and significant waste of energy due to retransmission. This paper presents a new approach for predicting congestion using a probabilistic method and controlling congestion using new rate control methods. The probabilistic approach used for prediction of the occurrence of congestion in a node is developed using data traffic and buffer occupancy. The rate control method uses a back-off selection scheme and also rate allocation schemes, namely rate regulation (RRG) and split protocol (SP), to improve throughput and reduce packet drop. A back-off interval selection scheme is introduced in combination with rate reduction (RR) and RRG. The back-off interval selection scheme considers channel state and collision-free transmission to prevent congestion. Simulations were conducted and the results were compared with those of decentralized predictive congestion control (DPCC) and adaptive duty-cycle based congestion control (ADCC). The results showed that the proposed method reduces congestion and improves performance.