An efficient algorithm for mining frequent maximal and closed itemsets
From MaRDI portal
Publication:3655433
DOI10.3233/HIS-2009-0091zbMATH Open1200.68187OpenAlexW1618442343MaRDI QIDQ3655433FDOQ3655433
Authors: Tarek F. Gharib 
Publication date: 7 January 2010
Published in: International Journal of Hybrid Intelligent Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/his-2009-0091
Recommendations
- An algorithm for mining maximal frequent itemsets based on datasets iteration and intersection pruning
- scientific article; zbMATH DE number 1983139
- MAXFP-Miner: mining maximal frequent itemsets efficiently by using FP-tree
- scientific article; zbMATH DE number 2202222
- scientific article; zbMATH DE number 2219521
Cited In (15)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An algebraic semigroup method for discovering maximal frequent itemsets
- A novel algorithm for frequent itemset mining in data warehouses
- Exploiting the formation of maximal cliques in social networks
- An algorithm for mining maximal frequent itemsets based on datasets iteration and intersection pruning
- An efficient algorithm of mining frequent closed inter-transaction itemsets
- A novel bitmap-based algorithm for frequent itemsets mining
- A new algorithm for fast mining frequent itemsets using N-lists
- Title not available (Why is that?)
- Depth-first search algorithm for mining frequent closed itemsets
- Expressive generalized itemsets
- An algorithm for discovering the frequent closed itemsets in a large database
- Title not available (Why is that?)
This page was built for publication: An efficient algorithm for mining frequent maximal and closed itemsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3655433)
