Fast Algorithm for Mining Global Frequent Itemsets Based on Distributed Database

From MaRDI portal

Revision as of 05:04, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5757984

Jump to:navigation, search

DOI10.1007/11795131_60zbMath1196.68191OpenAlexW2171837331MaRDI QIDQ5757984

Yuan Chen, Bo He, Yue Wang, Wu Yang

Publication date: 7 September 2007

Published in: Rough Sets and Knowledge Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11795131_60

zbMATH Keywords

distributed database FP-tree FP-growth Global frequent itemsets

Mathematics Subject Classification ID

Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05)

This page was built for publication: Fast Algorithm for Mining Global Frequent Itemsets Based on Distributed Database

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5757984&oldid=30527565"