Sciweavers

302 search results - page 5 / 61
» Efficient frequent pattern mining over data streams
Sort
View
KDD
2003
ACM
194views Data Mining» more  KDD 2003»
16 years 3 months ago
Finding recent frequent itemsets adaptively over online data streams
A data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. Consequently, the knowledge embedded in a data stream is more likely to be c...
Joong Hyuk Chang, Won Suk Lee
PR
2007
81views more  PR 2007»
15 years 2 months ago
Mining evolving data streams for frequent patterns
A data stream is a potentially uninterrupted flow of data. Mining this flow makes it necessary to cope with uncertainty, as only a part of the stream can be stored. In this pape...
Pierre-Alain Laur, Richard Nock, Jean-Emile Sympho...
AUSDM
2008
Springer
235views Data Mining» more  AUSDM 2008»
15 years 5 months ago
ShrFP-Tree: An Efficient Tree Structure for Mining Share-Frequent Patterns
Share-frequent pattern mining discovers more useful and realistic knowledge from database compared to the traditional frequent pattern mining by considering the non-binary frequen...
Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer,...
ICDM
2006
IEEE
114views Data Mining» more  ICDM 2006»
15 years 9 months ago
Incremental Mining of Frequent Query Patterns from XML Queries for Caching
Existing studies for mining frequent XML query patterns mainly introduce a straightforward candidate generate-and-test strategy and compute frequencies of candidate query patterns...
Guoliang Li, Jianhua Feng, Jianyong Wang, Yong Zha...