Premalatha Mariappan

Dr. Premalatha Mariappan

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 January 2023 in Applied Sciences
Verified
Journal Article
Open access
PDF file
JPJ Priyadarshini
J Priyadarshini
PMPremalatha Mariappan
Premalatha Mariappan
Robert ČepRobert Čep
Robert Čep
J.Jayasudha .M
Jayasudha .M
KANAK KALITAKANAK KALITA
KANAK KALITA
In recent years, feature selection has emerged as a major challenge in machine learning. In this paper, considering the promising performance of metaheuristics on different types of applications, six physics-inspired metaphor algorithms are employed for this problem. To evaluate the capability of dimensionality reduction in these algorithms, six diverse-natured datasets are used. The performance is compared in terms of the average number of features selected (AFS), accuracy, fitness, convergence capabilities, and computational cost. It is found through experiments that the accuracy and fitness of the Equilibrium Optimizer (EO) are comparatively better than the others. Finally, the average rank from the perspective of average fitness, average accuracy, and AFS shows that EO outperforms all other algorithms.

25 October 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
PMPremalatha Mariappan
Premalatha Mariappan
VVViswanathan V
Viswanathan V
Lenka CepovaLenka Cepova
Lenka Cepova
The selection of elective courses based on an individual’s domain interest is a challenging and critical activity for students at the start of their curriculum. Effective and proper recommendation may result in building a strong expertise in the domain of interest, which in turn improves the outcomes of the students getting better placements, and enrolling into higher studies of their interest, etc. In this paper, an effective course recommendation system is proposed to help the students in facilitating proper course selection based on an individual’s domain interest. To achieve this, the core courses in the curriculum are mapped with the predefined domain suggested by the domain experts. These core course contents mapped with the domain are trained semantically using deep learning models to classify the elective courses into domains, and the same are recommended based on the student’s domain expertise. The recommendation is validated by analyzing the number of elective course credits completed and the grades scored by a student who utilized the elective course recommendation system, with the grades scored by the student who was subjected to the assessment without elective course recommendations. It was also observed that after the recommendation, the students have registered for a greater number of credits for elective courses on their domain of expertise, which in-turn enables them to have a better learning experience and improved course completion probability.

12 December 2023 in Heliyon
Verified
Journal Article
Open access
PMPremalatha Mariappan
Premalatha Mariappan
J.Jayasudha .M
Jayasudha .M
Robert ČepRobert Čep
Robert Čep
JPJ Priyadarshini
J Priyadarshini
KANAK KALITAKANAK KALITA
KANAK KALITA
PCPrasenjit Chatterjee
Prasenjit Chatterjee
Feature selection is a critical component of machine learning and data mining which addresses challenges like irrelevance, noise, redundancy in large-scale data etc., which often result in the curse of dimensionality. This study employs a K-nearest neighbour wrapper to implement feature selection using six nature-inspired algorithms, derived from human behaviour and mammal-inspired techniques. Evaluated on six real-world datasets, the study aims to compare the performance of these algorithms in terms of accuracy, feature count, fitness, convergence and computational cost. The findings underscore the efficacy of the Human Learning Optimization, Poor and Rich Optimization and Grey Wolf Optimizer algorithms across multiple performance metrics. For instance, for mean fitness, Human Learning Optimization outperforms the others, followed by Poor and Rich Optimization and Harmony Search. The study suggests the potential of human-inspired algorithms, particularly Poor and Rich Optimization, in robust feature selection without compromising classification accuracy.

1 January 2018 in International Journal of Web Portals
Verified
Journal Article
Closed access
PDF file
PMPremalatha Mariappan
Premalatha Mariappan
VVViswanathan V
Viswanathan V
GSG. Suganya
G. Suganya
MKM. Kaviya
M. Kaviya
AVAparna Vijaya
Aparna Vijaya
Data mining techniques are widely used for various educational researches. This article depicts the survey of various data mining techniques and tools which are used to guide students, course instructors, course developers, course administrators and organizations in respective fields based on future scope. This article also highlights how recommender systems rule the educational field though it's filtering mechanisms in recommending courses for students. It also illustrates future scope of data mining in educational needs.

1 November 2017
Verified
Conference Paper
Closed access
SDSiddharth Dhar
Siddharth Dhar
KPKaustubh Pandey
Kaustubh Pandey
PMPremalatha Mariappan
Premalatha Mariappan
GSG Suganya
G Suganya
This paper aims to reduce the time taken to search for data within a hash table by making use of a tree structure. The two most popular methods for collision avoidance within a hash table - Open Addressing and Separate Chaining each have their merits and demerits. Here we attempt to overcome the main demerits of each of these techniques which are - Filling up of the hash table in Open Addressing and Poor searching time in Separate Chaining. A different approach to the problem has been proposed here which prevents the filling up of the hash table by using a Binary Search Tree instead of a table to store the hash values and adds new nodes to this tree only when a new hash value is generated while entering data. Also, in place of using linked list to store the data within a hash bucket, we use another Binary Search Tree to reduce the search time within each hash bucket. Using this approach, we attempt to reduce both the amount of space and time that will be used as there would be no empty buckets for any hash values and we do not have to worry about filling up the hash table as we will be chaining the data under each bucket. We also try to take care of the main drawback of Separate Chaining i.e longer search time within a hash bucket, by using a Binary Search Tree instead of a linked list, thus reducing the worst case search time from O(n) to O(log n).

6 February 2023 in International Journal on Recent and Innovation Trends in Computing and Communication
Verified
Journal Article
Open access
PDF file
AGAnusooya Govindarajan
Anusooya Govindarajan
SKSathyarajasekaran K
Sathyarajasekaran K
BSBharathiraja Selvaraj
Bharathiraja Selvaraj
BMBraveen M
Braveen M
PMPremalatha Mariappan
Premalatha Mariappan
The International Energy Agency (IEA) revealed that the worldwide energy-related carbon dioxide (CO2) situation has hit a historic high of 33.1 Giga tonnes (Gt) of CO2. 85% of the rise in emissions was due to China, India, and the United States. The increase in emissions in India was 4.8%, or 105 Mega tonnes (Mt) of CO2, with the increase in emissions being evenly distributed across the transportation and industrial sectors, according to Beloglazov et al (2011). Environmental contamination brought on by carbon emissions is harmful to the environment. As a result, there is an urgent need for the IT sectors to develop effective and efficient technology to eliminate such carbon emissions. The primary focus is on lowering carbon emissions due to widespread awareness of the issue.