Zobrazeno 1 - 1
of 1
pro vyhledávání: '"motifs générateurs"'
Publikováno v:
[Research Report] RR-6657, INRIA. 2008, pp.58
The effective construction of many association rule bases require the computation of frequent closures, generators, and precedence links between closures. However, these tasks are rarely combined, and no scalable algorithm exists at present for their
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::e2c148d44623d92508058ab8c06c2fac
https://hal.inria.fr/inria-00322798v2/file/RR-6657.pdf
https://hal.inria.fr/inria-00322798v2/file/RR-6657.pdf
