Towards a Verified Parallel Implementation of Frequent Itemset Mining

Information technologies have allowed for the rapid growth of both data acquisition and data storage. With this growth comes the challenge of extracting useful information. One piece of information that is interesting to academics and industry is the relationships between items in a large data set. One approach is to find the relationships between items by calculating how frequently the items appear together in a subset. This is known as the frequent itemset mining problem. The problem goes as follows, given a database with sets of items, find the items that occur frequently together in a subset.