{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T21:54:09Z","timestamp":1759960449005,"version":"3.37.3"},"reference-count":72,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,2,28]],"date-time":"2018-02-28T00:00:00Z","timestamp":1519776000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001829","name":"Utrecht University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001829","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Data Sci Anal"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s41060-018-0103-4","type":"journal-article","created":{"date-parts":[[2018,2,28]],"date-time":"2018-02-28T14:41:03Z","timestamp":1519828863000},"page":"177-187","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Data science as a language: challenges for computer science\u2014a position paper"],"prefix":"10.1007","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5108-7965","authenticated-orcid":false,"given":"Arno","family":"Siebes","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,2,28]]},"reference":[{"key":"103_CR1","doi-asserted-by":"crossref","unstructured":"Abramowitz, M., Stegun, I.A. (eds.): Handbook of Mathematical Functions: With Formulas, Graphs, and Mathematical Tables. Dover Publications, New York (1965)","DOI":"10.1115\/1.3625776"},{"issue":"1","key":"103_CR2","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1109\/TIT.2008.2008152","volume":"55","author":"P Adriaans","year":"2009","unstructured":"Adriaans, P., Vit\u00e1nyi, P.: Approximation of the two-part MDL code. IEEE Trans. Inf. Theory 55(1), 444\u2013457 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"103_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6396-2","volume-title":"Outlier Analysis","author":"CC Aggarwal","year":"2013","unstructured":"Aggarwal, C.C.: Outlier Analysis. Springer, Berlin (2013)"},{"volume-title":"Frequent Pattern Mining","year":"2014","key":"103_CR4","unstructured":"Aggarwal, C.C., Han, J. (eds.): Frequent Pattern Mining. Springer, Berlin (2014)"},{"key":"103_CR5","unstructured":"Asimov, I.: The Foundation Trilogy. Panther, London (1962\u20131964)"},{"key":"103_CR6","volume-title":"Network Science","author":"A-L Barab\u00e1si","year":"2016","unstructured":"Barab\u00e1si, A.-L.: Network Science. Cambridge University Press, Cambridge (2016)"},{"key":"103_CR7","doi-asserted-by":"crossref","unstructured":"Berthold, M.R,. Cebron, N., Dill, F., Gabriel, T.R., K\u00f6tter, T., Meinl, T., Ohl, P., Sieb, C., Thiel, K., Wiswedel, B.: KNIME: the Konstanz information miner. In: Studies in Classification, Data Analysis, and Knowledge Organization (GfKL 2007). Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-78246-9_38"},{"issue":"3","key":"103_CR8","first-page":"12","volume":"7","author":"L Berti-Equille","year":"2016","unstructured":"Berti-Equille, L., Ba, M.L.: Veracity of big data: challenges of cross-modal truth discovery. J. Data Inf. Qual. 7(3), 12 (2016)","journal-title":"J. Data Inf. Qual."},{"key":"103_CR9","first-page":"451","volume-title":"Program Specification and Transformation","author":"RS Bird","year":"1987","unstructured":"Bird, R.S., Meertens, L.: Two exercises found in a book on algorithmics. In: Meertens, L.G.L.T. (ed.) Program Specification and Transformation, pp. 451\u2013457. North-Holland Publishing Company, Amsterdam (1987)"},{"key":"103_CR10","doi-asserted-by":"crossref","unstructured":"Blei D.M., Lafferty, J.D.: Dynamic topic models. In: Proceedings of the 23rd International Conference on Machine Learning (ICML), pp. 113\u2013120 (2006)","DOI":"10.1145\/1143844.1143859"},{"issue":"5","key":"103_CR11","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1080\/1369118X.2012.678878","volume":"15","author":"D Boyd","year":"2012","unstructured":"Boyd, D., Crawford, K.: Critical questions for big data; provocations for a cultural, technological, and scholarly phenomenon. Inf. Commun. Soc. 15(5), 662\u2013679 (2012)","journal-title":"Inf. Commun. Soc."},{"issue":"3","key":"103_CR12","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1214\/ss\/1009213726","volume":"16","author":"L Breiman","year":"2001","unstructured":"Breiman, L.: Statistical modelling: the two cultures. Stat. Sci. 16(3), 199\u2013231 (2001)","journal-title":"Stat. Sci."},{"key":"103_CR13","volume-title":"Digital Humanities","author":"A Burdick","year":"2012","unstructured":"Burdick, A., Drucker, J., Lunefeld, P., Presner, T., Schnapp, J.: Digital Humanities. MIT Press, Cambridge (2012)"},{"key":"103_CR14","unstructured":"Burns, A., Wellings, A.: Real-Time Systems and Programming Languages: Ada, Real-Time Java and C\/Real-Time POSIX, 4th edn. Addison-Wesley Educational Publishers Inc, USA (2009)"},{"issue":"1","key":"103_CR15","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1140\/epjst\/e2012-01697-8","volume":"214","author":"R Conte","year":"2012","unstructured":"Conte, R., Gilbert, G.N., Bonelli, G., Cioffi-Revilla, C.A., Deffuant, G., Kert\u00e9sz, J., Loreto, V., Moat, H.S., Nadal, J.-P., Sanchez, A., Nowak, A., Flache, A., Miguel, M.S., Helbing, D.: Manifesto of computational social science. Eur. Phys. J. Spec. Top. 214(1), 325\u2013346 (2012)","journal-title":"Eur. Phys. J. Spec. Top."},{"volume-title":"Mining Graph Data","year":"2006","key":"103_CR16","unstructured":"Cook, D.J., Holder, L.B. (eds.): Mining Graph Data. Wiley, New York (2006)"},{"key":"103_CR17","unstructured":"Crook, P.: Darwin\u2019s Coat-Tails: Essays on Social Darwinism. Peter Lang, New York (2007)"},{"key":"103_CR18","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-16367-8_5","volume-title":"Property Testing","author":"A Czumaj","year":"2010","unstructured":"Czumaj, A., Sohler, C.: Sublinear-time algorithms. In: Goldreich, O. (ed.) Property Testing, pp. 41\u201364. Springer, Berlin (2010)"},{"key":"103_CR19","doi-asserted-by":"crossref","unstructured":"Darwin, C.: On the Origin of Species: By Means of Natural Selection, or the Preservation of Favoured Races in the Struggle for Life. John Murray, London (1859)","DOI":"10.5962\/bhl.title.68064"},{"key":"103_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68856-3","volume-title":"Logical and Relational Learning","author":"L Raedt de","year":"2008","unstructured":"de Raedt, L.: Logical and Relational Learning. Springer, Berlin (2008)"},{"key":"103_CR21","volume-title":"Sequence Data Mining","author":"G Dong","year":"2007","unstructured":"Dong, G., Pei, J.: Sequence Data Mining. Springer, Berlin (2007)"},{"key":"103_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511761942","volume-title":"Networks, Crowds, and Markets: Reasoning about a Highly Connected World","author":"D Easley","year":"2010","unstructured":"Easley, D., Kleinberg, J.: Networks, Crowds, and Markets: Reasoning about a Highly Connected World. Cambridge University Press, Cambridge (2010)"},{"key":"103_CR23","volume-title":"Computer Age Statistical Algorithms, Algorithms, Evidence, and Data Science","author":"B Efron","year":"2016","unstructured":"Efron, B., Hastie, T.: Computer Age Statistical Algorithms, Algorithms, Evidence, and Data Science. Cambridge University Press, Cambridge (2016)"},{"key":"103_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-4541-9","volume-title":"An Introduction to the Bootstrap","author":"B Efron","year":"1993","unstructured":"Efron, B., Tibshirani, R.J.: An Introduction to the Bootstrap. Chapman & Hall, London (1993)"},{"key":"103_CR25","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198570219.001.0001","volume-title":"From Strange Simplicity to Complex Familiarity","author":"M Eigen","year":"2013","unstructured":"Eigen, M.: From Strange Simplicity to Complex Familiarity. Oxford University Press, Oxford (2013)"},{"volume-title":"From Matter to Life: Information and Causality","year":"2017","key":"103_CR26","unstructured":"Ellis, G.F.R., Walker, S.I., Davies, P.C.W. (eds.): From Matter to Life: Information and Causality. Cambridge University Press, Cambridge (2017)"},{"key":"103_CR27","doi-asserted-by":"publisher","DOI":"10.1002\/9780470977811","volume-title":"Cluster Analysis","author":"BS Everitt","year":"2011","unstructured":"Everitt, B.S., Landau, S., Leese, M., Stahl, D.: Cluster Analysis, 5th edn. Wiley, New York (2011)","edition":"5"},{"key":"103_CR28","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546914","volume-title":"The Text Mining Handbook: Advanced Approaches in Analyzing Unstructured Data","author":"R Feldman","year":"2006","unstructured":"Feldman, R., Sanger, J.: The Text Mining Handbook: Advanced Approaches in Analyzing Unstructured Data. Cambridge University Press, Cambridge (2006)"},{"key":"103_CR29","volume-title":"Database Systems: The Complete Book","author":"H Garcia-Molina","year":"2008","unstructured":"Garcia-Molina, H., Ullman, J.D., Widom, J.: Database Systems: The Complete Book, 2nd edn. Pearson, London (2008)","edition":"2"},{"key":"103_CR30","doi-asserted-by":"publisher","DOI":"10.1017\/9781108135252","volume-title":"Introduction to Property Testing","author":"O Goldreich","year":"2017","unstructured":"Goldreich, O.: Introduction to Property Testing. Cambridge University Press, Cambridge (2017)"},{"key":"103_CR31","doi-asserted-by":"crossref","unstructured":"Green, T.J., Karvounarakis, G., Tannen, V.: Provenance semirings. In: Principles of Database Systems (PODS), pp. 31\u201340 (2007)","DOI":"10.1145\/1265530.1265535"},{"key":"103_CR32","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10654-016-0149-3","volume":"31","author":"S Greenland","year":"2016","unstructured":"Greenland, S., Kenn, S.J., Rothman, K.J., Carlin, J.B., Poole, C., Goodman, S.N., Altman, D.G.: Statistical tests, p-values, confidence intervals, and power: a guide to misinterpretations. Eur. J. Epidemiol. 31, 337\u2013350 (2016)","journal-title":"Eur. J. Epidemiol."},{"key":"103_CR33","unstructured":"Grosse, R.B., Salakhutdinov, R., Freeman, W.T., Tenenbaum, J.B.: Exploiting compositionality to explore a large space of model structures. In: Proceedings of the Conference on Uncertainty in Artificial Intelligence (2012)"},{"key":"103_CR34","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4643.001.0001","volume-title":"The Minimum Description Length Principle","author":"P Gr\u00fcnwald","year":"2007","unstructured":"Gr\u00fcnwald, P.: The Minimum Description Length Principle. MIT Press, Cambridge (2007)"},{"key":"103_CR35","volume-title":"Philosophy of Information","author":"P Gr\u00fcnwald","year":"2008","unstructured":"Gr\u00fcnwald, P., Vit\u00e1nyi, P.M.B.: Algorithmic information theory. In: Adriaans, P., van Benthem, J. (eds.) Philosophy of Information. North Holland, Amsterdam (2008)"},{"key":"103_CR36","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology","author":"D Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)"},{"key":"103_CR37","unstructured":"Haussler, D.: Probably approximately correct learning. In: Proceedings of the Eighth National Conference on Artificial Intelligence, pp. 1101\u20131108. AAAI Press (1990)"},{"key":"103_CR38","volume-title":"An Introduction to Bioinformatics Algorithms","author":"NC Jones","year":"2004","unstructured":"Jones, N.C., Pevzner, P.A.: An Introduction to Bioinformatics Algorithms. MIT Press, Cambridge (2004)"},{"key":"103_CR39","doi-asserted-by":"publisher","first-page":"3521","DOI":"10.1073\/pnas.1611835114","volume":"114","author":"J Kirkpatrick","year":"2017","unstructured":"Kirkpatrick, J., Pascanu, R., Rabinowitz, N., Veness, J., Desjardins, G., Rusu, A.A., Milan, K., Quan, J., Ramalho, T., Grabska-Barwinska, A., Hassabis, D., Clopath, C., Kumarana, D., Hadsel, R.: Overcoming catastrophic forgetting in neural networks. Proc. Natl. Acad. Sci. 114, 3521\u20133526 (2017)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"103_CR40","volume-title":"Data Mining in Time Series Databases","author":"M Li","year":"2004","unstructured":"Li, M., Abraham, K., Horst, B.: Data Mining in Time Series Databases. World Scientific, Singapore (2004)"},{"issue":"12","key":"103_CR41","doi-asserted-by":"publisher","first-page":"3250","DOI":"10.1109\/TIT.2004.838101","volume":"50","author":"M. Li","year":"2004","unstructured":"Li, M., Chen, X., Li, X., Ma, B., Vit\u00e1ny, P.M.B.: The similarity metric. IEEE Trans. Inf. Theory 50(1) (2004)","journal-title":"IEEE Transactions on Information Theory"},{"key":"103_CR42","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3860-5","volume-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"M Li","year":"1993","unstructured":"Li, M., Vit\u00e1nyi, P.: An Introduction to Kolmogorov Complexity and Its Applications. Springer, Berlin (1993)"},{"key":"103_CR43","doi-asserted-by":"crossref","unstructured":"McAllester, D.A.: Some PAC-Bayesian theorems. In: Proceedings of the Eleventh Annual Conference on Computational Learning Theory, COLT. ACM, pp. 230\u2013234 (1998)","DOI":"10.1145\/279943.279989"},{"key":"103_CR44","unstructured":"Mueller, M.P.: Could the physical world be emergent instead of fundamental, and why should we ask? (full version) (2017). arXiv:1712.01826"},{"volume-title":"NIST Handbook of Mathematical Functions","year":"2010","key":"103_CR45","unstructured":"Olver, F.W.J., Lozier, D.W., Boisvert, R.F., Clark, C.W. (eds.): NIST Handbook of Mathematical Functions. Cambridge University Press, Cambridge (2010)"},{"key":"103_CR46","doi-asserted-by":"crossref","unstructured":"Prabhu, P., et\u00a0al.: A survey of the practice of computational science. In: Proceeding of SC \u201911, State of the Practice Reports (2011)","DOI":"10.1145\/2063348.2063374"},{"issue":"6","key":"103_CR47","doi-asserted-by":"publisher","first-page":"1076","DOI":"10.3390\/e13061076","volume":"13","author":"S Rathmanner","year":"2011","unstructured":"Rathmanner, S., Hutter, M.: A philosophical treatise of universal induction. Entropy 13(6), 1076\u20131136 (2011)","journal-title":"Entropy"},{"issue":"2","key":"103_CR48","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/s10618-016-0468-8","volume":"31","author":"M Riondato","year":"2017","unstructured":"Riondato, M., Garc\u00eda-Soriano, D., Bonchi, F.: Graph summarization with quality guarantees. Data Min. Knowl. Discov. 31(2), 314\u2013349 (2017)","journal-title":"Data Min. Knowl. Discov."},{"issue":"4","key":"103_CR49","first-page":"20:1","volume":"8","author":"M Riondato","year":"2014","unstructured":"Riondato, M., Upfal, E.: Efficient discovery of association rules and frequent itemsets through sampling with tight performance guarantees. Trans. Knowl. Discov. Databases 8(4), 20:1\u201320:32 (2014)","journal-title":"Trans. Knowl. Discov. Databases"},{"key":"103_CR50","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J Rissanen","year":"1978","unstructured":"Rissanen, J.: Modeling by shortest data description. Automatica 14, 465\u2013658 (1978)","journal-title":"Automatica"},{"key":"103_CR51","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/8291.001.0001","volume-title":"Boosting-Foundations and Algorithms","author":"RE Schapire","year":"2012","unstructured":"Schapire, R.E., Freund, Y.: Boosting-Foundations and Algorithms. MIT Press, Cambridge (2012)"},{"key":"103_CR52","first-page":"3595","volume":"11","author":"Y Seldin","year":"2010","unstructured":"Seldin, Y., Tishby, N.: PAC-Bayesian analysis of co-clustering and beyond. J. Mach. Learn. Res. 11, 3595\u20133646 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"103_CR53","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107298019","volume-title":"Understanding Machine Learning-From Theory to Algorithms","author":"S Shalev-Shwartz","year":"2014","unstructured":"Shalev-Shwartz, S., Ben-David, S.: Understanding Machine Learning-From Theory to Algorithms. Cambridge University Press, Cambridge (2014)"},{"key":"103_CR54","first-page":"393","volume-title":"Item Sets that Compress","author":"A Siebes","year":"2006","unstructured":"Siebes, A., Vreeken, J., van Leeuwen, M.: Item Sets that Compress, pp. 393\u2013404. SIAM, Philadelphia (2006)"},{"issue":"5","key":"103_CR55","first-page":"30","volume":"46","author":"G Siemens","year":"2011","unstructured":"Siemens, G., Long, P.: Penetrating the fog: analytics in learning and education. EDUCAUSE Rev. 46(5), 30\u201340 (2011)","journal-title":"EDUCAUSE Rev."},{"key":"103_CR56","volume-title":"The Two Cultures and the Scientific Revolution","author":"CP Snow","year":"1959","unstructured":"Snow, C.P.: The Two Cultures and the Scientific Revolution. Cambridge University Press, Cambridge (1959)"},{"key":"103_CR57","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107705937","volume-title":"Ockham\u2019s Razors\u2014A User\u2019s Manual","author":"E Sober","year":"2015","unstructured":"Sober, E.: Ockham\u2019s Razors\u2014A User\u2019s Manual. Cambridge University Press, Cambridge (2015)"},{"issue":"1","key":"103_CR58","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1006\/jcss.1997.1500","volume":"55","author":"R Solomonoff","year":"1997","unstructured":"Solomonoff, R.: The discovery of algorithmic probability. J. Comput. Syst. Sci. 55(1), 73\u201388 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"103_CR59","volume-title":"Classical Inference and the Linear Model, Volume\u00a02A of Kendall\u2019s Advanced Theory of Statistics","author":"A Stuart","year":"1999","unstructured":"Stuart, A., Ord, K., Arnold, S.: Classical Inference and the Linear Model, Volume\u00a02A of Kendall\u2019s Advanced Theory of Statistics. Arnold, London (1999)"},{"key":"103_CR60","volume-title":"The Science of Computing: Shaping a Discipline","author":"M Tedre","year":"2015","unstructured":"Tedre, M.: The Science of Computing: Shaping a Discipline. CRC Press, Boca Raton (2015)"},{"key":"103_CR61","volume-title":"Exploratory Data Analysis","author":"JW Tukey","year":"1977","unstructured":"Tukey, J.W.: Exploratory Data Analysis. Pearson, London (1977)"},{"issue":"11","key":"103_CR62","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"LG Valiant","year":"1984","unstructured":"Valiant, L.G.: A theory of the learnable. Commun. ACM 27(11), 1134\u20131142 (1984)","journal-title":"Commun. ACM"},{"issue":"2","key":"103_CR63","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.: OpenML: networked science in machine learning. SIGKDD Explor. 15(2), 49\u201360 (2013)","journal-title":"SIGKDD Explor."},{"key":"103_CR64","volume-title":"Statistical Learning Theory","author":"V Vapnik","year":"1998","unstructured":"Vapnik, V.: Statistical Learning Theory. Wiley, New York (1998)"},{"issue":"2","key":"103_CR65","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1137\/1116025","volume":"16","author":"V Vapnik","year":"1971","unstructured":"Vapnik, V., Chervonenkis, A.: On the uniform convergence of realtive frequences of events to their probabilities. Theory Probab. Appl. 16(2), 264\u2013280 (1971)","journal-title":"Theory Probab. Appl."},{"key":"103_CR66","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511564079","volume-title":"Diagrammatica: The Path to Feynman Diagrams","author":"M Veltman","year":"1994","unstructured":"Veltman, M.: Diagrammatica: The Path to Feynman Diagrams. Cambridge University Press, Cambridge (1994)"},{"issue":"4","key":"103_CR67","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/JHEP04(2011)029","volume":"2011","author":"EP Verlinde","year":"2011","unstructured":"Verlinde, E.P.: On the origin of gravity and the laws of Newton. J. High Energy Phys. 2011(4), 29 (2011)","journal-title":"J. High Energy Phys."},{"key":"103_CR68","unstructured":"Vickers, J.: The problem of induction. In: Zalta, E.N. (ed.) The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University, spring 2016 edition (2016)"},{"key":"103_CR69","unstructured":"von Luxburg, U., Williamson, R.C., Guyon, I.: Clustering: science or art? In: Unsupervised and Transfer Learning\u2014Workshop Held at ICML 2011, Volume\u00a027 of JMLR Proceedings, pp 65\u201380. JMLR.org (2012)"},{"issue":"7","key":"103_CR70","doi-asserted-by":"publisher","first-page":"1341","DOI":"10.1162\/neco.1996.8.7.1341","volume":"8","author":"DH Wolpert","year":"1996","unstructured":"Wolpert, D.H.: The lack of a priori distinctions between learning algorithms. Neural Comput. 8(7), 1341\u20131390 (1996)","journal-title":"Neural Comput."},{"issue":"3","key":"103_CR71","doi-asserted-by":"publisher","first-page":"1579","DOI":"10.1086\/301513","volume":"120","author":"DG York","year":"2000","unstructured":"York, D.G., et al.: The sloan digital sky survey: technical summary. Astron. J. 120(3), 1579\u20131587 (2000)","journal-title":"Astron. J."},{"issue":"3","key":"103_CR72","first-page":"73","volume":"17","author":"S Zilberstein","year":"1996","unstructured":"Zilberstein, S.: Using anytime algorithms in intelligent systems. AI Mag. 17(3), 73\u201383 (1996)","journal-title":"AI Mag."}],"container-title":["International Journal of Data Science and Analytics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41060-018-0103-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-018-0103-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-018-0103-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T01:01:16Z","timestamp":1660525276000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s41060-018-0103-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,28]]},"references-count":72,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["103"],"URL":"https:\/\/doi.org\/10.1007\/s41060-018-0103-4","relation":{},"ISSN":["2364-415X","2364-4168"],"issn-type":[{"type":"print","value":"2364-415X"},{"type":"electronic","value":"2364-4168"}],"subject":[],"published":{"date-parts":[[2018,2,28]]},"assertion":[{"value":"20 March 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The author declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}