27 citations · 44 across the 4 of their papers we have counts for
4 papers
Efficient Distributed Locality Sensitive Hashing
Bahman Bahmani, Ashish Goel, Rajendra Shinde
Distributed frameworks are gaining increasingly widespread use in applications that process large amounts of data. One important example application is large scale similarity searc…
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…
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…
Fast Incremental and Personalized PageRank
Bahman Bahmani, Abdur Chowdhury, Ashish Goel
In this paper, we analyze the efficiency of Monte Carlo methods for incremental computation of PageRank, personalized PageRank, and similar random walk based methods (with focus on…