Sciweavers

1217 search results - page 86 / 244
» On compressing frequent patterns
Sort
View
TIP
2010
121views more  TIP 2010»
15 years 1 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
PADL
2005
Springer
15 years 11 months ago
A Full Pattern-Based Paradigm for XML Query Processing
In this article we investigate a novel execution paradigm—ML-like pattern-matching— for XML query processing. We show that such a paradigm is well adapted for a common and freq...
Véronique Benzaken, Giuseppe Castagna, C&ea...
KDD
2006
ACM
109views Data Mining» more  KDD 2006»
16 years 6 months ago
Extracting redundancy-aware top-k patterns
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
Dong Xin, Hong Cheng, Xifeng Yan, Jiawei Han
IS
2010
15 years 4 months ago
Tree pattern mining with tree automata constraints
Most work on pattern mining focuses on simple data structures such as itemsets and sequences of itemsets. However, a lot of recent applications dealing with complex data like chem...
Sandra de Amo, Nyara A. Silva, Ronaldo P. Silva, F...
GRC
2010
IEEE
15 years 7 months ago
Local Pattern Mining from Sequences Using Rough Set Theory
Abstract--Sequential pattern mining is a crucial but challenging task in many applications, e.g., analyzing the behaviors of data in transactions and discovering frequent patterns ...
Ken Kaneiwa, Yasuo Kudo