30 citations · 30 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2018★ 30 cited
FLEET: Butterfly Estimation from a Bipartite Graph Stream
Seyed-Vahid Sanei-Mehri, Yu Zhang, Ahmet Erdem Sariyuce +1
We consider space-efficient single-pass estimation of the number of butterflies, a fundamental bipartite graph motif, from a massive bipartite graph stream where each edge represen…
cs.DS2017
Streaming k-Means Clustering with Fast Queries
Yu Zhang, Kanat Tangwongsan, Srikanta Tirthapura
We present methods for k-means clustering on a stream with a focus on providing fast responses to clustering queries. Compared to the current state-of-the-art, our methods provide…