Ravi Kumar Saidala

Ravi Kumar Saidala

Auto-generated profile, based on publicly available information

Ravi Kumar Saidala

Department of CSE-Data Science, CMR University, India

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

1 April 2017
Verified
Conference Paper
Closed access
RSRavi Kumar Saidala
Ravi Kumar Saidala
NDNaga Raju Devarakonda
Naga Raju Devarakonda
Spam E-mailis a kind of electronic spam in which unsolicited messages are sent by E-mail. It is the most severe problem world-wide for decades. One of the best approach to identify spam E-mails is filtering E-mails by classification.In many applications feature selection is the most widely used and essential task in many classification techniques to reduce the dimensionality of feature space. In this paper a Nature Inspired Meta-Heuristic Algorithm, that exploits the SVM principles for finding optimized structures of the Enron-Spam dataset having high similarity, is proposed. We adopted the WOA to obtain an optimal feature subset for E-mail classification.Four different kernel functions are exploited, that includes Linear, Quadratic, Polynomial and RBF in classification to test the best kernel function for SVM. Different evaluation measurements such as Precision, Accuracy, Recall and F-measure are calculated to find the performance of the proposed technique.The investigated results are analysed and compared with those from other techniques published in spam E-mails filtering. All the analysed and compared results show that proposed technique is very competitive for E-mail classification.

8 August 2018 in International Journal of Intelligent Systems and Applications
Verified
Journal Article
Open access
PDF file
RSRavi Kumar Saidala
Ravi Kumar Saidala
NDNagaraju Devarakonda
Nagaraju Devarakonda
Computational Intelligence (CI) is an as of emerging area in addressing complex real world problems. The WOA has taken its root from the collective intelligent foraging behavior of humpback whales (Megaptera Novaeangliae). The standard WOA is suffers from the selection of best agent while whales searching and encircling prey. This research paper deals with the multi-swarm cooperative strategies for finding the best agents which balances the two phase's exploration and exploitation. The performance of invoked Multi-Swarm cooperative strategies into standard WOA i.e, MsWOA is first benchmarked on a set of 23 standard mathematical benchmark function problems which includes 7 Uni-Modal, 6 Multi-modal and 10 fixed dimension multimodal functions. The obtained graphical and statistical results have been portrayed along with the previously established techniques. The obtained results depicts that the proposed cooperative strategies for WOA outperforms in solving optimization problems of standard benchmark functions. This paper also studies the numerical efficiency of proposed techniques on the problem of data clustering where 10 real data clustering problems have been taken from data repository https://archive.ics.uci.edu.data. Statistical results for the obtained cluster centroids, intra-cluster distances and inter-cluster distances confirms that the cooperative strategies for best whale agent selection improves the performance WOA for function optimization problems as well as data clustering problems.

1 January 2018 in International Journal of Software Science and Computational Intelligence
Verified
Journal Article
Closed access
PDF file
RSRavi Kumar Saidala
Ravi Kumar Saidala
NDNagaraju Devarakonda
Nagaraju Devarakonda
This article describes how clustering is an attractive and major task in data mining in which particular set of objects are grouped according to their similarities based on some criteria. Among the numerous algorithms, k-Means is the best and efficient in address clustering problems. Any expert system is said to be good, only if it returns the optimal data clusters. The challenge of optimal clustering lies in finding the optimal number of clusters and identifying all the data groups correctly which is a NP-hard problem. Recently a new optimization algorithm TOA was developed to address these problems. However, the standard TOA is too often trapped at the local optima and premature convergence. To overcome this, this article proposes CTOA. The main objective of embedding chaotic maps into standard TOA is to compute and automatically adapt the internal parameters. The proposed CTOA is first benchmarked on standard mathematical functions and later applied to 10 data clustering problems. The obtained graphical and statistical results along with comparisons illustrate the capabilities of CTOA regarding accuracy and robustness

1 April 2017
Verified
Conference Paper
Closed access
RSRavi Kumar Saidala
Ravi Kumar Saidala
NDNaga Raju Devarakonda
Naga Raju Devarakonda
An evidential comprehension and the substantial insights to analyze the clinical data has the maximum level of significance in the clinical decision-making (CDM) process. Many DM researchers have proven clustering methods are efficient, in looking up worthwhile critical information by describing important data classes. Finding optimized structuresof real-complex data is a challenging task. Parallel metaheuristic algorithms are getting more popularin solving high-dimensional and complex problems because of their upgraded performance. In this work a new parallel metaheuristic optimization algorithm is proposed by hybridizing WOA with Clonal selection algorithm (CSA). Comparable investigations are conducted on 23 standard mathematical benchmark function. Simulation results confirm, with statistical significance, that the proposed scenario is more efficient in finding optimized solutions for complex functions. In addition to this, we exploit the proposed technique to a clinical dataset of heart patient, which is taken from https://archive.ics.uci.edu to secure the optimized structures for predicting heart disease. Four evaluationmetrics Accuracy, Precision, Recall, and Fmeasureare used to compare with those from other methods published in heart disease prediction. The experimental results show that the proposed technique is very competitive for predicting heart disease.

1 July 2017
Verified
Conference Paper
Closed access
RSRavi Kumar Saidala
Ravi Kumar Saidala
NDNagaraju Devarakonda
Nagaraju Devarakonda
The Tornadogenesis Optimization Algorithm (TOA), a new air mass population based meta-heuristic optimization (MHO) algorithm is devised in this paper. Implementation of TOA has taken its root from the formation of tornadoes, particularly at Oklahoma State of United States. The inspiration and the mathematical formulation along with a flowchart, the proposed algorithm was explained in this paper. The comparable and evidential investigations have been conducted on 23 standard mathematical benchmark functions. To test the numerical efficiency and clustering quality of TOA, clustering experiments also have been conducted on 10 real data clustering problems. The obtained results are compared with the other state-of-the-art algorithms, recently developed optimization technique WOA and its variants IWOA and NPMOA. Simulation results with the statistical significance confirm that the TOA outperform in complex function optimization problems.