{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T18:17:57Z","timestamp":1774117077636,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T00:00:00Z","timestamp":1571961600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T00:00:00Z","timestamp":1571961600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["694980"],"award-info":[{"award-number":["694980"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1007\/s10994-019-05841-y","type":"journal-article","created":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T23:52:37Z","timestamp":1572047557000},"page":"307-325","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Predictive spreadsheet autocompletion with constraints"],"prefix":"10.1007","volume":"109","author":[{"given":"Samuel","family":"Kolb","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Teso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anton","family":"Dries","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luc","family":"De Raedt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,25]]},"reference":[{"issue":"1","key":"5841_CR1","doi-asserted-by":"publisher","first-page":"121","DOI":"10.4086\/toc.2012.v008a006","volume":"8","author":"S Arora","year":"2012","unstructured":"Arora, S., Hazan, E., & Kale, S. (2012). The multiplicative weights update method: A meta-algorithm and applications. Theory of Computing, 8(1), 121\u2013164.","journal-title":"Theory of Computing"},{"key":"5841_CR2","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., & Simonis, H. (2012). A model seeker: Extracting global constraint models from positive examples. In Principles and practice of constraint programming (pp. 141\u2013157). Springer.","DOI":"10.1007\/978-3-642-33558-7_13"},{"key":"5841_CR3","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-319-50137-6_3","volume-title":"Data mining and constraint programming","author":"C Bessiere","year":"2016","unstructured":"Bessiere, C., Daoudi, A., Hebrard, E., Katsirelos, G., Lazaar, N., Mechqrane, Y., et al. (2016). New approaches to constraint acquisition. In C. Bessiere, et al. (Eds.), Data mining and constraint programming (pp. 51\u201376). Cham: Springer."},{"key":"5841_CR4","unstructured":"Bessiere, C., Coletta, R., Koriche, F., & O\u2019Sullivan, B. (2005). A sat-based version space algorithm for acquiring constraint satisfaction problems. In J. Gama, R. Camacho, P. B. Brazdil, A. M. Jorge, & L. Torgo (Eds.), Machine learning: ECML 2005 (pp. 23\u201334). Berlin: Springer."},{"key":"5841_CR5","unstructured":"BigML Home Page. Retrieved 30 April 2019 https:\/\/bigml.com ."},{"key":"5841_CR6","volume-title":"Pattern recognition and machine learning","author":"CM Bishop","year":"2006","unstructured":"Bishop, C. M. (2006). Pattern recognition and machine learning. Berlin: Springer."},{"issue":"1","key":"5841_CR7","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman, L. (2001). Random forests. Machine Learning, 45(1), 5\u201332.","journal-title":"Machine Learning"},{"key":"5841_CR8","doi-asserted-by":"publisher","DOI":"10.1201\/9781315139470","volume-title":"Classification and regression trees","author":"L Breiman","year":"2017","unstructured":"Breiman, L. (2017). Classification and regression trees. Abingdon: Routledge."},{"issue":"1","key":"5841_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1175\/1520-0493(1950)078<0001:VOFEIT>2.0.CO;2","volume":"78","author":"GW Brier","year":"1950","unstructured":"Brier, G. W. (1950). Verification of forecasts expressed in terms of probability. Monthey Weather Review, 78(1), 1\u20133.","journal-title":"Monthey Weather Review"},{"issue":"2","key":"5841_CR10","first-page":"187","volume":"19","author":"RT Clemen","year":"1999","unstructured":"Clemen, R. T., & Winkler, R. L. (1999). Combining probability distributions from experts in risk analysis. Risk Analysis, 19(2), 187\u2013203.","journal-title":"Risk Analysis"},{"key":"5841_CR11","doi-asserted-by":"crossref","unstructured":"De\u00a0Raedt, L., Blockeel, H., Kolb, S., Teso, S., & Verbruggen, G. (2018). Elements of an automatic data scientist. In International symposium on intelligent data analysis (pp. 3\u201314). Springer.","DOI":"10.1007\/978-3-030-01768-2_1"},{"key":"5841_CR12","unstructured":"De\u00a0Raedt, L., Kimmig, A., & Toivonen, H. (2007). Problog: A probabilistic prolog and its application in link discovery. In Proceedings 20th international joint conference on artificial intelligence."},{"key":"5841_CR13","unstructured":"Devlin, J., Uesato, J., Bhupatiraju, S., Singh, R., Mohamed, A.r., & Kohli, P. (2017). Robustfill: Neural program learning under noisy i\/o. In International conference on machine learning (pp. 990\u2013998)."},{"key":"5841_CR14","doi-asserted-by":"crossref","unstructured":"Dietterich, T.G. (2000). Ensemble methods in machine learning. In International workshop on multiple classifier systems (pp. 1\u201315). Springer.","DOI":"10.1007\/3-540-45014-9_1"},{"key":"5841_CR15","doi-asserted-by":"crossref","unstructured":"Dries, A., Kimmig, A., Meert, W., Renkens, J., Van\u00a0den Broeck, G., Vlasselaer, J., & De\u00a0Raedt, L. (2015). Problog2: Probabilistic logic programming. In Joint european conference on machine learning and knowledge discovery in databases (pp. 312\u2013315). Springer.","DOI":"10.1007\/978-3-319-23461-8_37"},{"key":"5841_CR16","first-page":"111","volume":"190","author":"A Elisseeff","year":"2003","unstructured":"Elisseeff, A., & Pontil, M. (2003). Leave-one-out error and stability of learning algorithms with applications. NATO Science Series Sub Series III Computer and Systems Sciences, 190, 111\u2013130.","journal-title":"NATO Science Series Sub Series III Computer and Systems Sciences"},{"issue":"3","key":"5841_CR17","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1017\/S1471068414000076","volume":"15","author":"D Fierens","year":"2015","unstructured":"Fierens, D., Van den Broeck, G., Renkens, J., Shterionov, D., Gutmann, B., Thon, I., et al. (2015). Inference and learning in probabilistic logic programs using weighted boolean formulas. Theory and Practice of Logic Programming, 15(3), 358\u2013401.","journal-title":"Theory and Practice of Logic Programming"},{"key":"5841_CR18","doi-asserted-by":"crossref","unstructured":"Fisher, M., & Rothermel, G. (2005). The euses spreadsheet corpus: A shared resource for supporting experimentation with spreadsheet dependability mechanisms. In ACM SIGSOFT software engineering notes, vol.\u00a030, (pp. 1\u20135). ACM.","DOI":"10.1145\/1082983.1083242"},{"key":"5841_CR19","doi-asserted-by":"crossref","unstructured":"Gulwani, S. (2011). Automating string processing in spreadsheets using input\u2013output examples. In ACM SIGPLAN notices, vol.\u00a046, (pp. 317\u2013330). ACM.","DOI":"10.1145\/1925844.1926423"},{"issue":"8","key":"5841_CR20","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1145\/2240236.2240260","volume":"55","author":"S Gulwani","year":"2012","unstructured":"Gulwani, S., Harris, W. R., & Singh, R. (2012). Spreadsheet data manipulation using examples. Communications of the ACM, 55(8), 97\u2013105.","journal-title":"Communications of the ACM"},{"issue":"11","key":"5841_CR21","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/2736282","volume":"58","author":"S Gulwani","year":"2015","unstructured":"Gulwani, S., Hern\u00e1ndez-Orallo, J., Kitzelmann, E., Muggleton, S. H., Schmid, U., & Zorn, B. (2015). Inductive programming meets the real world. Communications of the ACM, 58(11), 90\u201399.","journal-title":"Communications of the ACM"},{"issue":"1\u20132","key":"5841_CR22","first-page":"1","volume":"4","author":"S Gulwani","year":"2017","unstructured":"Gulwani, S., Polozov, O., Singh, R., et al. (2017). Program synthesis. Foundations and Trends\u00aein Programming Languages, 4(1\u20132), 1\u2013119.","journal-title":"Foundations and Trends\u00aein Programming Languages"},{"issue":"2","key":"5841_CR23","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1162\/neco.1994.6.2.181","volume":"6","author":"MI Jordan","year":"1994","unstructured":"Jordan, M. I., & Jacobs, R. A. (1994). Hierarchical mixtures of experts and the em algorithm. Neural Computation, 6(2), 181\u2013214.","journal-title":"Neural Computation"},{"issue":"9\u201310","key":"5841_CR24","doi-asserted-by":"publisher","first-page":"1441","DOI":"10.1007\/s10994-017-5640-x","volume":"106","author":"S Kolb","year":"2017","unstructured":"Kolb, S., Paramonov, S., Guns, T., & De Raedt, L. (2017). Learning constraints in spreadsheets and tabular data. Machine Learning, 106(9\u201310), 1441\u20131468.","journal-title":"Machine Learning"},{"key":"5841_CR25","volume-title":"Probabilistic graphical models: Principles and techniques","author":"D Koller","year":"2009","unstructured":"Koller, D., & Friedman, N. (2009). Probabilistic graphical models: Principles and techniques. Cambridge: MIT press."},{"issue":"3","key":"5841_CR26","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1016\/j.omega.2007.12.004","volume":"37","author":"BR Lawson","year":"2009","unstructured":"Lawson, B. R., Baker, K. R., Powell, S. G., & Foster-Johnson, L. (2009). A comparison of spreadsheet users with different levels of experience. Omega, 37(3), 579\u2013590.","journal-title":"Omega"},{"key":"5841_CR27","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/0743-1066(94)90035-3","volume":"19","author":"S Muggleton","year":"1994","unstructured":"Muggleton, S., & De Raedt, L. (1994). Inductive logic programming: Theory and methods. The Journal of Logic Programming, 19, 629\u2013679.","journal-title":"The Journal of Logic Programming"},{"key":"5841_CR28","first-page":"809","volume":"11","author":"M Nickel","year":"2011","unstructured":"Nickel, M., Tresp, V., & Kriegel, H. P. (2011). A three-way model for collective learning on multi-relational data. ICML, 11, 809\u2013816.","journal-title":"ICML"},{"key":"5841_CR29","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., et al. (2011). Scikit-learn: Machine learning in Python. Journal of Machine Learning Research, 12, 2825\u20132830.","journal-title":"Journal of Machine Learning Research"},{"key":"5841_CR30","doi-asserted-by":"crossref","unstructured":"Raza, M., & Gulwani, S. (2017). Automated data extraction using predictive program synthesis. In AAAI (pp. 882\u2013890).","DOI":"10.1609\/aaai.v31i1.10668"},{"issue":"4","key":"5841_CR31","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1023\/B:CONS.0000049206.43218.5f","volume":"9","author":"F Rossi","year":"2004","unstructured":"Rossi, F., & Sperduti, A. (2004). Acquiring both constraint and solution preferences in interactive constraint systems. Constraints, 9(4), 311\u2013332.","journal-title":"Constraints"},{"key":"5841_CR32","doi-asserted-by":"crossref","unstructured":"Scaffidi, C., Shaw, M., & Myers, B. (2005). Estimating the numbers of end users and end user programmers. In Visual languages and human-centric computing, 2005 IEEE symposium on IEEE (pp. 207\u2013214).","DOI":"10.1109\/VLHCC.2005.34"},{"issue":"4","key":"5841_CR33","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1198\/000313005X74016","volume":"59","author":"F Scheuren","year":"2005","unstructured":"Scheuren, F. (2005). Multiple imputation: How it began and continues. The American Statistician, 59(4), 315\u2013319.","journal-title":"The American Statistician"},{"issue":"1","key":"5841_CR34","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1093\/bioinformatics\/btr597","volume":"28","author":"DJ Stekhoven","year":"2011","unstructured":"Stekhoven, D. J., & B\u00fchlmann, P. (2011). MissForest\u2014Non-parametric missing value imputation for mixed-type data. Bioinformatics, 28(1), 112\u2013118.","journal-title":"Bioinformatics"},{"issue":"3","key":"5841_CR35","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1177\/0962280206074463","volume":"16","author":"S Van Buuren","year":"2007","unstructured":"Van Buuren, S. (2007). Multiple imputation of discrete and continuous data by fully conditional specification. Statistical Methods in Medical Research, 16(3), 219\u2013242.","journal-title":"Statistical Methods in Medical Research"},{"key":"5841_CR36","doi-asserted-by":"publisher","DOI":"10.1201\/9780429492259","volume-title":"Flexible imputation of missing data","author":"S Van Buuren","year":"2018","unstructured":"Van Buuren, S. (2018). Flexible imputation of missing data. Boca Raton: Chapman and Hall\/CRC."},{"key":"5841_CR37","doi-asserted-by":"crossref","unstructured":"Van\u00a0Wolputte, E., Korneva, E., & Blockeel, H. (2018). Mercs: Multi-directional ensembles of regression and classification trees. In AAAI.","DOI":"10.1609\/aaai.v32i1.11735"},{"issue":"2","key":"5841_CR38","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/2641190.2641198","volume":"15","author":"J Vanschoren","year":"2013","unstructured":"Vanschoren, J., van Rijn, J. N., Bischl, B., & Torgo, L. (2013). OpenML: Networked Science in machine learning. SIGKDD Explorations, 15(2), 49\u201360. https:\/\/doi.org\/10.1145\/2641190.2641198 .","journal-title":"SIGKDD Explorations"},{"key":"5841_CR39","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1109\/TKDE.2006.94","volume":"6","author":"X Yin","year":"2006","unstructured":"Yin, X., Han, J., Yang, J., & Philip, S. Y. (2006). Efficient classification across multiple database relations: A crossmine approach. IEEE Transactions on Knowledge & Data Engineering, 6, 770\u2013783.","journal-title":"IEEE Transactions on Knowledge & Data Engineering"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-019-05841-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-019-05841-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-019-05841-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,2]],"date-time":"2022-10-02T18:23:35Z","timestamp":1664735015000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-019-05841-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,25]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["5841"],"URL":"https:\/\/doi.org\/10.1007\/s10994-019-05841-y","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,25]]},"assertion":[{"value":"26 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 May 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 September 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 October 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}