- Tytuł:
- Integration of candidate hash trees in concurrent processing of frequent itemset queries using Apriori
- Autorzy:
-
Grudziński, P.
Wojciechowski, M. - Powiązania:
- https://bibliotekanauki.pl/articles/970835.pdf
- Data publikacji:
- 2009
- Wydawca:
- Polska Akademia Nauk. Instytut Badań Systemowych PAN
- Tematy:
-
data mining
frequent itemset mining
data mining queries - Opis:
- Frequent itemset mining is often regarded as advanced querying where a user specifies the source dataset and pattern constraints using a given constraint model. In this paper we address the problem of processing batches of frequent itemset queries using the Apriori algorithm. The best solution of this problem proposed so far is Common Counting, which consists in concurrent execution of the queries using Apriori with the integration of scans of the parts of the database shared among the queries. In this paper we propose a new method - Common Candidate Tree, offering a more tight integration of the concurrently processed queries by sharing memory data structures, i.e., candidate hash trees. The experiments show that Common Candidate Tree outperforms Common Counting in terms of execution time. Moreover, thanks to smaller memory consumption, Common Candidate Tree can be applied to larger batches of queries.
- Źródło:
-
Control and Cybernetics; 2009, 38, 1; 47-65
0324-8569 - Pojawia się w:
- Control and Cybernetics
- Dostawca treści:
- Biblioteka Nauki
Artykuł