Results 131 to 140 of about 2,811 (218)

Extraction of itemsets frequents

open access: yesInternational Journal of Mathematics Research, 2020
R. Elayachi   +3 more
openaire   +1 more source

A probability analysis for candidate-based frequent itemset algorithms

open access: yes, 2006
This paper explores the generation of candidates, which is an important step in frequent itemset mining algorithms, from a theoretical point of view. Important notions in our probabilistic analysis are success (a candidate that is frequent), and failure (
Nele Dexters
core  

Home - About - Disclaimer - Privacy