Hide/Show Apps

Frequent itemset minning with trie data structure and parallel execution with PVM

2007-10-03
Guner, Levent
Karagöz, Pınar
Show full item record
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
2
views
0
downloads
Apriori algorithm is one of the basic algorithms introduced to solve the problem of frequent itemset mining (FIM). Since there is a new generation of affordable computers with parallel processing capability and it is easier to set up computer clusters, we can develop more efficient parallel FIM algorithms for these new systems. This paper investigates the use of trie data structure in parallel execution of Apriori algorithm, the potential problems during implementation, performance comparison of several parallel implementations and in order to increase the efficiency, proposes a new way of message passing for parallel Apriori on a computer cluster with PVM.
Message passing, Trie, Parallel execution, PVM, Apriori
https://hdl.handle.net/11511/62444
Department of Computer Engineering, Conference / Seminar
METU IIS - Integrated Information Service IT Support Service
You can transmit your request, problems about services
provided by METU Computer Center, and follow the process.