Probablistic load balancing method for parallel mining of all frequent itemsets
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F06%3A00122220" target="_blank" >RIV/68407700:21230/06:00122220 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Probablistic load balancing method for parallel mining of all frequent itemsets
Original language description
In this paper, we present a new method of static load balancing for parallel mining of all frequent itemsets on a distributed-memory (DM) parallel machine. The method partitions the space of all frequent itemsets into subspaces of approximately the same size. Hence, it allows to balance the computational load for an arbitrary frequent itemset mining algorithm.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2006
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 18th IASTED International Conference Parallel and Distributed Computing and Systems
ISBN
0-88986-638-4
ISSN
—
e-ISSN
—
Number of pages
9
Pages from-to
578-586
Publisher name
IASTED / Acta Press
Place of publication
Calgary
Event location
Dallas, TX
Event date
Nov 13, 2006
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000243782100091