Mining frequent items in a product of partial orders using parallel calculations (Q2069672): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1134/s0005117921100039 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3217691966 / rank | |||
Normal rank | |||
Latest revision as of 09:35, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Mining frequent items in a product of partial orders using parallel calculations |
scientific article |
Statements
Mining frequent items in a product of partial orders using parallel calculations (English)
0 references
21 January 2022
0 references
Cartesian product of partial orders
0 references
database
0 references
frequent item
0 references
FP-tree
0 references
threshold FP-tree
0 references
parallel computing
0 references
CUDA technology
0 references
