41 search results - page 5 / 9 » Parallel and Distributed Frequent Itemset Mining on Dynamic ... |
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper, we present a tree-partition algorithm for parallel mining of frequent patterns. Our work is based on FP-Growth algorithm, which is constituted of tree-building stag...
ICPADS
2006
IEEE
15 years 3 months ago
2006
IEEE
When computationally feasible, mining extremely large databases produces tremendously large numbers of frequent patterns. In many cases, it is impractical to mine those datasets d...
63
Voted
ICA3PP
2005
Springer
15 years 2 months ago
2005
Springer
Abstract— Large scale distributed computing infrastructure captures the use of high number of nodes, poor communication performance and continously varying resources that are not...
IPPS
2002
IEEE
15 years 2 months ago
2002
IEEE
Most current work in data mining assumes that the database is static, and a database update requires rediscovering all the patterns by scanning the entire old and new database. Su...
120
click to vote
SPAA
1997
ACM
15 years 1 months ago
1997
ACM
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...