Mining frequent items in a product of partial orders using parallel calculations
From MaRDI portal
Publication:2069672
DOI10.1134/S0005117921100039OpenAlexW3217691966MaRDI QIDQ2069672
E. V. Dyukova, I. E. Genrikhov
Publication date: 21 January 2022
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0005117921100039
databaseparallel computingCUDA technologyCartesian product of partial ordersFP-treefrequent itemthreshold FP-tree
Uses Software
Cites Work
This page was built for publication: Mining frequent items in a product of partial orders using parallel calculations