CoChat

SLiMFast: Guaranteed Results for Data Fusion and Source Reliability

Open access
Rekatsinas, Theodoros, Joglekar, Manas, Garcia-Molina, Hector, Parameswaran, Aditya, Ré, Christopher · 2017 · Proceedings of the 2017 ACM International Conference on Management of Data
Cited by 60

The DOI matches its Crossref record.

Abstract

We focus on data fusion, i.e., the problem of unifying conflicting data from data sources into a single representation by estimating the source accuracies. We propose SLiMFast, a framework that expresses data fusion as a statistical learning problem over discriminative probabilistic models, which in many cases correspond to logistic regression. In contrast to previous approaches that use complex generative models, discriminative models make fewer distributional assumptions over data sources and allow us to obtain rigorous theoretical guarantees. Furthermore, we show how SLiMFast enables incorporating domain knowledge into data fusion, yielding accuracy improvements of up to 50% over state-of-the-art baselines. Building upon our theoretical results, we design an optimizer that obviates the need for users to manually select an algorithm for learning SLiMFast's parameters. We validate our optimizer on multiple real-world datasets and show that it can accurately predict the learning algorithm that yields the best data fusion results.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/3035918.3035951

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

No references could be resolved yet.

Research works printed but not linked: 39

  1. 10.14778/2856318.2856328 · DOI
  2. 10.1561/2200000015 · DOI · Paper page
  3. S. H. Bach , M. Broecheler , B. Huang , and L. Getoor . Hinge-loss markov random fields and probabilistic soft logic. CoRR, abs/1505.04406 , 2015 . S. H. Bach, M. Broecheler, B. Huang, and L. Getoor. Hinge-loss markov random fields and probabilistic soft logic. CoRR, abs/1505.04406, 2015. · arXiv
  4. 10.1145/1456650.1456651 · DOI · Paper page
  5. 10.1109/TIT.2010.2044061 · DOI · Paper page
  6. 10.1145/2488388.2488414 · DOI · Paper page
  7. 10.14778/1687627.1687690 · DOI · Paper page
  8. 10.14778/2732951.2732962 · DOI · Paper page
  9. 10.14778/2777598.2777603 · DOI · Paper page
  10. 10.14778/2535568.2448938 · DOI
  11. 10.1007/978-3-031-01853-4 · DOI · Paper page
  12. 10.1145/1718487.1718504 · DOI · Paper page
  13. 10.1145/2487575.2487595 · DOI
  14. 10.1109/ICDE.2015.7113284 · DOI
  15. 10.1162/neco.1994.6.2.181 · DOI · Paper page
  16. D. Karger , S. Oh , and D. Shah . Iterative learning for reliable crowd sourcing systems . In NIPS , pages 1953 -- 1961 . 2011 . D. Karger, S. Oh, and D. Shah. Iterative learning for reliable crowd sourcing systems. In NIPS, pages 1953--1961. 2011.
  17. K. Leetaru and P. Schrodt . GDELT: Global Database of Events, Language, and Tone . In ISA Annual Convention , 2013 . K. Leetaru and P. Schrodt. GDELT: Global Database of Events, Language, and Tone. In ISA Annual Convention, 2013.
  18. 10.14778/2735496.2735505 · DOI · Paper page
  19. 10.1145/2588555.2610509 · DOI · Paper page
  20. 10.14778/2535568.2448943 · DOI · Paper page
  21. 10.1145/2897350.2897352 · DOI · Paper page
  22. 10.5555/541177 · doi:10.5555/541177
  23. A. Y. Ng and M. I. Jordan . On discriminative vs. generative classifiers: A comparison of logistic regression and naive bayes . In NIPS , pages 841 -- 848 . MIT Press , 2002 . A. Y. Ng and M. I. Jordan. On discriminative vs. generative classifiers: A comparison of logistic regression and naive bayes. In NIPS, pages 841--848. MIT Press, 2002.
  24. J. Pasternack and D. Roth . Knowing what to believe (when you already know something) . In COLING , pages 877 -- 885 , 2010 . J. Pasternack and D. Roth. Knowing what to believe (when you already know something). In COLING, pages 877--885, 2010.
  25. 10.1145/2488388.2488476 · DOI · Paper page
  26. A. B. Patel , T. Nguyen , and R. G. Baraniuk . A probabilistic theory of deep learning. arXiv preprint arXiv:1504.00641 , 2015 . A. B. Patel, T. Nguyen, and R. G. Baraniuk. A probabilistic theory of deep learning. arXiv preprint arXiv:1504.00641, 2015. · arXiv
  27. 10.1109/MIS.2015.74 · doi:10.1109/mis.2015.74
  28. 10.1145/2588555.2610504 · DOI
  29. 10.1137/1.9781611974010.43 · DOI
  30. C. D. Sa , C. Ré , and K. Olukotun . Global convergence of stochastic gradient descent for some non-convex matrix problems . In ICML , pages 2332 -- 2341 , 2015 . C. D. Sa, C. Ré, and K. Olukotun. Global convergence of stochastic gradient descent for some non-convex matrix problems. In ICML, pages 2332--2341, 2015.
  31. 10.14778/2809974.2809991 · DOI · Paper page
  32. R. Tibshirani . Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society , Series B , pages 267 -- 288 , 1994 . R. Tibshirani. Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society, Series B, pages 267--288, 1994.
  33. C. J. Wu . On the convergence properties of the EM algorithm. The Annals of statistics , pages 95 -- 103 , 1983 . C. J. Wu. On the convergence properties of the EM algorithm. The Annals of statistics, pages 95--103, 1983.
  34. 10.1145/1281192.1281309 · DOI · Paper page
  35. 10.1145/1963405.1963439 · DOI · Paper page
  36. 10.14778/2732977.2733001 · DOI
  37. Y. Zhang , X. Chen , D. Zhou , and M. I. Jordan . Spectral methods meet EM: A provably optimal algorithm for crowdsourcing . In NIPS , pages 1260 -- 1268 . 2014 . Y. Zhang, X. Chen, D. Zhou, and M. I. Jordan. Spectral methods meet EM: A provably optimal algorithm for crowdsourcing. In NIPS, pages 1260--1268. 2014.
  38. 10.14778/2168651.2168656 · DOI · Paper page
  39. 10.1145/2661829.2661892 · DOI · Paper page

Cited by

Metadata

Authors
Rekatsinas, T., Joglekar, M., Garcia-Molina, H., Parameswaran, A., & Ré, C.
Venue
Proceedings of the 2017 ACM International Conference on Management of Data
Publisher
ACM
Published
2017-05-09
Pages
1399-1414
OpenAlex
W2404544029
Cited by
60
References
0
FWCI
4.57
Type
conference paper
Language
en
Open access
gold
Funders
Defense Advanced Research Projects Agency (N66001-15- C-4043)

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.