Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Inverse Frequent Itemset Mining Based on FP-Tree

From MaRDI portal
Publication:3406331
Jump to:navigation, search

DOI10.3724/SP.J.1001.2008.00338zbMATH Open1199.68088MaRDI QIDQ3406331FDOQ3406331


Authors: Yuhong Guo, Yunhai Tong, Dongqing Yang, Shi-Wei Tang Edit this on Wikidata


Publication date: 12 February 2010

Published in: Journal of Software (Search for Journal in Brave)





Recommendations

  • An efficient approach for incremental mining fuzzy frequent itemsets with FP-tree
  • scientific article; zbMATH DE number 2202222
  • Frequent pattern mining with non-overlapping inversions
  • MAXFP-Miner: mining maximal frequent itemsets efficiently by using FP-tree
  • Mining maximal frequent itemsets using the ordered FP-tree
  • scientific article; zbMATH DE number 6672129


zbMATH Keywords

frequent itemsetprivacy preservingFP-treeknowledge hidinginverse mining


Mathematics Subject Classification ID

Database theory (68P15)



Cited In (1)

  • An efficient method for constructing an I-tree





This page was built for publication: Inverse Frequent Itemset Mining Based on FP-Tree

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3406331&oldid=16694019"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 4 February 2024, at 17:38. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki