Sciweavers

259 search results - page 25 / 52
» Mining frequent itemsets in time-varying data streams
Sort
View
ADBIS
2004
Springer
133views Database» more  ADBIS 2004»
15 years 3 months ago
Evaluation of the Mine-Merge Method for Data Mining Query Processing
In this paper we consider concurrent execution of multiple data mining queries in the context of discovery of frequent itemsets. If such data mining queries operate on similar part...
Marek Wojciechowski, Maciej Zakrzewicz
WWW
2006
ACM
15 years 10 months ago
Online mining of frequent query trees over XML data streams
In this paper, we proposed an online algorithm, called FQT-Stream (Frequent Query Trees of Streams), to mine the set of all frequent tree patterns over a continuous XML data strea...
Hua-Fu Li, Man-Kwan Shan, Suh-Yin Lee
DAWAK
2006
Springer
15 years 1 months ago
Two New Techniques for Hiding Sensitive Itemsets and Their Empirical Evaluation
Many privacy preserving data mining algorithms attempt to selectively hide what database owners consider as sensitive. Specifically, in the association-rules domain, many of these ...
Ahmed HajYasien, Vladimir Estivill-Castro
72
Voted
CIKM
2008
Springer
14 years 11 months ago
Efficient frequent pattern mining over data streams
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...
Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed,...
DAWAK
2004
Springer
15 years 1 months ago
PROWL: An Efficient Frequent continuity Mining Algorithm on Event Sequences
Mining association rule in event sequences is an important data mining problem with many applications. Most of previous studies on association rules are on mining intra-transaction...
Kuo-Yu Huang, Chia-Hui Chang, Kuo-Zui Lin