Sciweavers

303 search results - page 26 / 61
» Update Algorithms for the Sketch Data Model
Sort
View
DAWAK
2010
Springer
15 years 5 months ago
Mining Closed Itemsets in Data Stream Using Formal Concept Analysis
Mining of frequent closed itemsets has been shown to be more efficient than mining frequent itemsets for generating non-redundant association rules. The task is challenging in data...
Anamika Gupta, Vasudha Bhatnagar, Naveen Kumar
224
Voted
ICDE
2003
IEEE
73views Database» more  ICDE 2003»
16 years 5 months ago
Scalable Application-Aware Data Freshening
Distributed databases and other networked information systems use copies or mirrors to reduce latency and to increase availability. Copies need to be refreshed. In a loosely coupl...
Donald Carney, Sangdon Lee, Stanley B. Zdonik
ICML
2006
IEEE
16 years 5 months ago
Kernel Predictive Linear Gaussian models for nonlinear stochastic dynamical systems
The recent Predictive Linear Gaussian model (or PLG) improves upon traditional linear dynamical system models by using a predictive representation of state, which makes consistent...
David Wingate, Satinder P. Singh
IJCNN
2006
IEEE
15 years 10 months ago
Common Subset Selection of Inputs in Multiresponse Regression
— We propose the Multiresponse Sparse Regression algorithm, an input selection method for the purpose of estimating several response variables. It is a forward selection procedur...
Timo Similä, Jarkko Tikka
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
16 years 1 months ago
On the Cell Probe Complexity of Dynamic Membership
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
KE YI, QIN ZHANG