P
P. V. G. D. Prasad Reddy
Researcher at Andhra University
Publications - 75
Citations - 452
P. V. G. D. Prasad Reddy is an academic researcher from Andhra University. The author has contributed to research in topics: Scheduling (computing) & Cluster analysis. The author has an hindex of 9, co-authored 69 publications receiving 377 citations.
Papers
More filters
Journal ArticleDOI
Impact of Security Attacks on a New Security Protocol for Mobile Ad Hoc Networks
TL;DR: Simulation results have shown that the proposed security protocol resists against malicious nodes with low implementation complexity, and is suitable for mobile ad hoc networks.
Book ChapterDOI
Cluster Analysis on Different Data Sets Using K-Modes and K-Prototype Algorithms
R. Madhuri,M. Ramakrishna Murty,J. V. R. Murthy,P. V. G. D. Prasad Reddy,Suresh Chandra Satapathy +4 more
TL;DR: Algorithms which extend the k-means algorithm to categorical domains by using Modified k-modes algorithm and domains with mixed categorical and numerical values by using k-prototypes algorithm are implemented.
Journal ArticleDOI
Particle swarm optimized multiple regression linear model for data classification
Suresh Chandra Satapathy,J. V. R. Murthy,P. V. G. D. Prasad Reddy,Bijan Bihari Misra,P.K. Dash,Ganapati Panda +5 more
TL;DR: Comparison results on the illustrative examples show that the PSO based approach is superior to traditional least square approach in classifying multi-class data sets.
Journal ArticleDOI
Batch incremental processing for FP-tree construction using FP-Growth algorithm
TL;DR: A batch incremental processing algorithm BIT_FPGrowth is proposed that restructures and merges two small consecutive duration FP-trees to obtain a FP-tree of the FP-Growth algorithm, which uses FP- tree as preprocessed data repository to get transactions, unlike other sequential incremental algorithms that read transactions from database.
Hybridized Improved Genetic Algorithm with Variable Length Chromosome for Image Clustering
TL;DR: A Variable Length IGA is proposed which optimally finds the clusters of benchmark image datasets and the performance is compared with K-means and GCUK[12].