The hlcm package
Closed frequent itemsets are patterns that occur more than a defined threshold in a transactional database. This program is a Haskell implementation of the LCM2 algorithm by Takeaki Uno and Hiroki Arimura, which is the fastest algorithm for this task. This implementation can make use of several threads.
Properties
| Versions | 0.2.1, 0.2.2 |
|---|---|
| Dependencies | array (≥0.2), base (3.*), bytestring, bytestring-csv, containers (≥0.3), haskell98, parallel (≥2.2) |
| License | BSD3 |
| Author | Alexandre Termier, Simon Marlow, Satnam Singh |
| Maintainer | Alexandre.Termier@imag.fr |
| Category | Algorithms, Data Mining |
| Home page | http://membres-liglab.imag.fr/termier/HLCM/hlcm.html |
| Executables | benchHLCM, hlcm |
| Upload date | Wed Jun 16 10:20:51 UTC 2010 |
| Uploaded by | AlexandreTermier |
| Built on | ghc-6.12 |
| Build failure | ghc-7.0 (log), ghc-7.4 (log) |
Modules
Downloads
- hlcm-0.2.2.tar.gz (Cabal source package)
- package description (included in the package)