Right-Hand Side Expanding Algorithm for Maximal Frequent Itemset Mining

When it comes to association rule mining, all frequent itemsets are first found, and then the confidence level of association rules is calculated through the support degree of frequent itemsets. As all non-empty subsets in frequent itemsets are still frequent itemsets, all frequent itemsets can be a...

Description complète

Enregistré dans:
Détails bibliographiques
Auteurs principaux: Yalong Zhang, Wei Yu, Qiuqin Zhu, Xuan Ma, Hisakazu Ogura
Format: article
Langue:EN
Publié: MDPI AG 2021
Sujets:
T
Accès en ligne:https://doaj.org/article/7fc973f5996244e0b414927259731e4e
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!