Integration of candidate hash trees in concurrent processing of frequent itemset queries using Apriori

Przemysław Grudziński; Marek Wojciechowski

Control and Cybernetics (2009)

  • Volume: 38, Issue: 1, page 47-65
  • ISSN: 0324-8569

How to cite

top

Grudziński, Przemysław, and Wojciechowski, Marek. "Integration of candidate hash trees in concurrent processing of frequent itemset queries using Apriori." Control and Cybernetics 38.1 (2009): 47-65. <http://eudml.org/doc/209612>.

@article{Grudziński2009,
author = {Grudziński, Przemysław, Wojciechowski, Marek},
journal = {Control and Cybernetics},
keywords = {data mining; frequent itemset mining; data mining queries; Apriori algorithm},
language = {eng},
number = {1},
pages = {47-65},
title = {Integration of candidate hash trees in concurrent processing of frequent itemset queries using Apriori},
url = {http://eudml.org/doc/209612},
volume = {38},
year = {2009},
}

TY - JOUR
AU - Grudziński, Przemysław
AU - Wojciechowski, Marek
TI - Integration of candidate hash trees in concurrent processing of frequent itemset queries using Apriori
JO - Control and Cybernetics
PY - 2009
VL - 38
IS - 1
SP - 47
EP - 65
LA - eng
KW - data mining; frequent itemset mining; data mining queries; Apriori algorithm
UR - http://eudml.org/doc/209612
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.