Fetching the paper…
Reading the bibliography…
Data collection is a major bottleneck in machine learning and an active research topic in multiple communities.
N. Salehi, J. Teevan, S. T. Iqbal, and E. Kamar, “Communicating context to the crowd for complex writing tasks,” in CSCW , 2017, pp. 1890–1901
1901
Earlier work this paper cites.
D. R. Karger, S. Oh, and D. Shah, “Iterative learning for reliable crowdsourcing systems,” in NIPS , 2011, pp. 1953–1961
1961
Earlier work this paper cites.
H. S. Seung, M. Opper, and H. Sompolinsky, “Query by committee,” in COLT , 1992, pp. 287–294
1992
Earlier work this paper cites.
D. D. Lewis and W. A. Gale, “A sequential algorithm for training text classifiers,” in SIGIR , 1994, pp. 3–12
1994
Earlier work this paper cites.
D. Yarowsky, “Unsupervised word sense disambiguation rivaling supervised methods,” in ACL , 1995, pp. 189–196
1995
Earlier work this paper cites.
A. Blum and T. Mitchell, “Combining labeled and unlabeled data with co-training,” in COLT , 1998, pp. 92–100
1998
Earlier work this paper cites.
N. Abe and H. Mamitsuka, “Query learning strategies using boosting and bagging,” in ICML , 1998, pp. 1–9
1998
Earlier work this paper cites.
A. McCallum and K. Nigam, “Employing em and pool-based active learning for text classification,” in ICML , 1998, pp. 350–358
1998
Earlier work this paper cites.
N. Roy and A. McCallum, “Toward optimal active learning through sampling estimation of error reduction,” in ICML , 2001, pp. 441–448
2001
Earlier work this paper cites.
V. Crescenzi, G. Mecca, and P. Merialdo, “Roadrunner: Towards automatic data extraction from large web sites,” in VLDB , 2001, pp. 109–118
2001
Earlier work this paper cites.
V. Raman and J. M. Hellerstein, “Potter’s wheel: An interactive data cleaning system,” in VLDB , 2001, pp. 381–390
2001
Earlier work this paper cites.
N. V. Chawla, K. W. Bowyer, L. O. Hall, and W. P. Kegelmeyer, “Smote: Synthetic minority over-sampling technique,” J. Artif. Int. Res. , vol. 16, no. 1, pp. 321–357, Jun. 2002
2002
Earlier work this paper cites.
D. M. Blei, A. Y. Ng, and M. I. Jordan, “Latent dirichlet allocation,” Journal of Machine Learning Research , vol. 3, pp. 993–1022, 2003
2003
Earlier work this paper cites.
X. Zhu, Z. Ghahramani, and J. Lafferty, “Semi-supervised learning using gaussian fields and harmonic functions,” in ICML , 2003, pp. 912–919
2003
Earlier work this paper cites.
X. Zhu, J. Lafferty, and Z. Ghahramani, “Combining active learning and semi-supervised learning using gaussian fields and harmonic functions,” in ICML 2003 workshop on The Continuum from Labeled to Unlabeled Data in Machine Learning and Data Mining , 2003, pp. 58–65
2003
Earlier work this paper cites.
Y. Zhou and S. A. Goldman, “Democratic co-learning,” in IEEE ICTAI , 2004, pp. 594–602
2004
Earlier work this paper cites.
Z.-H. Zhou, K.-J. Chen, and Y. Jiang, “Exploiting unlabeled data in content-based image retrieval,” in ECML , 2004, pp. 525–536
2004
Earlier work this paper cites.
O. Etzioni, M. J. Cafarella, D. Downey, S. Kok, A. Popescu, T. Shaked, S. Soderland, D. S. Weld, and A. Yates, “Web-scale information extraction in knowitall: (preliminary results),” in WWW , 2004, pp. 100–110
2004
Earlier work this paper cites.
Z.-H. Zhou and M. Li, “Tri-training: Exploiting unlabeled data using three classifiers,” IEEE TKDE , vol. 17, no. 11, pp. 1529–1541, Nov. 2005
2005
Earlier work this paper cites.
V. Sindhwani and P. Niyogi, “A co-regularized approach to semi-supervised learning with multiple views,” in Proceedings of the ICML Workshop on Learning with Multiple Views , 2005
2005
Earlier work this paper cites.
Z.-H. Zhou and M. Li, “Semi-supervised regression with co-training,” in IJCAI , 2005, pp. 908–913
2005
Earlier work this paper cites.
U. Brefeld, T. Gärtner, T. Scheffer, and S. Wrobel, “Efficient co-regularised least squares regression,” in ICML , 2006, pp. 137–144
2006
Earlier work this paper cites.
F. Li, R. Fergus, and P. Perona, “One-shot learning of object categories,” IEEE Trans. Pattern Anal. Mach. Intell. , vol. 28, no. 4, pp. 594–611, 2006
2006
Earlier work this paper cites.
B. Settles, M. Craven, and S. Ray, “Multiple-instance active learning,” in NIPS , 2007, pp. 1289–1296
2007
Earlier work this paper cites.
R. Burbidge, J. J. Rowland, and R. D. King, “Active learning for regression based on query by committee,” in IDEAL , 2007, pp. 209–218
2007
Earlier work this paper cites.
F. M. Suchanek, G. Kasneci, and G. Weikum, “Yago: A core of semantic knowledge,” in WWW , 2007, pp. 697–706
2007
Earlier work this paper cites.
M. J. Cafarella, A. Halevy, D. Z. Wang, E. Wu, and Y. Zhang, “Webtables: Exploring the power of tables on the web,” PVLDB , vol. 1, no. 1, pp. 538–549, 2008
2008
Earlier work this paper cites.
B. Settles and M. Craven, “An analysis of active learning strategies for sequence labeling tasks,” in EMNLP , 2008, pp. 1070–1079
2008
Earlier work this paper cites.
V. S. Sheng, F. Provost, and P. G. Ipeirotis, “Get another label? improving data quality and data mining using multiple, noisy labelers,” in KDD , 2008, pp. 614–622
2008
Earlier work this paper cites.
K. Bollacker, C. Evans, P. Paritosh, T. Sturge, and J. Taylor, “Freebase: A collaboratively created graph database for structuring human knowledge,” in SIGMOD , 2008, pp. 1247–1250
2008
Earlier work this paper cites.
M. J. Cafarella, A. Halevy, and N. Khoussainova, “Data integration for the relational web,” PVLDB , vol. 2, no. 1, pp. 1090–1101, Aug. 2009
2009
Earlier work this paper cites.
S. Chaudhuri and G. Das, “Keyword querying and ranking in databases,” PVLDB , vol. 2, no. 2, pp. 1658–1659, 2009
2009
Earlier work this paper cites.
K. Tomanek and U. Hahn, “Semi-supervised active learning for sequence labeling,” in ACL , 2009, pp. 1039–1047
2009
Earlier work this paper cites.
O. Dekel and O. Shamir, “Vox populi: Collecting high-quality labels from a crowd,” in COLT , 2009
2009
Earlier work this paper cites.
J. Deng, W. Dong, R. Socher, L. Li, K. Li, and F. Li, “Imagenet: A large-scale hierarchical image database,” in CVPR , 2009, pp. 248–255
2009
Earlier work this paper cites.
M. Mintz, S. Bills, R. Snow, and D. Jurafsky, “Distant supervision for relation extraction without labeled data,” in ACL , 2009, pp. 1003–1011
2009
Earlier work this paper cites.
H. He and E. A. Garcia, “Learning from imbalanced data,” IEEE TKDE , vol. 21, no. 9, pp. 1263–1284, Sep. 2009
2009
Earlier work this paper cites.
H. Gonzalez, A. Y. Halevy, C. S. Jensen, A. Langen, J. Madhavan, R. Shapley, and W. Shen, “Google fusion tables: data management, integration and collaboration in the cloud,” in SoCC , 2010, pp. 175–180
2010
Earlier work this paper cites.
H. Gonzalez, A. Y. Halevy, C. S. Jensen, A. Langen, J. Madhavan, R. Shapley, W. Shen, and J. Goldberg-Kidon, “Google fusion tables: web-centered data management and collaboration,” in SIGMOD , 2010, pp. 1061–1066
2010
Earlier work this paper cites.
G. Little, L. B. Chilton, M. Goldman, and R. C. Miller, “Turkit: Human computation algorithms on mechanical turk,” in UIST , 2010, pp. 57–66
2010
Earlier work this paper cites.
S. Kim, G. Choe, B. Ahn, and I. Kweon, “Deep representation of industrial components using simulated images,” in ICRA , 2017, pp. 2003–2010
2010
Earlier work this paper cites.
J. X. Yu, L. Qin, and L. Chang, “Keyword search in relational databases: A survey,” IEEE Data Eng. Bull. , vol. 33, no. 1, pp. 67–78, 2010
2010
Earlier work this paper cites.
A. Carlson, J. Betteridge, B. Kisiel, B. Settles, E. R. H. Jr., and T. M. Mitchell, “Toward an architecture for never-ending language learning,” in AAAI , 2010
2010
Earlier work this paper cites.
S. J. Pan and Q. Yang, “A survey on transfer learning,” IEEE TKDE , vol. 22, no. 10, pp. 1345–1359, Oct. 2010
2010
Earlier work this paper cites.
H. Elmeleegy, J. Madhavan, and A. Halevy, “Harvesting relational tables from lists on the web,” The VLDB Journal , vol. 20, no. 2, pp. 209–226, Apr. 2011
2011
Earlier work this paper cites.
N. N. Dalvi, R. Kumar, and M. A. Soliman, “Automatic wrappers for large scale web extraction,” PVLDB , vol. 4, no. 4, pp. 219–230, 2011
2011
Earlier work this paper cites.
S. Ahmad, A. Battle, Z. Malkani, and S. Kamvar, “The jabberwocky programming environment for structured social computing,” in UIST , 2011, pp. 53–64
2011
Earlier work this paper cites.
M. J. Franklin, D. Kossmann, T. Kraska, S. Ramesh, and R. Xin, “Crowddb: Answering queries with crowdsourcing,” in SIGMOD , 2011, pp. 61–72
2011
Earlier work this paper cites.
A. Marcus, E. Wu, S. Madden, and R. C. Miller, “Crowdsourced databases: Query processing with people,” in CIDR , 2011, pp. 211–214
2011
Earlier work this paper cites.
F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B. Thirion, O. Grisel, M. Blondel, P. Prettenhofer, R. Weiss, V. Dubourg, J. Vanderplas, A. Passos, D. Cournapeau, M. Brucher, M. Perrot, and E. Duchesnay, “Scikit-learn: Machine learning in python,” J. Mach. Learn. Res. , vol. 12, pp. 2825–2830, Nov. 2011
2011
Earlier work this paper cites.
S. Kandel, A. Paepcke, J. M. Hellerstein, and J. Heer, “Wrangler: interactive visual specification of data transformation scripts,” in CHI , 2011, pp. 3363–3372
2011
Earlier work this paper cites.
W. R. Harris and S. Gulwani, “Spreadsheet table transformations from examples,” in PLDI , 2011, pp. 317–328
2011
Earlier work this paper cites.
M. Yakout, K. Ganjam, K. Chakrabarti, and S. Chaudhuri, “Infogather: Entity augmentation and attribute discovery by holistic matching with web tables,” in SIGMOD , 2012, pp. 97–108
2012
Earlier work this paper cites.
P. Bohannon, N. N. Dalvi, Y. Filmus, N. Jacoby, S. S. Keerthi, and A. Kirpal, “Automatic web-scale information extraction,” in SIGMOD , 2012, pp. 609–612
2012
Earlier work this paper cites.
A. Doan, A. Y. Halevy, and Z. G. Ives, Principles of Data Integration . Morgan Kaufmann, 2012
2012
Earlier work this paper cites.
D. W. Barowy, C. Curtsinger, E. D. Berger, and A. McGregor, “Automan: A platform for integrating human-based and digital computation,” in OOPSLA , 2012, pp. 639–654
2012
Earlier work this paper cites.
H. Park, R. Pang, A. G. Parameswaran, H. Garcia-Molina, N. Polyzotis, and J. Widom, “Deco: A system for declarative crowdsourcing,” PVLDB , vol. 5, no. 12, pp. 1990–1993, 2012
2012
Earlier work this paper cites.
R. Boim, O. Greenshpan, T. Milo, S. Novgorodov, N. Polyzotis, and W. C. Tan, “Asking the right questions in crowd data sourcing,” in ICDE , 2012, pp. 1261–1264
2012
Earlier work this paper cites.
B. Settles, Active Learning , ser. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool Publishers, 2012
2012
Cited alongside, same era.
J. Wang, T. Kraska, M. J. Franklin, and J. Feng, “Crowder: Crowdsourcing entity resolution,” PVLDB , vol. 5, no. 11, pp. 1483–1494, 2012
2012
Cited alongside, same era.
A. G. Parameswaran, H. Garcia-Molina, H. Park, N. Polyzotis, A. Ramesh, and J. Widom, “Crowdscreen: algorithms for filtering data with humans,” in SIGMOD , 2012, pp. 361–372
2012
Cited alongside, same era.
A. Marcus, D. R. Karger, S. Madden, R. Miller, and S. Oh, “Counting with the crowd,” PVLDB , vol. 6, no. 2, pp. 109–120, 2012
2012
Cited alongside, same era.
Mausam, M. Schmitz, R. Bart, S. Soderland, and O. Etzioni, “Open language learning for information extraction,” in EMNLP-CoNLL , 2012, pp. 523–534
2012
G. Li, J. Wang, Y. Zheng, and M. J. Franklin, “Crowdsourced data management: A survey,” IEEE TKDE , vol. 28, no. 9, pp. 2296–2319, Sept 2016
2016
Later among the works it cites.
H. Garcia-Molina, M. Joglekar, A. Marcus, A. Parameswaran, and V. Verroios, “Challenges in data crowdsourcing,” IEEE TKDE , vol. 28, no. 4, pp. 901–911, Apr. 2016
2016
Later among the works it cites.
N. Patki, R. Wedge, and K. Veeramachaneni, “The synthetic data vault,” in DSAA , 2016, pp. 399–410
2016
Later among the works it cites.
S. Ravi and Q. Diao, “Large scale distributed semi-supervised learning using streaming approximation,” in AISTATS , 2016, pp. 519–528
2016
Later among the works it cites.
H. R. Ehrenberg, J. Shin, A. J. Ratner, J. A. Fries, and C. Ré, “Data programming with ddlite: putting humans in a different part of the loop,” in HILDA@SIGMOD , 2016, p. 13
2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
S. Kandel, R. Parikh, A. Paepcke, J. M. Hellerstein, and J. Heer, “Profiler: integrated statistical analysis and visualization for data quality assessment,” in AVI , 2012, pp. 547–554
2012
Cited alongside, same era.
A. Krizhevsky, I. Sutskever, and G. E. Hinton, “Imagenet classification with deep convolutional neural networks,” in NIPS , 2012, pp. 1106–1114
2012
Cited alongside, same era.
A. Y. Halevy, “Data publishing and sharing using fusion tables,” in CIDR , 2013
2013
Cited alongside, same era.
T. Mikolov, I. Sutskever, K. Chen, G. S. Corrado, and J. Dean, “Distributed representations of words and phrases and their compositionality,” in NIPS , 2013, pp. 3111–3119
2013
Cited alongside, same era.
M. J. Franklin, B. Trushkowsky, P. Sarkar, and T. Kraska, “Crowdsourced enumeration queries,” in ICDE , 2013, pp. 673–684
2013
Cited alongside, same era.
M. Stonebraker, D. Bruckner, I. F. Ilyas, G. Beskales, M. Cherniack, S. B. Zdonik, A. Pagan, and S. Xu, “Data curation at scale: The data tamer system,” in CIDR , 2013
2013
Cited alongside, same era.
M. Allahbakhsh, B. Benatallah, A. Ignjatovic, H. R. Motahari-Nezhad, E. Bertino, and S. Dustdar, “Quality control in crowdsourcing systems: Issues and directions,” IEEE Internet Computing , vol. 17, no. 2, pp. 76–81, March 2013
2013
Cited alongside, same era.
Later among the works it cites.
A. J. Ratner, C. D. Sa, S. Wu, D. Selsam, and C. Ré, “Data programming: Creating large training sets, quickly,” in NIPS , 2016, pp. 3567–3575
2016
Later among the works it cites.
H. R. Ehrenberg, J. Shin, A. J. Ratner, J. A. Fries, and C. Ré, “Data programming with ddlite: Putting humans in a different part of the loop,” in HILDA@SIGMOD , 2016, pp. 13:1–13:6
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,” PVLDB , vol. 9, no. 12, pp. 948–959, 2016
2016
Later among the works it cites.
K. R. Weiss, T. M. Khoshgoftaar, and D. Wang, “A survey of transfer learning,” J. Big Data , vol. 3, p. 9, 2016
2016
Later among the works it cites.
M. T. Ribeiro, S. Singh, and C. Guestrin, “”why should i trust you?”: Explaining the predictions of any classifier,” in KDD , 2016, pp. 1135–1144
2016
Later among the works it cites.
S. H. Bach, B. D. He, A. Ratner, and C. Ré, “Learning the structure of generative models without labeled data,” in ICML , 2017, pp. 273–282
2017
Later among the works it cites.
——, “Data management challenges in production machine learning,” in SIGMOD , 2017, pp. 1723–1726
2017
Later among the works it cites.
R. Castro Fernandez, D. Deng, E. Mansour, A. A. Qahtan, W. Tao, Z. Abedjan, A. Elmagarmid, I. F. Ilyas, S. Madden, M. Ouzzani, M. Stonebraker, and N. Tang, “A demo of the data civilizer system,” in SIGMOD , 2017, pp. 1639–1642
2017
Later among the works it cites.
D. Deng, R. C. Fernandez, Z. Abedjan, S. Wang, M. Stonebraker, A. K. Elmagarmid, I. F. Ilyas, S. Madden, M. Ouzzani, and N. Tang, “The data civilizer system,” in CIDR , 2017
2017
Later among the works it cites.
V. Shah, A. Kumar, and X. Zhu, “Are key-foreign key joins safe to avoid when learning high-capacity classifiers?” PVLDB , vol. 11, no. 3, pp. 366–379, Nov. 2017
2017
Later among the works it cites.
L. Chen, A. Kumar, J. F. Naughton, and J. M. Patel, “Towards linear algebra over normalized data,” PVLDB , vol. 10, no. 11, pp. 1214–1225, 2017
2017
Later among the works it cites.
E. Choi, S. Biswal, B. Malin, J. Duke, W. F. Stewart, and J. Sun, “Generating multi-label discrete patient records using generative adversarial networks,” in MLHC , 2017, pp. 286–305
2017
Later among the works it cites.
2017
Later among the works it cites.
A. J. Ratner, H. R. Ehrenberg, Z. Hussain, J. Dunnmon, and C. Ré, “Learning to compose domain-specific transformations for data augmentation,” in NIPS , 2017, pp. 3239–3249
2017
Later among the works it cites.
J. Mallinson, R. Sennrich, and M. Lapata, “Paraphrasing revisited with neural machine translation,” in EACL . Association for Computational Linguistics, 2017, pp. 881–893
2017
Later among the works it cites.
J. Kim, S. Sterman, A. A. B. Cohen, and M. S. Bernstein, “Mechanical novel: Crowdsourcing complex work through reflection and revision,” in CSCW , 2017, pp. 233–245
2017
Later among the works it cites.
J. C. Chang, S. Amershi, and E. Kamar, “Revolt: Collaborative crowdsourcing for labeling machine learning datasets,” in CHI , 2017, pp. 2334–2346
2017
Later among the works it cites.
A. Ratner, S. H. Bach, H. Ehrenberg, J. Fries, S. Wu, and C. Ré, “Snorkel: Rapid training data creation with weak supervision,” PVLDB , vol. 11, no. 3, pp. 269–282, Nov. 2017
2017
Later among the works it cites.
D. Dheeru and E. Karra Taniskidou, “UCI machine learning repository,” 2017
2017
Later among the works it cites.
Z.-H. Zhou, “A brief introduction to weakly supervised learning,” National Science Review , vol. 5, 08 2017
2017
Later among the works it cites.
A. J. Ratner, S. H. Bach, H. R. Ehrenberg, and C. Ré, “Snorkel: Fast training set generation for information extraction,” in SIGMOD , 2017, pp. 1683–1686
2017
Later among the works it cites.
T. Rekatsinas, X. Chu, I. F. Ilyas, and C. Ré, “Holoclean: Holistic data repairs with probabilistic inference,” PVLDB , vol. 10, no. 11, pp. 1190–1201, 2017
2017
Later among the works it cites.
2017
Later among the works it cites.
O. Day and T. M. Khoshgoftaar, “A survey on heterogeneous transfer learning,” J. Big Data , vol. 4, p. 29, 2017
2017
Later among the works it cites.
D. Baylor, E. Breck, H. Cheng, N. Fiedel, C. Y. Foo, Z. Haque, S. Haykal, M. Ispir, V. Jain, L. Koc, C. Y. Koo, L. Lew, C. Mewald, A. N. Modi, N. Polyzotis, S. Ramesh, S. Roy, S. E. Whang, M. Wicke, J. Wilkiewicz, X. Zhang, and M. Zinkevich, “TFX: A tensorflow-based production-scale machine learning platform,” in KDD , 2017, pp. 1387–1395
2017
Later among the works it cites.
N. Polyzotis, S. Roy, S. E. Whang, and M. Zinkevich, “Data lifecycle challenges in production machine learning: A survey,” SIGMOD Rec. , vol. 47, no. 2, pp. 17–28, Jun. 2018
2018
Closest in time.
Y. Gao, S. Huang, and A. G. Parameswaran, “Navigating the data lake with DATAMARAN: automatically extracting structure from log datasets,” in SIGMOD , 2018, pp. 943–958
2018
Closest in time.
M. J. Cafarella, A. Y. Halevy, H. Lee, J. Madhavan, C. Yu, D. Z. Wang, and E. Wu, “Ten years of webtables,” PVLDB , vol. 11, no. 12, pp. 2140–2149, 2018
2018
Closest in time.
R. Baumgartner, W. Gatterbauer, and G. Gottlob, “Web data extraction system,” in Encyclopedia of Database Systems, Second Edition , 2018
2018
Closest in time.
M. Stonebraker and I. F. Ilyas, “Data integration: The current status and the way forward,” IEEE Data Eng. Bull. , vol. 41, no. 2, pp. 3–9, 2018
2018
Closest in time.
N. Park, M. Mohammadi, K. Gorde, S. Jajodia, H. Park, and Y. Kim, “Data synthesis based on generative adversarial networks,” PVLDB , vol. 11, no. 10, pp. 1071–1083, 2018
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
M. T. Ribeiro, S. Singh, and C. Guestrin, “Semantically equivalent adversarial rules for debugging nlp models,” in ACL , 2018
2018
Closest in time.
R. C. Fernandez, Z. Abedjan, F. Koko, G. Yuan, S. Madden, and M. Stonebraker, “Aurum: A data discovery system,” in ICDE , 2018, pp. 1001–1012
2018
Closest in time.
R. C. Fernandez, E. Mansour, A. A. Qahtan, A. K. Elmagarmid, I. F. Ilyas, S. Madden, M. Ouzzani, M. Stonebraker, and N. Tang, “Seeping semantics: Linking datasets using word embeddings for data discovery,” in ICDE , 2018, pp. 989–1000
2018
Closest in time.
F. Daniel, P. Kucherbaev, C. Cappiello, B. Benatallah, and M. Allahbakhsh, “Quality control in crowdsourcing: A survey of quality attributes, assessment techniques, and assurance actions,” ACM Comput. Surv. , vol. 51, no. 1, pp. 7:1–7:40, Jan. 2018
2018
Closest in time.
A. Ratner, B. Hancock, J. Dunnmon, R. Goldman, and C. Ré, “Snorkel metal: Weak supervision for multi-task learning,” in DEEM@SIGMOD , 2018, pp. 3:1–3:4
2018
Closest in time.
M. Schaekermann, J. Goh, K. Larson, and E. Law, “Resolvable vs. irresolvable disagreement: A study on worker deliberation in crowd work,” PACMHCI , vol. 2, no. CSCW, pp. 154:1–154:19, 2018
2018
Closest in time.
M. Dolatshah, M. Teoh, J. Wang, and J. Pei, “Cleaning Crowdsourced Labels Using Oracles For Statistical Classification,” School of Computer Science, Simon Fraser University, Tech. Rep., 2018
2018
Closest in time.
C. Tan, F. Sun, T. Kong, W. Zhang, C. Yang, and C. Liu, “A survey on deep transfer learning,” in ICANN , 2018, pp. 270–279
2018
Closest in time.
——, “Anchors: High-precision model-agnostic explanations,” in AAAI , 2018
2018
Closest in time.
E. Krasanakis, E. Spyromitros-Xioufis, S. Papadopoulos, and Y. Kompatsiaris, “Adaptive sensitive reweighting to mitigate bias in fairness-aware classification,” in WWW , 2018, pp. 853–862
2018
Closest in time.
S. Li, L. Chen, and A. Kumar, “Enabling and optimizing non-linear feature interactions in factorized linear algebra,” in SIGMOD , 2019, pp. 1571–1588
2019
Closest in time.
S. H. Bach, D. Rodriguez, Y. Liu, C. Luo, H. Shao, C. Xia, S. Sen, A. Ratner, B. Hancock, H. Alborzi, R. Kuchhal, C. Ré, and R. Malkin, “Snorkel drybell: A case study in deploying weak supervision at industrial scale,” in SIGMOD , 2019, pp. 362–375
2019
Closest in time.
E. Bringer, A. Israeli, Y. Shoham, A. Ratner, and C. Ré, “Osprey: Weak supervision of imbalanced extraction problems without code,” in DEEM@SIGMOD , 2019, pp. 4:1–4:11
2019
Closest in time.
A. J. Ratner, B. Hancock, and C. Ré, “The role of massively multi-task and weak supervision in software 2.0,” in CIDR , 2019
2019
Closest in time.
K. H. Tae, Y. Roh, Y. H. Oh, H. Kim, and S. E. Whang, “Data cleaning for accurate, fair, and robust models: A big data - AI integration approach,” in DEEM@SIGMOD , 2019
2019
Closest in time.
S. Ruder, M. E. Peters, S. Swayamdipta, and T. Wolf, “Transfer learning in natural language processing,” in NAACL-HLT , 2019, pp. 15–18
2019
Closest in time.