Fetching the paper…
Reading the bibliography…
Machine learning (ML) applications have been thriving recently, largely attributed to the increasing availability of data.
1903
Earlier work this paper cites.
D. B. Rubin, “Inference and missing data,” Biometrika , vol. 63, no. 3, pp. 581–592, 1976
1976
Earlier work this paper cites.
S. Abiteboul, R. Hull, and V. Vianu, Foundations of Databases: The Logical Level , 1st ed. USA: Addison-Wesley Longman Publishing Co., Inc., 1995
1995
Earlier work this paper cites.
C. Wa Ko, J. Lee, and M. Queyranne, “An exact algorithm for maximum entropy sampling,” Oper. Res. , vol. 43, no. 4, pp. 684–691, 1995. [Online]. Available: https://doi.org/10.1287/opre.43.4.684
1995
Earlier work this paper cites.
C. E. Rasmussen, R. M. Neal, G. E. Hinton, D. van Camp, M. Revow, Z. Ghahramani, R. Kustra, and R. Tibshirani, “The delve manual,” URL http://www. cs. toronto. edu/ ˜ delve , 1996
1996
Earlier work this paper cites.
D. B. Rubin, “Multiple imputation after 18+ years,” Journal of the American Statistical Association , vol. 91, no. 434, pp. 473–489, 1996. [Online]. Available: http://www.jstor.org/stable/2291635
1996
Earlier work this paper cites.
M. Arenas, L. Bertossi, and J. Chomicki, “Consistent query answers in inconsistent databases,” in Proc. 18th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems , 1999, pp. 68–79
1999
Earlier work this paper cites.
H.-P. Kriegel, P. Kunath, and M. Renz, “Probabilistic nearest-neighbor query on uncertain objects,” in Proceedings of the 12th International Conference on Database Systems for Advanced Applications , ser. DASFAA’07. Berlin, Heidelberg: Springer-Verlag, 2007, p. 337–348
2007
Earlier work this paper cites.
A. Lopatenko and L. E. Bertossi, “Complexity of consistent query answering in databases under cardinality-based and incremental repair semantics,” in Proc. 11th Int. Conf. on Database Theory , 2007, pp. 179–193
2007
Cited alongside, same era.
P. J. García-Laencina, J.-L. Sancho-Gómez, and A. R. Figueiras-Vidal, “Pattern classification with missing data: A review,” Neural Comput. Appl. , vol. 19, no. 2, p. 263–282, Mar. 2010. [Online]. Available: https://doi.org/10.1007/s00521-009-0295-6
2010
Cited alongside, same era.
D. Suciu, D. Olteanu, C. Ré, and C. Koch, “Probabilistic databases,” Synthesis Lectures on Data Management , vol. 3, no. 2, pp. 1–180, 2011. [Online]. Available: https://doi.org/10.2200/S00362ED1V01Y201105DTM016
2011
Cited alongside, same era.
L. E. Bertossi, Database Repairing and Consistent Query Answering . Morgan & Claypool Publishers, 2011
2011
Cited alongside, same era.
X. Chu, J. Morcos, I. F. Ilyas, M. Ouzzani, P. Papotti, N. Tang, and Y. Ye, “KATARA: A data cleaning system powered by knowledge bases and crowdsourcing,” in Proc. ACM SIGMOD Int. Conf. on Management of Data , 2015, pp. 1247–1261
2015
Later among the works it cites.
P. K. Agarwal, B. Aronov, S. Har-Peled, J. M. Phillips, K. Yi, and W. Zhang, “Nearest-neighbor searching under uncertainty ii,” ACM Trans. Algorithms , vol. 13, no. 1, Oct. 2016. [Online]. Available: https://doi.org/10.1145/2955098
2016
Later among the works it cites.
S. Krishnan, J. Wang, E. Wu, M. J. Franklin, and K. Goldberg, “Activeclean: Interactive data cleaning for statistical modeling,” Proc. VLDB Endowment , vol. 9, no. 12, pp. 948–959, 2016
2016
Later among the works it cites.
S. Krishnan, J. Wang, E. Wu, M. J. Franklin, and K. Goldberg, “Activeclean: Interactive data cleaning for statistical modeling,” Proceedings of the VLDB Endowment , vol. 9, no. 12, pp. 948–959, 2016
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
P. K. Agarwal, A. Efrat, S. Sankararaman, and W. Zhang, “Nearest-neighbor searching under uncertainty,” in Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems , ser. PODS ’12. New York, NY, USA: Association for Computing Machinery, 2012, p. 225–236. [Online]. Available: https://doi.org/10.1145/2213556.2213588
2012
Cited alongside, same era.
J. S. Simonoff, Analyzing categorical data . Springer Science & Business Media, 2013
2013
Cited alongside, same era.
J. Wang, S. Krishnan, M. J. Franklin, K. Goldberg, T. Kraska, and T. Milo, “A sample-and-clean framework for fast and accurate query processing on dirty data,” in Proc. ACM SIGMOD Int. Conf. on Management of Data , 2014, pp. 469–480
2014
Cited alongside, same era.
Y. Chen, H. Hassani, S., A. Karbasi, and A. Krause, “Sequential information maximization: When is greedy near-optimal?” in Conference on Learning Theory , 2015
2015
Cited alongside, same era.
S. Das, A. Doan, P. S. G. C., C. Gokhale, P. Konda, Y. Govind, and D. Paulsen, “The magellan data repository,” https://sites.google.com/site/anhaidgroup/projects/data
Cited in the paper.
2017
Later among the works it cites.
2017
Later among the works it cites.
2019
Later among the works it cites.
I. F. Ilyas and X. Chu, Data Cleaning . ACM, 2019. [Online]. Available: https://doi.org/10.1145/3310205
2019
Later among the works it cites.