Sciweavers

302 search results - page 4 / 61
» Efficient frequent pattern mining over data streams
Sort
View
PODS
2006
ACM
217views Database» more  PODS 2006»
15 years 9 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
AUSDM
2007
Springer
145views Data Mining» more  AUSDM 2007»
15 years 3 months ago
Discovering Frequent Sets from Data Streams with CPU Constraint
Data streams are usually generated in an online fashion characterized by huge volume, rapid unpredictable rates, and fast changing data characteristics. It has been hence recogniz...
Xuan Hong Dang, Wee Keong Ng, Kok-Leong Ong, Vince...
JIIS
2008
133views more  JIIS 2008»
14 years 9 months ago
Maintaining frequent closed itemsets over a sliding window
In this paper, we study the incremental update of Frequent Closed Itemsets (FCIs) over a sliding window in a high-speed data stream. We propose the notion of semi-FCIs, which is to...
James Cheng, Yiping Ke, Wilfred Ng
ACSW
2004
14 years 11 months ago
Cost-Efficient Mining Techniques for Data Streams
A data stream is a continuous and high-speed flow of data items. High speed refers to the phenomenon that the data rate is high relative to the computational power. The increasing...
Mohamed Medhat Gaber, Shonali Krishnaswamy, Arkady...
CIDM
2007
IEEE
14 years 9 months ago
SSM : A Frequent Sequential Data Stream Patterns Miner
Data stream applications like sensor network data, click stream data, have data arriving continuously at high speed rates and require online mining process capable of delivering c...
C. I. Ezeife, Mostafa Monwar