An algebraic semigroup method for discovering maximal frequent itemsets

DOI10.1515/MATH-2022-0516OpenAlexW4312757743MaRDI QIDQ2111834FDOQ2111834

Yanyan Li

Publication date: 17 January 2023

Published in: Open Mathematics (Search for Journal in Brave)

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)

Cites Work

• Title not available (Why is that?)
• On maximal frequent and minimal infrequent sets in binary matrices
• Arboricity and bipartite subgraph listing algorithms
• Mining maximal frequent patterns in transactional databases and dynamic data streams: a Spark-based approach

Cited In (1)

• On maximal frequent and minimal infrequent sets in binary matrices

   Recommendations

• Title not available (Why is that?) 👍 👎
• An algorithm for mining maximal frequent itemsets based on datasets iteration and intersection pruning 👍 👎
• Maximal frequent sets 👍 👎
• Title not available (Why is that?) 👍 👎
• An efficient algorithm for mining frequent maximal and closed itemsets 👍 👎

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)