Iterative Algorithm for Finding Frequent Patterns in Transactional Databases

Details Iterative Algorithm for Finding Frequent Patterns in Transactional Databases Iterative Algorithm for Finding Frequent Patterns in Transactional Databases

2005-08-26

arxiv.org/abs/cs/0508120v1

Computer Science

Databases

13 pages, 8 tables and figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Iterative Algorithm for Finding Frequent Patterns in Transactional Databases does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Iterative Algorithm for Finding Frequent Patterns in Transactional Databases, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Iterative Algorithm for Finding Frequent Patterns in Transactional Databases will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-567990