Sciweavers

257 search results - page 27 / 52
» An Approximate L1-Difference Algorithm for Massive Data Stre...
Sort
View
DASFAA
2010
IEEE
193views Database» more  DASFAA 2010»
14 years 7 months ago
A Simple, Yet Effective and Efficient, Sliding Window Sampling Algorithm
Sampling streams of continuous data with limited memory, or reservoir sampling, is a utility algorithm. Standard reservoir sampling maintains a random sample of the entire stream a...
Xuesong Lu, Wee Hyong Tok, Chedy Raïssi, St&e...
GECCO
2004
Springer
102views Optimization» more  GECCO 2004»
15 years 3 months ago
Dynamic and Scalable Evolutionary Data Mining: An Approach Based on a Self-Adaptive Multiple Expression Mechanism
Data mining has recently attracted attention as a set of efficient techniques that can discover patterns from huge data. More recent advancements in collecting massive evolving da...
Olfa Nasraoui, Carlos Rojas, Cesar Cardona
78
Voted
ALENEX
2010
117views Algorithms» more  ALENEX 2010»
14 years 11 months ago
Untangling the Braid: Finding Outliers in a Set of Streams
Monitoring the performance of large shared computing systems such as the cloud computing infrastructure raises many challenging algorithmic problems. One common problem is to trac...
Chiranjeeb Buragohain, Luca Foschini, Subhash Suri
107
Voted
VLDB
2004
ACM
134views Database» more  VLDB 2004»
15 years 3 months ago
Memory-Limited Execution of Windowed Stream Joins
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...
Utkarsh Srivastava, Jennifer Widom
84
Voted
ICDM
2010
IEEE
164views Data Mining» more  ICDM 2010»
14 years 7 months ago
On Finding Similar Items in a Stream of Transactions
While there has been a lot of work on finding frequent itemsets in transaction data streams, none of these solve the problem of finding similar pairs according to standard similar...
Andrea Campagna, Rasmus Pagh