K PRASANNA .

Dr. K PRASANNA .


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
6 October 2021 in Security and Communication Networks
Verified
Journal Article
Open access
PDF file
K.K PRASANNA .
K PRASANNA .
RKRamana Kadiyala
Ramana Kadiyala
GDGAURAV DHIMAN
GAURAV DHIMAN
Sandeep KautishSandeep Kautish
Sandeep Kautish
VCV. Deeban Chakravarthy
V. Deeban Chakravarthy
Internet of Things (IoT) is a phenomenon involving connecting things or objects with sensors. The IoT market is growing rapidly, and there are strong incentives for companies to follow the trend of IoT growth and development. However, the percentage of IoT measures that are considered successful seems low. The complexity of carrying out an IoT project lies in the need to adjust all the pieces of the puzzle: assets, sensors, communications, technology, coverage, and geographical locations with precision of the measures and regulations. All these requirements determine the economic viability of the business and its benefit. This study, therefore, examines how the project methodology can support the development of the concept and ensure the business value of IoT initiatives. The project methodology developed in this study is called PoC Design. A case study was evaluated, in which defects in street lighting were investigated and carried out. The evaluation of the methodology highlighted the importance of defining problems and solutions based on business value, calculating the potential of an IoT initiative, determining the continuation of the project, involving stakeholders at an early stage, and creating a PoC to validate the concept with stakeholders.

1 November 2014
Verified
Conference Paper
Closed access
K.K PRASANNA .
K PRASANNA .
DMDr. Seetha M.
Dr. Seetha M.
AKA. P. Siva Kumar
A. P. Siva Kumar
At present, due to the developments in Database Technology, large volumes of data are produced by everyday operations and they have introduced the necessity of representing the data in High Dimensional Datasets. Discovering Frequent Determinant Patterns and Association Rules from these High Dimensional Datasets has become very tedious since these databases contain large number of different attributes. For the reason that, it generates extremely large number of redundant rules which makes the algorithms inefficient and it does not fit in main memory. In this paper, a new Association Rule Mining approach is presented, and it efficiently discovers Frequent Determinant Patterns and Association Rules from High Dimensional Datasets. The proposed approach adopts the conventional Apriori algorithm and device anew CApriori algorithm to prune the generated Frequent Determinant Sets effectively. A Frequent Determinant set is selected if its value is first compared with Conviction threshold value and then compared with Support threshold. This double comparison will eliminate the redundancy and generate strong Association Rules. To improve the mining process, this algorithm also makes use of a compressed data structure f_list constructed from feature attributes selected using Heuristic Fitness Function (HFF) and a Heuristic Discretization algorithm. It also makes use of Count Array (CA) devised as One Dimensional Triple Array pair set to minimize main memory utilization. This comprehensive study shows that the approach outperforms with traditional Apriori and obtains more rapid computing speed and at the same time generates Sententious Rules. Further the mining methodology is ascertained to be better in generating strong Association Rules from High Dimensional Databases.

8 July 2023 in Applied Sciences
Verified
Journal Article
Open access
PDF file
K.K PRASANNA .
K PRASANNA .
Mudassir KhanMudassir Khan
Mudassir Khan
SASaeed M. Alshahrani
Saeed M. Alshahrani
AKAjmeera Kiran
Ajmeera Kiran
PRP Kumar Reddy
P Kumar Reddy
CJChinna Babu J
Chinna Babu J
Continuous data stream analysis primarily focuses on the unanticipated changes in the transmission of data distribution over time. Conceptual change is defined as the signal distribution changes over the transmission of continuous data streams. A drift detection scenario is set forth to develop methods and strategies for detecting, interpreting, and adapting to conceptual changes over data streams. Machine learning approaches can produce poor learning outcomes in the conceptual change environment if the sudden change is not addressed. Furthermore, due to developments in concept drift, learning methodologies have been significantly systematic in recent years. The research introduces a novel approach using the fully connected committee machine (FCM) and different activation functions to address conceptual changes in continuous data streams. It explores scenarios of continual learning and investigates the effects of over-learning and weight decay on concept drift. The findings demonstrate the effectiveness of the FCM framework and provide insights into improving machine learning approaches for continuous data stream analysis. We used a layered neural network framework to experiment with different scenarios of continual learning on continuous data streams in the presence of change in the data distribution using a fully connected committee machine (FCM). In this research, we conduct experiments in various scenarios using a layered neural network framework, specifically the fully connected committee machine (FCM), to address conceptual changes in continuous data streams for continual learning under a conceptual change in the data distribution. Sigmoidal and ReLU (Rectified Linear Unit) activation functions are considered for learning regression in layered neural networks. When the layered framework is trained from the input data stream, the regression scheme changes consciously in all scenarios. A fully connected committee machine (FCM) is trained to perform the tasks described in continual learning with M hidden units on dynamically generated inputs. In this method, we run Monte Carlo simulations with the same number of units on both sides, K and M, to define the advancement of intersections between several hidden units and the calculation of generalization error. This is applied to over-learnability as a method of over-forgetting, integrating weight decay, and examining its effects when a concept drift is presented.

1 January 2025 in Computers, Materials & Continua
Verified
Journal Article
Open access
PDF file
K.K PRASANNA .
K PRASANNA .
TTTan Kuan Tak
Tan Kuan Tak
PKPravin Ramdas Kshirsagar
Pravin Ramdas Kshirsagar
GGGopichand Ginnela
Gopichand Ginnela
VAVijaya Krishna Akula
Vijaya Krishna Akula
Heart failure prediction is crucial as cardiovascular diseases become the leading cause of death worldwide, exacerbated by the COVID-19 pandemic. Age, cholesterol, and blood pressure datasets are becoming inadequate because t... | Find, read and cite all the research you need on Tech Science Press

1 January 2015 in Procedia Computer Science
Verified
Journal Article
Open access
K.K PRASANNA .
K PRASANNA .
DMDr. Seetha M.
Dr. Seetha M.
In this paper, DPMine, a new approach for discovering large Colossal Pattern Sequences from Biological datasets is discussed. DPMine effectively discovers Doubleton Patterns which are further enriched into DPT+ tree to generate colossal pattern sequenceswith vector intersection operator. DPMine makes use of a new integrated data structure called ‘D-struct’, as combination of a doubleton data matrix and one dimensional array pair set to dynamically discover Doubleton Patterns from Biological datasets.DPT+ tree is constructed as Bitwise Top down Column enumeration tree. D-struct has a diverse feature to facilitate is, it hasextremely limited and accurately predictable main memory and runs very quickly in memory based constraints. The algorithm is designed in such a way that it takes only one scan over the database to discover large colossal pattern sequences. The empirical analysis on DPMine shows that, the proposed approach attains a better mining efficiency on various Biological datasets and outperforms Colossal Pattern Miner (CPM) and BVBUC in different settings. The performance of DPMine on Biological data set is also assessed with Accuracy and F-measure

1 July 2012
Verified
Conference Paper
Closed access
K.K PRASANNA .
K PRASANNA .
DMDr. Seetha M.
Dr. Seetha M.
Association rule mining aims at generating association rules between sets of items in a database. Now a day, due to huge accumulation in the database technology, the data are representing in the high dimensional data space. However, it is becoming very tedious to generate association rules from high dimensional data, because it contains different dimensions or attributes in the large data bases. In this paper, a method for generating association rules from large high dimensional data is proposed . It constitutes three steps, 1) pre-processing and generalizing the data base; 2) it generates large frequent k-dimension set using user supplied support value which is more feasible than the traditional approach; and 3) generating strong association rules using confidence. It can be seen from experiments that the mining algorithm is elegant and efficient, which can obtain more rapid computing speed and sententious rules at the same time It was ascertained that the proposed method is proved to be better in support of generating association rules.