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

Guner L., Senkul P.

14th EuroPVM/MPI Conference, Paris, Fransa, 30 Eylül - 03 Ekim 2007, cilt.4757, ss.289-296 identifier identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Cilt numarası: 4757
  • Basıldığı Şehir: Paris
  • Basıldığı Ülke: Fransa
  • Sayfa Sayıları: ss.289-296
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

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.