Sciweavers

257 search results - page 17 / 52
» An Approximate L1-Difference Algorithm for Massive Data Stre...
Sort
View
JMLR
2012
13 years 2 days ago
Online Incremental Feature Learning with Denoising Autoencoders
While determining model complexity is an important problem in machine learning, many feature learning algorithms rely on cross-validation to choose an optimal number of features, ...
Guanyu Zhou, Kihyuk Sohn, Honglak Lee
ICDE
2010
IEEE
188views Database» more  ICDE 2010»
15 years 9 months ago
Space-efficient Online Approximation of Time Series Data: Streams, Amnesia, and Out-of-order
In this paper, we present an abstract framework for online approximation of time-series data that yields a unified set of algorithms for several popular models: data streams, amnes...
Sorabh Gandhi, Luca Foschini, Subhash Suri
SIGMOD
2010
ACM
259views Database» more  SIGMOD 2010»
15 years 2 months ago
PODS: a new model and processing algorithms for uncertain data streams
Uncertain data streams, where data is incomplete, imprecise, and even misleading, have been observed in many environments. Feeding such data streams to existing stream systems pro...
Thanh T. L. Tran, Liping Peng, Boduo Li, Yanlei Di...
SIGMOD
2003
ACM
158views Database» more  SIGMOD 2003»
15 years 9 months ago
Processing Set Expressions over Continuous Update Streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
ICDT
2009
ACM
148views Database» more  ICDT 2009»
15 years 10 months ago
Tight results for clustering and summarizing data streams
In this paper we investigate algorithms and lower bounds for summarization problems over a single pass data stream. In particular we focus on histogram construction and K-center c...
Sudipto Guha