Sciweavers

302 search results - page 30 / 61
» Efficient frequent pattern mining over data streams
Sort
View
89
Voted
KDD
2003
ACM
192views Data Mining» more  KDD 2003»
15 years 10 months ago
Efficient elastic burst detection in data streams
Burst detection is the activity of finding abnormal aggregates in data streams. Such aggregates are based on sliding windows over data streams. In some applications, we want to mo...
Yunyue Zhu, Dennis Shasha
DASFAA
2008
IEEE
149views Database» more  DASFAA 2008»
14 years 10 months ago
A Test Paradigm for Detecting Changes in Transactional Data Streams
A pattern is considered useful if it can be used to help a person to achieve his goal. Mining data streams for useful patterns is important in many applications. However, data stre...
Willie Ng, Manoranjan Dash
ICDM
2006
IEEE
161views Data Mining» more  ICDM 2006»
15 years 3 months ago
STAGGER: Periodicity Mining of Data Streams Using Expanding Sliding Windows
Sensor devices are becoming ubiquitous, especially in measurement and monitoring applications. Because of the real-time, append-only and semi-infinite natures of the generated se...
Mohamed G. Elfeky, Walid G. Aref, Ahmed K. Elmagar...
95
Voted
DMIN
2006
137views Data Mining» more  DMIN 2006»
14 years 11 months ago
Discovering of Frequent Itemsets with CP-mine Algorithm
Efficient algorithms to discover frequent patterns are crucial in data mining research. Several effective data structures, such as two-dimensional arrays, graphs, trees, and tries ...
Nuansri Denwattana, Yutthana Treewai
IS
2007
14 years 9 months ago
Discovering frequent geometric subgraphs
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
Michihiro Kuramochi, George Karypis