13 citations · 26 across the 5 of their papers we have counts for
5 papers
Finding Connected Components on Map-reduce in Logarithmic Rounds
Vibhor Rastogi, Ashwin Machanavajjhala, Laukik Chitnis +1
Given a large graph G = (V,E) with millions of nodes and edges, how do we compute its connected components efficiently? Recent work addresses this problem in map-reduce, where a fu…
Large-Scale Collective Entity Matching
Vibhor Rastogi, Nilesh Dalvi, Minos Garofalakis
There have been several recent advancements in Machine Learning community on the Entity Matching (EM) problem. However, their lack of scalability has prevented them from being appl…
Optimizing Histogram Queries under Differential Privacy
Chao Li, Michael Hay, Vibhor Rastogi +2
Differential privacy is a robust privacy standard that has been successfully applied to a range of data analysis tasks. Despite much recent work, optimal strategies for answering a…
Boosting the Accuracy of Differentially-Private Histograms Through Consistency
Michael Hay, Vibhor Rastogi, Gerome Miklau +1
We show that it is possible to significantly improve the accuracy of a general class of histogram queries while satisfying differential privacy. Our approach carefully chooses a se…
The Boundary Between Privacy and Utility in Data Anonymization
Vibhor Rastogi, Dan Suciu, Sungho Hong
We consider the privacy problem in data publishing: given a relation I containing sensitive information 'anonymize' it to obtain a view V such that, on one hand attackers cannot le…