Premalatha Kandasamy

Dr. Premalatha Kandasamy

orcid

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
8 April 2014 in Applied Artificial Intelligence
Verified
Journal Article
Closed access
KSKannimuthu Subramanian
Kannimuthu Subramanian
PKPremalatha Kandasamy
Premalatha Kandasamy

17 June 2019 in Journal of Education
Verified
Journal Article
Closed access
PDF file
PKPremalatha Kandasamy
Premalatha Kandasamy
In Outcome-Based Education (OBE), the assessment of the Course Outcomes (COs) is the most prominent aspect required to improve the quality of education. The COs for each course are based on the Program Outcomes (POs), Program Specific Outcomes (PSOs), and other requirements. There are various understandings toward the concept of OBE that resulted in various attainment to PO based on the CO. This article describes the framework of OBE and detailed survey on CO-PO mapping and its attainment models. This article serves as guidelines of writing COs, and mapping CO and PO and its attainment.

18 April 2015 in Applied Artificial Intelligence
Verified
Journal Article
Closed access
RBR. Balamurugan
R. Balamurugan
ANA. M. Natarajan
A. M. Natarajan
PKPremalatha Kandasamy
Premalatha Kandasamy
DNA microarray gene expression data analysis has provided new insights into gene function, disease pathophysiology, disease classification, and drug development. Biclustering in gene expression data is a subset of the genes demonstrating consistent patterns over a subset of the conditions. The proposed work finds the significant biclusters in large expression data using a novel optimization technique called stellar-mass black hole optimization (SBO). This optimization algorithm is inspired from the property of the relentless pull of a black hole’s gravity that is present in the Universe. The proposed work is tested on benchmark optimization test functions and gene expression benchmark datasets, and the results are compared with swarm intelligence techniques such as particle swarm optimization (PSO), and cuckoo search (CK). The experimental results show that the SBO outperforms PSO and CK.

1 January 2015 in International Journal of Data Mining and Bioinformatics
Verified
Journal Article
Closed access
CGC. Gunavathi
C. Gunavathi
PKPremalatha Kandasamy
Premalatha Kandasamy
Cuckoo Search (CS) optimisation algorithm is used for feature selection in cancer classification using microarray gene expression data. Since the gene expression data has thousands of genes and a small number of samples, feature selection methods can be used for the selection of informative genes to improve the classification accuracy. Initially, the genes are ranked based on T-statistics, Signal-to-Noise Ratio (SNR) and F-statistics values. The CS is used to find the informative genes from the top-m ranked genes. The classification accuracy of k-Nearest Neighbour (kNN) technique is used as the fitness function for CS. The proposed method is experimented and analysed with ten different cancer gene expression datasets. The results show that the CS gives 100% average accuracy for DLBCL Harvard, Lung Michigan, Ovarian Cancer, AML-ALL and Lung Harvard2 datasets and it outperforms the existing techniques in DLBCL outcome and prostate datasets.

15 August 2021 in IETE Journal of Research
Verified
Journal Article
Closed access
RRRamya Ramaswamy
Ramya Ramaswamy
PKPremalatha Kandasamy
Premalatha Kandasamy
SPSwathypriyadharsini Palaniswamy
Swathypriyadharsini Palaniswamy
Alzheimer’s Disease (AD) is a neurological disorder that destroys memory and other significant mental functions. One of the most accurate methods to identify the disease-causing genes is to monitor gene expression values in various samples. Selecting significant genes for classification is important in gene expression studies. In this study, the experimental data are taken from the gene expression data of human brain in persons with AD and older control subjects GEO GSE5281 data set. In this work, a new two-step gene selection is applied to filter the noisy and redundant genes, based on the statistical method and heuristic optimization approach. T-statistic (T-test), Signal to Noise Ratio (SNR) and F-test, are used in the first step of the gene selection process. The top ten significant genes selected from the statistical methods are applied to Particle Swarm Optimization (PSO) to obtain the optimal number of features of Alzheimer’s disease. To avoid the stagnation issue in PSO, a modified PSO approach is proposed which finds a new particle position by utilizing the Genetic Algorithm (GA) crossover and mutation operators. The classifiers, Decision tree, Support Vector Machine (SVM), Linear Model, Random Forest and Neural network, are employed in training and testing data to analyse the performance of GA & PSOs. Modified PSO with t-Test in Random forest and Linear model provides 100% accuracy for the test dataset of GSE5281 with optimum number of genes. The significant genes identified through this research are EGR1, CKMT1B, RPL15, PSMB3, GRK4, COX6A1 and PHIP from the GSE5281 dataset.

14 October 2008 in Computer and Information Science
Verified
Journal Article
Open access
PDF file
PKPremalatha Kandasamy
Premalatha Kandasamy
ANA.M. Natarajan
A.M. Natarajan
Data clustering is a popular approach for automatically finding classes, concepts, or groups of patterns. The term “clustering” is used in several research communities to describe methods for grouping of unlabeled data. These communities have different terminologies and assumptions for the components of the clustering process and the context in which clustering is used. This paper looks into the use of Particle Swarm Optimization (PSO) for cluster analysis. In standard PSO the non-oscillatory route can quickly cause a particle to stagnate and also it may prematurely converge on suboptimal solutions that are not even guaranteed to local optimal solution. In this paper a modification strategy is proposed for the particle swarm optimization (PSO) algorithm and applied in the data sets. This paper provides a method for particles to steer clear off from local stagnation and the local search is applied to improve the goodness of fitting. The effectiveness of this concept is demonstrated by cluster analysis. Results show that the model provides enhanced performance and maintains more diversity in the swarm and thereby allows the particles to be robust to trace the changing environment.