𝔖 Bobbio Scriptorium
✦   LIBER   ✦

[ACM Press the 1st international workshop - Chicago, Illinois (2005.08.21-2005.08.21)] Proceedings of the 1st international workshop on open source data mining frequent pattern mining implementations - OSDM '05 - An implementation of the FP-growth algorithm

✍ Scribed by Borgelt, Christian


Book ID
124082065
Publisher
ACM Press
Year
2005
Weight
368 KB
Category
Article
ISBN-13
9781595932105

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


[ACM Press the 1st International Worksho
✍ Zeng, ZengFeng; Wu, Bin; Wang, Haoyu πŸ“‚ Article πŸ“… 2012 πŸ› ACM Press βš– 730 KB

For the large-scale distributed graph mining, the graph is distributed over a cluster of nodes, thus performing computations on the distributed graph is expensive when large amount of data have to be moved between different computers. A good partitioning of distributed graph is needed to reduce the