Sciweavers

80 search results - page 9 / 16
» Approximate mining of frequent patterns on 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
DAWAK
2008
Springer
14 years 11 months ago
Mining Multidimensional Sequential Patterns over Data Streams
Sequential pattern mining is an active field in the domain of knowledge discovery and has been widely studied for over a decade by data mining researchers. More and more, with the ...
Chedy Raïssi, Marc Plantevit
CINQ
2004
Springer
116views Database» more  CINQ 2004»
15 years 1 months ago
A Survey on Condensed Representations for Frequent Sets
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...
Toon Calders, Christophe Rigotti, Jean-Franç...
JIPS
2010
154views more  JIPS 2010»
14 years 4 months ago
Mining Spatio-Temporal Patterns in Trajectory Data
Spatio-temporal patterns extracted from historical trajectories of moving objects reveal important knowledge about movement behavior for high quality LBS services. Existing approac...
Juyoung Kang 0002, Hwan-Seung Yong
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...