Sciweavers

302 search results - page 41 / 61
» Efficient frequent pattern mining over data streams
Sort
View
SIGMOD
2007
ACM
164views Database» more  SIGMOD 2007»
15 years 9 months ago
Fast data stream algorithms using associative memories
The primary goal of data stream research is to develop space and time efficient solutions for answering continuous online summarization queries. Research efforts over the last dec...
Nagender Bandi, Ahmed Metwally, Divyakant Agrawal,...
102
Voted
SDM
2010
SIAM
202views Data Mining» more  SDM 2010»
14 years 8 months ago
Multiresolution Motif Discovery in Time Series
Time series motif discovery is an important problem with applications in a variety of areas that range from telecommunications to medicine. Several algorithms have been proposed t...
Nuno Castro, Paulo J. Azevedo
109
Voted
KDD
2004
ACM
144views Data Mining» more  KDD 2004»
15 years 10 months ago
IncSpan: incremental mining of sequential patterns in large database
Many real life sequence databases, such as customer shopping sequences, medical treatment sequences, etc., grow incrementally. It is undesirable to mine sequential patterns from s...
Hong Cheng, Xifeng Yan, Jiawei Han
68
Voted
TCS
2008
14 years 9 months ago
Itemset frequency satisfiability: Complexity and axiomatization
Computing frequent itemsets is one of the most prominent problems in data mining. We study the following related problem, called FREQSAT, in depth: given some itemset-interval pai...
Toon Calders
82
Voted
TIP
2010
121views more  TIP 2010»
14 years 4 months ago
Optimal PET Protection for Streaming Scalably Compressed Video Streams With Limited Retransmission Based on Incomplete Feedback
For streaming scalably compressed video streams over unreliable networks, Limited-Retransmission Priority Encoding Transmission (LR-PET) outperforms PET remarkably since the opport...
Ruiqin Xiong, David Taubman, Vijay Sivaraman