An algebraic semigroup method for discovering maximal frequent itemsets

DOI10.1515/MATH-2022-0516MaRDI QIDQ2111834zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 17 January 2023

Published in Open Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1515/math-2022-0516

zbMATH Keywords

generatorsemigroupassociation rule miningmaximal frequent itemset

Mathematics Subject Classification ID

Algorithms in computer science (68W99)

Recommendations

• scientific article; zbMATH DE number 1983139
• An algorithm for mining maximal frequent itemsets based on datasets iteration and intersection pruning
• Maximal frequent sets
• scientific article; zbMATH DE number 2202222
• An efficient algorithm for mining frequent maximal and closed itemsets

Cites work

• scientific article; zbMATH DE number 3179521 (Why is no real title available?)
• Arboricity and bipartite subgraph listing algorithms
• Mining maximal frequent patterns in transactional databases and dynamic data streams: a Spark-based approach
• On maximal frequent and minimal infrequent sets in binary matrices

Cited in

(2)

• Maximal frequent sets
• On maximal frequent and minimal infrequent sets in binary matrices

This page was built for publication: An algebraic semigroup method for discovering maximal frequent itemsets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111834)