Nilesh Dalvi
Research Subjects
Nilesh Dalvi has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Minos Garofalakis
Technical University of Crete
2 shared publications Ashwin Machanavajjhala
Yahoo! Research 4301 Great America Parkway Santa Clara 95054 CA
1 shared publication- Bo Pang
Yahoo! Research 4301 Great America Parkway Santa Clara 95054 CA
1 shared publication Mohamed Soliman
1 shared publication- Ravi Kumar1 shared publication
Vibhor Rastogi
Yahoo! Research
1 shared publication
Latest Publications
- 7 December 2018
- Published by Springer Nature
- p. 4328-4334
Uncertainty Management in Scientific Database Systems
- 7 December 2018
- Published by Springer Nature
- p. 4328-4334
Uncertainty Management in Scientific Database Systems
- 1 January 2016
- Published by Springer Nature
- p. 1-7
Uncertainty Management in Scientific Database Systems
- 1 January 2016
- Published by Springer Nature
- p. 1-7
Uncertainty Management in Scientific Database Systems
- Open Access
An Analysis of Structured Data on the Web
In this paper, we analyze the nature and distribution of structured data on the Web. Web-scale information extraction, or the problem of creating structured tables using extraction from the entire web, is gathering lots of research interest. We perform a study to understand and quantify the value of Web-scale extraction, and how structured information is distributed amongst top aggregator websites and tail sites for various interesting domains. We believe this is the first study of its kind, and gives us new insights for information extraction over the Web.
Open AccessAn Analysis of Structured Data on the Web
In this paper, we analyze the nature and distribution of structured data on the Web. Web-scale information extraction, or the problem of creating structured tables using extraction from the entire web, is gathering lots of research interest. We perform a study to understand and quantify the value of Web-scale extraction, and how structured information is distributed amongst top aggregator websites and tail sites for various interesting domains. We believe this is the first study of its kind, and gives us new insights for information extraction over the Web.
- Open Access
Large-Scale Collective Entity Matching
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 applied in practical settings on large real-life datasets. Towards this end, we propose a principled framework to scale any generic EM algorithm. Our technique consists of running multiple instances of the EM algorithm on small neighborhoods of the data and passing messages across neighborhoods to construct a global solution. We prove formal properties of our framework and experimentally demonstrate the effectiveness of our approach in scaling EM algorithms.
Open AccessLarge-Scale Collective Entity Matching
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 applied in practical settings on large real-life datasets. Towards this end, we propose a principled framework to scale any generic EM algorithm. Our technique consists of running multiple instances of the EM algorithm on small neighborhoods of the data and passing messages across neighborhoods to construct a global solution. We prove formal properties of our framework and experimentally demonstrate the effectiveness of our approach in scaling EM algorithms.
- Open Access
Automatic Wrappers for Large Scale Web Extraction
We present a generic framework to make wrapper induction algorithms tolerant to noise in the training data. This enables us to learn wrappers in a completely unsupervised manner from automatically and cheaply obtained noisy training data, e.g., using dictionaries and regular expressions. By removing the site-level supervision that wrapper-based techniques require, we are able to perform information extraction at web-scale, with accuracy unattained with existing unsupervised extraction techniques. Our system is used in production at Yahoo! and powers live applications.
Open AccessAutomatic Wrappers for Large Scale Web Extraction
We present a generic framework to make wrapper induction algorithms tolerant to noise in the training data. This enables us to learn wrappers in a completely unsupervised manner from automatically and cheaply obtained noisy training data, e.g., using dictionaries and regular expressions. By removing the site-level supervision that wrapper-based techniques require, we are able to perform information extraction at web-scale, with accuracy unattained with existing unsupervised extraction techniques. Our system is used in production at Yahoo! and powers live applications.
- Open Access
- 1 January 2011
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 4 (4) , 208-218
Large-scale collective entity matching
- 1 January 2011
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 4 (4) , 208-218
Open AccessLarge-scale collective entity matching
- 17 December 2008
- Published by Springer Nature in Theory of Computing Systems
- Vol. 44 (4) , 503-532
Query Evaluation on a Database Given by a Random Graph
- 17 December 2008
- Published by Springer Nature in Theory of Computing Systems
- Vol. 44 (4) , 503-532
Query Evaluation on a Database Given by a Random Graph