502 search results - page 16 / 101 » Mining Supplemental Frequent Patterns |
170
click to vote
VLDB
2005
ACM
15 years 10 months ago
2005
ACM
In this paper, we examine the performance of frequent pattern mining algorithms on a modern processor. A detailed performance study reveals that even the best frequent pattern min...
191
click to vote
ICDCN
2011
Springer
14 years 8 months ago
2011
Springer
In this paper, we propose to use graph-mining techniques to understand the communication pattern within a data-centre. We model the communication observed within a data-centre as a...
124
click to vote
CIKM
2008
Springer
15 years 7 months ago
2008
Springer
This paper proposes a prefix-tree structure, called CPS-tree (Compact Pattern Stream tree) that efficiently discovers the exact set of recent frequent patterns from high-speed dat...
113
click to vote
PAKDD
2005
ACM
15 years 10 months ago
2005
ACM
In this paper we extend the state-of-art of the constraints that can be pushed in a frequent pattern computation. We introduce a new class of tough constraints, namely Loose Anti-m...
155
click to vote
IPPS
2006
IEEE
15 years 11 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...