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.
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.
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.
Partial periodic-frequent pattern mining is a critical technique in the data mining field. This technique finds all frequent patterns demonstrating partial periodicity within temporal datasets. Despite its potential, the broader industrial adoption of this technique has been limited due to two significant challenges. First, there is currently no algorithm capable of efficiently identifying the required patterns in columnar temporal databases, which are increasingly prevalent in real-world applications. Second, the existing algorithms suffer from high computational demands regarding processing time (or runtime) and memory usage, rendering them unsuitable for analyzing large-scale datasets effectively. To address these challenges, this paper proposes the Generalized Partial Periodic-Frequent Depth-First Search (GPPF-DFS) algorithm. GPPF-DFS compresses row-based and columnar temporal databases into a unified dictionary structure, enabling efficient data traversal and recursive mining. The experimental results across various datasets demonstrate that our proposed algorithm significantly outperforms GPF-growth in terms of effectiveness and computational efficiency. Furthermore, a scalability test has been conducted to assess the performance of the proposed algorithm. Additionally, we demonstrate the practical applicability of GPPF-DFS through case studies on air pollution and retail analytics. The algorithm identifies periodic patterns in air pollution data, offering valuable insights for environmental monitoring. In retail analytics, it uncovers patterns that inform business strategies, and enhance customer experience.
About Me
Doing research in periodic pattern mining in temporal databases and uncertain temporal databases.
Doing research in periodic pattern mining in temporal databases and uncertain temporal databases.