{"@context":"https://w3id.org/codemeta/3.0","@type":"SoftwareSourceCode","identifier":"pkg:hackage/hlcm","name":"hlcm","description":"Closed frequent itemsets are patterns that occur more\nthan a defined threshold in a transactional database.\nThis program is a Haskell implementation of the LCM2\nalgorithm by Takeaki Uno and Hiroki Arimura, which\nis the fastest algorithm for this task.\nThis implementation can make use of several threads.","version":"0.2.2","softwareVersion":"0.2.2","license":"https://spdx.org/licenses/BSD-3-Clause","url":"http://membres-liglab.imag.fr/termier/HLCM/hlcm.html","keywords":["algorithms","bsd3","data-mining-----------","library","program","Propose Tags"],"maintainer":[{"@type":"Person","name":"AlexandreTermier"}],"author":[{"@type":"Person","name":"AlexandreTermier"}],"copyrightHolder":[{"@type":"Person","name":"AlexandreTermier"}],"dateCreated":"2010-06-16","dateModified":"2010-06-16","datePublished":"2010-06-16","copyrightYear":2010,"downloadUrl":"https://hackage.haskell.org/package/hlcm-0.2.2/hlcm-0.2.2.tar.gz","applicationCategory":"hackage","runtimePlatform":"hackage","sameAs":["https://hackage.haskell.org/package/hlcm"]}