GrantMarshall / FrequentItemsets / 0.1.2
Simple implementation of the Apriori algorithm for frequent itemset computation. 

Note that the Apriori algorithm is a far cry from a fast algorithm and will run into the timeout cap of 5 minutes fairly quickly. Has been tested with up to ~1400 docs of length 6 on average with threshold of 12. Increasing threshold improves run time. Decreasing the number of documents or pruning the documents can also improve run time.