Cite
HARVARD Citation
Salah, S. et al. (n.d.). A highly scalable parallel algorithm for maximally informative k-itemset mining. Knowledge and information systems. 50 (1), pp. 1-26. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Salah, S. et al. (n.d.). A highly scalable parallel algorithm for maximally informative k-itemset mining. Knowledge and information systems. 50 (1), pp. 1-26. [Online].