Iterative Algorithm for Finding Frequent Patterns in Transactional Databases
Gennady P. Berman, Vyacheslav N. Gorshkov, Edward P. MacKerrow, Xidi Wang
Abstract
A high-performance algorithm for searching for frequent patterns (FPs) in transactional databases is presented. The search for FPs is carried out by using an iterative sieve algorithm by computing the set of enclosed cycles. In each inner cycle of level FPs composed of elements are generated. The assigned number of enclosed cycles (the parameter of the problem) defines the maximum length of the desired FPs. The efficiency of the algorithm is produced by (i) the extremely simple logical searching scheme, (ii) the avoidance of recursive procedures, and (iii) the usage of only one-dimensional arrays of integers.
Create a lesson
Related papers
Resolution limits for process comparison from event data
Antony R. Lee, Peter Tiňo, Iain B. Styles
A Functional Pilot for Certified Freshness-Aware Semantic--Spatial Range Retrieval
Taimoor Ahmad
Efficiently Linking Unstructured Data for Multi-step Reasoning
Jiaming Liang, Haydn Jones, Jacob R. Gardner et al.
Distribution-Aware Distributed Database Testing (Extended Version)
Zhou Zhou, Si Liu, Hengfeng Wei et al.
Linking Speakers of the German Parliament to Wikidata: Scope and Coverage of Metadata
Thomas Haider, Arne Cypionka, Maximilian Teich
How Can We Shrink the Family of Test Databases? Query Containment with Nulls and Comparisons
Helen Sternbach, Sara Cohen