Rajasekhar Nuvvusetty

Dr. Rajasekhar Nuvvusetty

orcid

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
1 May 2017
Verified
Conference Paper
Closed access
ACAravind Cheruvu
Aravind Cheruvu
VRV. Radhakrishna
V. Radhakrishna
Rajasekhar NuvvusettyRajasekhar Nuvvusetty
Rajasekhar Nuvvusetty
Euclidean distance measure is widely adopted distance measure to find the distance between any two vectors. In this paper, we extend the use of Euclidean distance to the context of normal distribution based temporal pattern mining. The similarity between any two patterns is computed by using the probability vectors of corresponding temporal patterns. These temporal patterns in our case are expressed as probability vector sequences. The probabilities are found from computed normal scores of patterns considering a given reference and using probability chart. The work in this paper is restricted to introducing the approach of mining patterns using the proposed dissimilarity measure.


21 February 2020 in IEEE Access
Verified
Journal Article
Open access
ANArun Nagaraja
Arun Nagaraja
UBUma Boregowda
Uma Boregowda
KKKhalaf Khatatneh
Khalaf Khatatneh
Radha KrishnaRadha Krishna
Radha Krishna
Rajasekhar NuvvusettyRajasekhar Nuvvusetty
Rajasekhar Nuvvusetty
VKV. Sravan Kiran
V. Sravan Kiran
The fundamental objective behind any network intrusion detection system is to automate the detection process whenever intrusions occur in the network. The problem of the network anomaly detection is to determine, if the network incoming traffic is legitimate (or) anomalous. Automated detection systems designed to identify incoming anomalous traffic patterns usually apply widely used machine learning techniques. However, irrespective of any system model which is developed to identify anomalous traffic, all these models requires comparing anomalous and normal traffic patterns. Such comparisons implicitly depend on the ability of the underlying machine learning model to gauge the similarity between a known legitimate observation and the target. The efficiency of any network anomalous detection system depends on the use of distance (or) similarity measures and how they are actually applied. A novel distance function which can be applied to determine the similarity between two conditional feature pattern vectors is an important contribution of present research. Feature dimensionality is another important issue for any machine learning algorithm. In the present work, feature reduction is achieved using the proposed feature transformation technique. However, our approach for feature transformation uses the proposed gaussian distance function to achieve dimensionality reduction to represent the original input dataset in the new transformation space. We have also proposed new computation expressions for determining equivalent deviation and threshold in gaussian space. Experiments are performed on KDD and NSL-KDD datasets by considering widely applied classifier algorithms in various state-of-art research contributions. For performance validation of machine learning models, k-fold cross validation is applied by setting k to 10 through considering evaluation parameters such as accuracy, precision and recall. Experiment results have proved that our approach for anomaly detection that applies the proposed feature transformation technique proved comparatively better to detection methods CANN, GARUDA, and UTTAMA addressed in the recent research literature.

1 January 2022 in Intelligent Automation and Soft Computing
Verified
Journal Article
Open access
DRD. Srinivasa Rao
D. Srinivasa Rao
RCRamesh Babu Ch
Ramesh Babu Ch
VKV. Sravan Kiran
V. Sravan Kiran
Rajasekhar NuvvusettyRajasekhar Nuvvusetty
Rajasekhar Nuvvusetty
KSKalyanapu Srinivas
Kalyanapu Srinivas
BBB. Lalith Bharadwaj
B. Lalith Bharadwaj
Plant diseases have become a major threat in farming and provision of food. Various plant diseases have affected the natural growth of the plants and the infected plants are the leading factors for loss of crop production. The manual detection and identification of the plant diseases require a careful and observative examination through expertise. To overcome manual testing procedures an automated identification and detection can be implied which provides faster, scalable and precisive solutions. In this research, the contributions of our work are threefold. Firstly, a bi-linear convolution neural network (Bi-CNNs) for plant leaf disease identification and classification is proposed. Secondly, we fine-tune VGG and pruned ResNets and utilize them as feature extractors and connect them to fully connected dense networks. The hyperparameters are tuned to reach faster convergence and obtain better generalization during stochastic optimization of Bi-CNN(s). Finally, the proposed model is designed to leverage scalability by implying the Bi-CNN model into a real-world application and release it as an open-source. The model is designed on variant testing criteria ranging from 10% to 50%. These models are evaluated on gold-standard classification measures. To study the performance, testing samples were expanded by 5x (i.e., from 10% to 50%) and it is found that the deviation in the accuracy was quite low (0.27%) which resembles the consistent generalization ability. Finally, the larger model obtained an accuracy score of 94.98% for 38 distinct classes.


17 November 2016
Verified
Conference Paper
Closed access
PSPanigrahi Srikanth
Panigrahi Srikanth
Rajasekhar NuvvusettyRajasekhar Nuvvusetty
Rajasekhar Nuvvusetty
In the present period of time, the bioinformatics involves in the collection of the discovery of files, which are similar to binary files and records based on function of codes. Researchers, medical experts, and doctors have construed a tool by using medical and biological files together in sequential order. Bioinformatics is a collection of many-to-many relational data repositories, which develops to examine the functions of different code patterns. Clustering and classification of gene-protein miRNA interaction to except the file based on built matrix and sequential matrix. The main perspective of this paper is to initiate clustering of documents for the set of different files consisting of text files of geneprotein target interaction is related to the files based on applying on new existing similar measure. The function scope is which something exists based on finding similarity among two files or any documents like gene miRNA interaction data files. Typically to build a matrix as n × n files or documents. A similarity function and designing of clustering algorithm is discussed in this paper. These processes carried out with feature sets and clusters to identify gene-miRNA predicted data and gene-miRNA interaction data.