Journal of Universal Computer Science
In the past, many algorithms have been proposed for mining association rules from binary databases. Transactions with the quantitative values are, however, also commonly seen in real-world applications. Each transaction in a quantitative database consists of items with their purchased quantities. The Multiple Fuzzy Frequent Pattern tree (MFFP-tree) algorithm was thus designed to handle a quantitative database for efficiently mining complete fuzzy frequent itemsets. It however, only processes a database for mining the desired rules.