Sciweavers

279 search results - page 24 / 56
» Methods for finding frequent items in data streams
Sort
View
PAKDD
2007
ACM
144views Data Mining» more  PAKDD 2007»
14 years 1 months ago
Approximately Mining Recently Representative Patterns on Data Streams
Catching the recent trend of data is an important issue when mining frequent itemsets from data streams. To prevent from storing the whole transaction data within the sliding windo...
Jia-Ling Koh, Yuan-Bin Don
DAS
2010
Springer
13 years 5 months ago
Information extraction by finding repeated structure
Repetition of layout structure is prevalent in document images. In document design, such repetition conveys the underlying logical and functional structure of the data. For exampl...
Evgeniy Bart, Prateek Sarkar
TIP
2010
121views more  TIP 2010»
13 years 2 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
ESA
2005
Springer
107views Algorithms» more  ESA 2005»
14 years 1 months ago
Workload-Optimal Histograms on Streams
Histograms are used in many ways in conventional databases and in data stream processing for summarizing massive data distributions. Previous work on constructing histograms on da...
S. Muthukrishnan, Martin Strauss, X. Zheng
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 8 months ago
Efficient closed pattern mining in the presence of tough block constraints
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
Krishna Gade, Jianyong Wang, George Karypis