Pfp: parallel fp-growth for query recommendation

H Li, Y Wang, D Zhang, M Zhang… - Proceedings of the 2008 …, 2008 - dl.acm.org
Frequent itemset mining (FIM) is a useful tool for discovering frequently co-occurrent items.
Since its inception, a number of significant FIM algorithms have been developed to speed up …

[图书][B] High-performance parallel database processing and grid databases

D Taniar, CHC Leung, W Rahayu, S Goel - 2008 - books.google.com
The latest techniques and principles of parallel and grid database processing The growth in
grid databases, coupled with the utility of parallel query processing, presents an important …

A fast parallel association rules mining algorithm based on FP-forest

J Hu, X Yang-Li - Advances in Neural Networks-ISNN 2008: 5th …, 2008 - Springer
Parallel association rules mining is a high performance mining method. Until now there are
many parallel algorithms to mine association rules, this paper emphatically analyses …

A parallelization framework for exact knowledge hiding in transactional databases

A Gkoulalas-Divanis, VS Verykios - Proceedings of The Ifip Tc 11 23 rd …, 2008 - Springer
The hiding of sensitive knowledge, mined from transactional databases, is one of the
primary goals of privacy preserving data mining. The increased storage capabilities of …

Scalable mining on emerging architectures

GT Buehrer - 2008 - rave.ohiolink.edu
Data mining is the process of discovering interesting and previously unknown information
from such stores. Recent advances in data collection technology have generated large …

An abstraction based communication efficient distributed association rule mining

PS Thilagam, VS Ananthanarayana - … 2008, Kolkata, India, January 5-8 …, 2008 - Springer
Association rule mining is one of the most researched areas because of its applicability in
various fields. We propose a novel data structure called Sequence Pattern Count, SPC, tree …

[引用][C] 关联规则挖掘研究综述

武瑞娟, 马礼, 叶树华 - 电脑开发与应用, 2008