The hlcm package

[Tags: bsd3, library, program]

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.


Versions0.2.1, 0.2.2
Change logNone available
Dependenciesarray (>=0.2), base (==3.*), bytestring, bytestring-csv, containers (>=0.3), haskell98, parallel (>=2.2)
AuthorAlexandre Termier, Simon Marlow, Satnam Singh
CategoryAlgorithms, Data Mining
Home page
ExecutablesbenchHLCM, hlcm
UploadedWed Jun 16 10:20:51 UTC 2010 by AlexandreTermier
Downloads359 total (21 in last 30 days)
StatusDocs uploaded by user
Build status unknown [no reports yet]




Maintainers' corner

For package maintainers and hackage trustees