Skip to content

README.md

Latest commit

 

History

History
59 lines (32 loc) · 1012 Bytes

README.md

File metadata and controls

59 lines (32 loc) · 1012 Bytes

FPGrowth

Haskell implementation of FP-Growth1 algorithm

Getting Started

These instructions will get you a copy of the project up and running on your local machine for development and testing purposes.

Prerequisites

  • Cabal:
$ sudo apt install haskell-platform

Building

  • In the root folder, type
$ cabal configure

$ cabal build

Running the tests

  • In the root folder, type
$ ./dist/build/fpgrowth/fpgrowth <fileinputname> +RTS -N8 -s -ls -M3g

where:

+RTS : embedded flags

-Nx : number ot threads

-s : runtime statistics.

-ls : log for threadscope

-M3g : maximum of 3GB RAM use.

Author

  • Pedro Faustini

License

This project is licensed under the MIT License - see the LICENSE file for details

References

1 Jiawei Han, Jian Pei, and Yiwen Yin. Mining frequent patterns without candidate generation. In Proceedings of the ACM SIGMOD International on Management of Data, pages 1–12. ACM Press, 2000.