Geodesic
Finding frequent closed itemsets with an extended version of the Eclat algorithm
Annales mathematicae et informaticae, Tome 48 (2018), pp. 75-82
Cet article a éte moissonné depuis la source Annales Mathematica et Informaticae website

Voir la notice de l'article

@article{AMI_2018_48_a7,
     author = {Laszlo Szathmary},
     title = {Finding frequent closed itemsets with an extended version of the {Eclat} algorithm},
     journal = {Annales mathematicae et informaticae},
     pages = {75--82},
     year = {2018},
     volume = {48},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/AMI_2018_48_a7/}
}
TY  - JOUR
AU  - Laszlo Szathmary
TI  - Finding frequent closed itemsets with an extended version of the Eclat algorithm
JO  - Annales mathematicae et informaticae
PY  - 2018
SP  - 75
EP  - 82
VL  - 48
UR  - http://geodesic.mathdoc.fr/item/AMI_2018_48_a7/
LA  - en
ID  - AMI_2018_48_a7
ER  - 
%0 Journal Article
%A Laszlo Szathmary
%T Finding frequent closed itemsets with an extended version of the Eclat algorithm
%J Annales mathematicae et informaticae
%D 2018
%P 75-82
%V 48
%U http://geodesic.mathdoc.fr/item/AMI_2018_48_a7/
%G en
%F AMI_2018_48_a7
Laszlo Szathmary. Finding frequent closed itemsets with an extended version of the Eclat algorithm. Annales mathematicae et informaticae, Tome 48 (2018), pp. 75-82. http://geodesic.mathdoc.fr/item/AMI_2018_48_a7/