2005/08/26 by G. P. Berman, Gennady P. Berman, V. N. Gorshkov +7
Computer Science · Psychology · #Algorithm #Computer science #Data Management and Algorithms #Data Mining Algorithms and Applications #Database #Databases (cs.DB) #FOS: Computer and information sciences #Psychology #Rough Sets and Fuzzy Logic #Transactional leadership #cs.DB
paper · pdf · doi:10.48550/arxiv.cs/0508120
13 pages, 8 tables and figures
arxiv created 2005/08/26 · openalex publication_date 2005/08/26 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
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.