• CMAR

  • Referenced in 53 articles [sw28406]
  • efficient frequent pattern mining method, FP-growth, constructs a class distribution-associated FP-tree...
  • Apriori

  • Referenced in 23 articles [sw40322]
  • depth-first algorithms like Eclat or FP-growth. This program is currently useful only, because...
  • APRIORI

  • Referenced in 4 articles [sw02940]
  • Complexity analysis of depth first and FP-growth implementations of APRIORI. We examine the complexity ... Depth First and FP-growth implementations of APRIORI, two of the fastest known data mining...
  • FP-growth

  • Referenced in 3 articles [sw33196]
  • FP-growth is a program to find frequent item sets (also closed and maximal ... well as generators) with the FP-growth algorithm (Frequent Pattern growth...
  • RP-Tree

  • Referenced in 3 articles [sw18882]
  • time efficient than modified versions of FP-Growth and ARIMA, and discovers...
  • RElim

  • Referenced in 2 articles [sw40296]
  • elimination), which is inspired by the FP-growth algorithm, but does its work without prefix...
  • TBAR

  • Referenced in 7 articles [sw02237]
  • TBAR: An efficient method for association rule mining...
  • UCI-ml

  • Referenced in 3403 articles [sw04074]
  • UC Irvine Machine Learning Repository. We currently maintain...
  • MulVAL

  • Referenced in 8 articles [sw17743]
  • MulVAL: A Logic-based Network Security Analyzer. To...