On Finding Irredundant Association Rules in a Product of Partial Order

The task of searching association rules of a special type in partially ordered data is considered. To increase the counting speed in the analysis of nonbinary data, an improved version of the FP-Growth algorithm of search for maximum frequent elements in data and parallel calculations based on CUDA technology are used. The results of working the sequential and parallel algorithms are presented.