Sciweavers

279 search results - page 4 / 56
» Methods for finding frequent items in data streams
Sort
View
JIIS
2007
150views more  JIIS 2007»
13 years 6 months ago
Towards a new approach for mining frequent itemsets on data stream
Mining frequent patterns on streaming data is a new challenging problem for the data mining community since data arrives sequentially in the form of continuous rapid streams. In t...
Chedy Raïssi, Pascal Poncelet, Maguelonne Tei...
ICDM
2002
IEEE
148views Data Mining» more  ICDM 2002»
13 years 12 months ago
SLPMiner: An Algorithm for Finding Frequent Sequential Patterns Using Length-Decreasing Support Constraint
Over the years, a variety of algorithms for finding frequent sequential patterns in very large sequential databases have been developed. The key feature in most of these algorith...
Masakazu Seno, George Karypis
ESCAPE
2007
Springer
266views Algorithms» more  ESCAPE 2007»
14 years 1 months ago
CR-precis: A Deterministic Summary Structure for Update Data Streams
We present deterministic sub-linear space algorithms for a number of problems over update data streams, including, estimating frequencies of items and ranges, finding approximate ...
Sumit Ganguly, Anirban Majumder
FIMI
2003
95views Data Mining» more  FIMI 2003»
13 years 8 months ago
Probabilistic Iterative Expansion of Candidates in Mining Frequent Itemsets
A simple new algorithm is suggested for frequent itemset mining, using item probabilities as the basis for generating candidates. The method first finds all the frequent items, an...
Attila Gyenesei, Jukka Teuhola
PODS
2006
ACM
134views Database» more  PODS 2006»
14 years 7 months ago
Finding global icebergs over distributed data sets
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
Qi Zhao, Mitsunori Ogihara, Haixun Wang, Jun Xu