research
∙
03/13/2020
DriftSurf: A Risk-competitive Learning Algorithm under Concept Drift
When learning from streaming data, a change in the data distribution, al...
share
research
∙
01/30/2020
Shared-Memory Parallel Maximal Clique Enumeration from Static and Dynamic Graphs
Maximal Clique Enumeration (MCE) is a fundamental graph mining problem, ...
research
∙
09/05/2019
Random Sampling for Group-By Queries
Random sampling has been widely used in approximate query processing on ...
research
∙
06/10/2019
Parallel Streaming Random Sampling
This paper investigates parallel random sampling from a potentially-unen...
research
∙
04/08/2019
Weighted Reservoir Sampling from Distributed Streams
We consider message-efficient continuous random sampling from a distribu...
research
∙
03/28/2019
Optimal Random Sampling from Distributed Streams Revisited
We give an improved algorithm for drawing a random sample from a large d...
research
∙
12/08/2018
Counting Butterfies from a Large Bipartite Graph Stream
We consider the estimation of properties on massive bipartite graph stre...
research
∙
08/28/2018
Enumerating Top-k Quasi-Cliques
Quasi-cliques are dense incomplete subgraphs of a graph that generalize ...
research
∙
07/25/2018
Shared-Memory Parallel Maximal Clique Enumeration
We present shared-memory parallel methods for Maximal Clique Enumeration...
research
∙
01/27/2018
Variance-Optimal Offline and Streaming Stratified Random Sampling
Stratified random sampling (SRS) is a fundamental sampling technique tha...
research
∙
01/23/2018
Onion Curve: A Space Filling Curve with Near-Optimal Clustering
Space filling curves (SFCs) are widely used in the design of indexes for...
research
∙
12/31/2017
Butterfly Counting in Bipartite Networks
Graph motifs are used to analyze networks from diverse domains. We consi...
research
∙
10/05/2017
Learning Graphical Models from a Distributed Stream
A current challenge for data management systems is to support the constr...
research
∙
07/26/2017