27 citations · 44 across the 4 of their papers we have counts for
Showing cs.DBShow all
2 papers · 1 filter
cs.DB2012★ 15 cited
Scalable K-Means++
Bahman Bahmani, Benjamin Moseley, Andrea Vattani +2
Over half a century old and showing no signs of aging, k-means remains one of the most popular data processing algorithms. As is well-known, a proper initialization of k-means is c…
cs.DB2012
Densest Subgraph in Streaming and MapReduce
Bahman Bahmani, Ravi Kumar, Sergei Vassilvitskii
The problem of finding locally dense components of a graph is an important primitive in data analysis, with wide-ranging applications from community mining to spam detection and th…