Ramesh Ragala
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Ramesh Ragala has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- B. S. Rakshana
Vellore Institute of Technology
1 shared publication - G. Bharadwaja Kumar
Vellore Institute of Technology
1 shared publication Kunal Singh Naruka
VIT University
1 shared publication- Nisha Vellarayil Mohandas
VIT University
1 shared publication - R. Anahitaa
Vellore Institute of Technology
1 shared publication - Sajidha Syed Azimuddin
Vellore Institute of Technology, Chennai, India
1 shared publication
Latest Publications
- 3 June 2023
- Published by Springer Nature
- p. 1-15
Simulation, Perception, and Prediction of the Spread of COVID - 19 on Cellular Automata Models: A Survey
- 3 June 2023
- Published by Springer Nature
- p. 1-15
Simulation, Perception, and Prediction of the Spread of COVID - 19 on Cellular Automata Models: A Survey
- 9 September 2022
- Published by Springer Nature
- p. 329-346
Sanskriti—A Distributed E-Commerce Site Implementation Using BlockChain
- 9 September 2022
- Published by Springer Nature
- p. 329-346
Sanskriti—A Distributed E-Commerce Site Implementation Using BlockChain
- Open Access
Rank Based Pseudoinverse Computation in Extreme Learning Machine for Large Datasets
Extreme Learning Machine (ELM) is an efficient and effective least-square-based learning algorithm for classification, regression problems based on single hidden layer feed-forward neural network (SLFN). It has been shown in the literature that it has faster convergence and good generalization ability for moderate datasets. But, there is great deal of challenge involved in computing the pseudoinverse when there are large numbers of hidden nodes or for large number of instances to train complex pattern recognition problems. To address this problem, a few approaches such as EM-ELM, DF-ELM have been proposed in the literature. In this paper, a new rank-based matrix decomposition of the hidden layer matrix is introduced to have the optimal training time and reduce the computational complexity for a large number of hidden nodes in the hidden layer. The results show that it has constant training time which is closer towards the minimal training time and very far from worst-case training time of the DF-ELM algorithm that has been shown efficient in the recent literature.
Open AccessRank Based Pseudoinverse Computation in Extreme Learning Machine for Large Datasets
Extreme Learning Machine (ELM) is an efficient and effective least-square-based learning algorithm for classification, regression problems based on single hidden layer feed-forward neural network (SLFN). It has been shown in the literature that it has faster convergence and good generalization ability for moderate datasets. But, there is great deal of challenge involved in computing the pseudoinverse when there are large numbers of hidden nodes or for large number of instances to train complex pattern recognition problems. To address this problem, a few approaches such as EM-ELM, DF-ELM have been proposed in the literature. In this paper, a new rank-based matrix decomposition of the hidden layer matrix is introduced to have the optimal training time and reduce the computational complexity for a large number of hidden nodes in the hidden layer. The results show that it has constant training time which is closer towards the minimal training time and very far from worst-case training time of the DF-ELM algorithm that has been shown efficient in the recent literature.