Sciweavers

725 search results - page 70 / 145
» Approximate Join Processing Over Data Streams
Sort
View
DOLAP
2003
ACM
14 years 2 months ago
Exploiting hierarchical clustering in evaluating multidimensional aggregation queries
Multidimensional aggregation queries constitute the single most important class of queries for data warehousing applications and decision support systems. The bottleneck in the ev...
Dimitri Theodoratos
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
14 years 9 months ago
CFI-Stream: mining closed frequent itemsets in data streams
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
Nan Jiang, Le Gruenwald
ICML
2008
IEEE
14 years 9 months ago
Modeling interleaved hidden processes
Hidden Markov models assume that observations in time series data stem from some hidden process that can be compactly represented as a Markov chain. We generalize this model by as...
Niels Landwehr
SIGMOD
2006
ACM
194views Database» more  SIGMOD 2006»
14 years 9 months ago
Graph-based synopses for relational selectivity estimation
This paper introduces the Tuple Graph (TuG) synopses, a new class of data summaries that enable accurate selectivity estimates for complex relational queries. The proposed summari...
Joshua Spiegel, Neoklis Polyzotis
KDD
2009
ACM
187views Data Mining» more  KDD 2009»
14 years 9 months ago
New ensemble methods for evolving data streams
Advanced analysis of data streams is quickly becoming a key area of data mining research as the number of applications demanding such processing increases. Online mining when such...
Albert Bifet, Bernhard Pfahringer, Geoffrey Holmes...