cSPADE: mining frequent sequence patterns with constraints (extension of SPADE)

Algorithms for Mining Frequent Trees (in Tree Structured Datasets)

SLEUTH Algorithm for mining frequent embedded/induced unordered/ordered trees

Data Mining Template Library

CHARM algorithm for closed itemset mining

SPADE frequent sequence mining algorithm

Apriori & FPGrowth implementation by C++

Works in my Master thesis in 2010 related the Frequent Sequence Mining topic. I implemented the PRISM algorithm and extended the PRISM into the distributed database scheme. The PRISM algorithm proposed in K. Gouda, M. Hassaan and M. J. Zaki, "Prism: A Primal-Encoding Approach for Frequent Sequence Mining," Seventh IEEE International Conference o…

Frequent Pattern Mining Using FP-Growth

Original ECLAT algorithm for frequent itemset mining

C++ implementation of FPtree, a part of FPGrowth algorithm (Frequent Pattern Mining)

Mining Interesting Patterns from Uncertain Databases

The minDNF method samples minimal boolean expressions in DNF.

CHARM-L algorithm to generate the closed itemset lattice and non-redundant rules

In this Repo have Sorting Algorithms Bubble sort, Insertion Sort, Selection Sort, MergeSort, Quick Sort, Heap Sort etc