Penugonda Ravikumar

Mr. Penugonda Ravikumar

The University of AIZU, Aizuwakmatsu, Japan
+1
orcid

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
1 July 2020
Verified
Conference Paper
Closed access
RKR. Uday Kiran
R. Uday Kiran
CSC. Saideep
C. Saideep
Penugonda RavikumarPenugonda Ravikumar
Penugonda Ravikumar
KZKoji Zettsu
Koji Zettsu
MTMasashi Toyoda
Masashi Toyoda
PRP. Krishna Reddy
P. Krishna Reddy
Periodic-frequent pattern mining is a challenging problem of great importance in many applications. Most previous works focused on finding these patterns in binary temporal databases and did not take into account the quantities of items within the data. This paper proposes a novel model of fuzzy periodic-frequent pattern (FPFP) that may exist in a quantitative temporal database (QTD). Finding FPFPs in QTD is a non-trivial and challenging task due to its huge search space. A novel pruning technique, called improved maximum scalar cardinality, has been introduced to effectively reduce the search space and the computational cost of finding the desired itemsets. This technique facilitates the mining of FPFPs in real-world very large databases practicable. An efficient algorithm has also been presented to find all FPFPs in a QTD. Experimental results demonstrate that the proposed algorithm is efficient. We also present a case study in which we apply our model to find useful information in air pollution database.

19 June 2021 in Electronics
Verified
Journal Article
Open access
PDF file
Penugonda RavikumarPenugonda Ravikumar
Penugonda Ravikumar
PLPalla Likhitha
Palla Likhitha
BRBathala Venus Vikranth Raj
Bathala Venus Vikranth Raj
Uday Kiran RAGEUday Kiran RAGE
Uday Kiran RAGE
Yutaka WatanobeYutaka Watanobe
Yutaka Watanobe
KZKoji Zettsu
Koji Zettsu
Discovering periodic-frequent patterns in temporal databases is a challenging problem of great importance in many real-world applications. Though several algorithms were described in the literature to tackle the problem of periodic-frequent pattern mining, most of these algorithms use the traditional horizontal (or row) database layout, that is, either they need to scan the database several times or do not allow asynchronous computation of periodic-frequent patterns. As a result, this kind of database layout makes the algorithms for discovering periodic-frequent patterns both time and memory inefficient. One cannot ignore the importance of mining the data stored in a vertical (or columnar) database layout. It is because real-world big data is widely stored in columnar database layout. With this motivation, this paper proposes an efficient algorithm, Periodic Frequent-Equivalence CLass Transformation (PF-ECLAT), to find periodic-frequent patterns in a columnar temporal database. Experimental results on sparse and dense real-world and synthetic databases demonstrate that PF-ECLAT is memory and runtime efficient and highly scalable. Finally, we demonstrate the usefulness of PF-ECLAT with two case studies. In the first case study, we have employed our algorithm to identify the geographical areas in which people were periodically exposed to harmful levels of air pollution in Japan. In the second case study, we have utilized our algorithm to discover the set of road segments in which congestion was regularly observed in a transportation network.

16 December 2023 in Applied Intelligence
Verified
Journal Article
Closed access
PDF file
VPVeena Pamalla
Veena Pamalla
Uday Kiran RAGEUday Kiran RAGE
Uday Kiran RAGE
Penugonda RavikumarPenugonda Ravikumar
Penugonda Ravikumar
PLPalla Likhitha
Palla Likhitha
Yutaka WatanobeYutaka Watanobe
Yutaka Watanobe
VBVenus Vikranth Raj Bathala
Venus Vikranth Raj Bathala

10 May 2022 in Electronics
Verified
Journal Article
Open access
PDF file
Uday Kiran RAGEUday Kiran RAGE
Uday Kiran RAGE
PVPamalla Veena
Pamalla Veena
Penugonda RavikumarPenugonda Ravikumar
Penugonda Ravikumar
CSChennupati Saideep
Chennupati Saideep
KZKoji Zettsu
Koji Zettsu
PRP. Krishna Reddy
P. Krishna Reddy
Periodic pattern mining is an emerging technique for knowledge discovery. Most previous approaches have aimed to find only those patterns that exhibit full (or perfect) periodic behavior in databases. Consequently, the existing approaches miss interesting patterns that exhibit partial periodic behavior in a database. With this motivation, this paper proposes a novel model for finding partial periodic patterns that may exist in temporal databases. An efficient pattern-growth algorithm, called Partial Periodic Pattern-growth (3P-growth), is also presented, which can effectively find all desired patterns within a database. Substantial experiments on both real-world and synthetic databases showed that our algorithm is not only efficient in terms of memory and runtime, but is also highly scalable. Finally, the effectiveness of our patterns is demonstrated using two case studies. In the first case study, our model was employed to identify the highly polluted areas in Japan. In the second case study, our model was employed to identify the road segments on which people regularly face traffic congestion.

1 February 2023 in IEEE Access
Verified
Journal Article
Open access
HDHong N. Dao
Hong N. Dao
Penugonda RavikumarPenugonda Ravikumar
Penugonda Ravikumar
PLPalla Likhitha
Palla Likhitha
Uday Kiran RAGEUday Kiran RAGE
Uday Kiran RAGE
Yutaka WatanobeYutaka Watanobe
Yutaka Watanobe
Incheon PaikIncheon Paik
Incheon Paik
Stable periodic-frequent itemset mining is essential in big data analytics with many real-world applications. It involves extracting all itemsets exhibiting stable periodic behaviors in a temporal database. Most previous studies focused on finding these itemsets in row (temporal) databases and disregarded the occurrences of these itemsets in columnar databases. Furthermore, the naïve approach of transforming a columnar database into a row database and then applying the existing algorithms to find interesting itemsets is not practicable due to computational reasons. With this motivation, this paper proposes a framework to discover stable periodic-frequent itemsets in columnar databases. Our framework employs a novel depth-first search algorithm that compresses a given columnar database into a unified dictionary and mines it recursively to find all stable periodic-frequent itemsets. The dictionary holds the information pertaining to itemsets and their temporal occurrences in a database. Experimental results on six databases demonstrate that the proposed algorithm is computationally efficient and scalable.

19 October 2023 in IEEE Access
Verified
Journal Article
Open access
PLPalla Likhitha
Palla Likhitha
Penugonda RavikumarPenugonda Ravikumar
Penugonda Ravikumar
DSDeepika Saxena
Deepika Saxena
Uday Kiran RAGEUday Kiran RAGE
Uday Kiran RAGE
Yutaka WatanobeYutaka Watanobe
Yutaka Watanobe
Finding periodic-frequent patterns in temporal databases is a prominent data mining problem with bountiful applications. It involves discovering all patterns in a database that satisfy the user-specified minimum support ( min_sup ) and maximum periodicity ( max_per ) constraints. Min_sup controls the least number of transactions in which a pattern must appear in a database. Max_per controls the maximum time interval within which a pattern must reappear in the database. The popular adoption of this task has been hindered by an open problem, which involves setting appropriate min_sup and max_per values for any given database. This paper addresses this open problem by proposing a solution to discover top- k periodic-frequent patterns in a temporal database. Top- k periodic-frequent patterns represent k periodic-frequent patterns with the lowest periodicity value in a database. An efficient depth-first search algorithm, Top- k Periodic-Frequent Pattern Miner ( k -PFPMiner), which takes only k threshold as an input, was presented to find all desired patterns in a database. Experimental results on synthetic and real-world databases demonstrate that our algorithm is memory and runtime-efficient and also highly scalable.