403 search results - page 9 / 81 » Frequent pattern mining with uncertain data |
CIKM
2005
Springer
14 years 1 months ago
2005
Springer
We explore in this paper a practicably interesting mining task to retrieve frequent itemsets with memory constraint. As opposed to most previous works that concentrate on improvin...
CIKM
2008
Springer
13 years 9 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...
ICDCN
2011
Springer
12 years 11 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...
MLDM
2009
Springer
14 years 2 months ago
2009
Springer
We face the problem of novelty detection from stream data, that is, the identification of new or unknown situations in an ordered sequence of objects which arrive on-line, at cons...
DAWAK
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We investigate the problem of finding frequent patterns in a continuous stream of transactions. It is recognized that the approximate solutions are usually sufficient and...