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

An improved FP-growth algorithm based on aggregative chains

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

zbMATH Open1114.68606MaRDI QIDQ5469869FDOQ5469869

Jiafu Tang, Huiyan Jiang, Minghai Jiao

Publication date: 26 May 2006





Recommendations

  • Research and application on Web information retrieval based on improved FP-growth algorithm
  • New frequent pattern tree structure
  • Improved FP-growth algorithm and its applications in the business association
  • Fast FP-growth for association rule mining
  • An improved algorithm of Apriori


zbMATH Keywords

aggregative chains


Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)



Cited In (3)

  • Research and application on Web information retrieval based on improved FP-growth algorithm
  • New frequent pattern tree structure
  • Title not available (Why is that?)





This page was built for publication: An improved FP-growth algorithm based on aggregative chains

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

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