{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T04:12:22Z","timestamp":1750824742759,"version":"3.41.0"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2017,8,8]],"date-time":"2017-08-08T00:00:00Z","timestamp":1502150400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"ICON-Project","award":["FP7-ICT-2011-C"],"award-info":[{"award-number":["FP7-ICT-2011-C"]}]},{"name":"FWO"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s10994-017-5660-6","type":"journal-article","created":{"date-parts":[[2017,8,8]],"date-time":"2017-08-08T18:55:51Z","timestamp":1502218551000},"page":"1867-1904","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Relational data factorization"],"prefix":"10.1007","volume":"106","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0079-6638","authenticated-orcid":false,"given":"Sergey","family":"Paramonov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthijs","family":"van Leeuwen","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":[[2017,8,8]]},"reference":[{"key":"5660_CR1","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/978-3-642-23241-1_11","volume-title":"Data mining: foundations and intelligent paradigms, intelligent systems reference library","author":"F Aftrati","year":"2012","unstructured":"Aftrati, F., Das, G., Gionis, A., Mannila, H., Mielik\u00e4inen, T., & Tsaparas, P. (2012). Mining chains of relations. In D. E. Holmes & L. C. Jain (Eds.), Data mining: foundations and intelligent paradigms, intelligent systems reference library (Vol. 24, pp. 217\u2013246). Berlin, Heidelberg: Springer."},{"key":"5660_CR2","unstructured":"Arimura, H., Medina, R., & Petit, J.M. (Eds.). (2012). In: Proceedings of the IEEE ICDM Workshop on Declarative Pattern Mining."},{"key":"5660_CR3","doi-asserted-by":"crossref","first-page":"1860","DOI":"10.1137\/S1064827502401953","volume":"25","author":"C Aykanat","year":"2002","unstructured":"Aykanat, C., Pinar, A., & Catalyurek, \u00dc. V. (2002). Permuting sparse rectangular matrices into block-diagonal form. SIAM Journal on Scientific Computing, 25, 1860\u20131879.","journal-title":"SIAM Journal on Scientific Computing"},{"key":"5660_CR4","unstructured":"Bache, K., & Lichman, M. (2013). UCI machine learning repository. http:\/\/archive.ics.uci.edu\/ml ."},{"issue":"2","key":"5660_CR5","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0169-023X(02)00056-3","volume":"43","author":"F Berzal","year":"2002","unstructured":"Berzal, F., Cubero, J. C., Cuenca, F., & Medina, J. M. (2002). Relational decomposition through partial functional dependencies. Data and Knowledge Engineering, 43(2), 207\u2013234.","journal-title":"Data and Knowledge Engineering"},{"issue":"5","key":"5660_CR6","doi-asserted-by":"crossref","first-page":"1052","DOI":"10.1137\/S0097539701390859","volume":"33","author":"J Biskup","year":"2004","unstructured":"Biskup, J., Paredaens, J., Schwentick, T., & den Bussche, J. V. (2004). Solving equations in the relational algebra. SIAM Journal on Computing, 33(5), 1052\u20131066.","journal-title":"SIAM Journal on Computing"},{"issue":"12","key":"5660_CR7","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G Brewka","year":"2011","unstructured":"Brewka, G., Eiter, T., & Truszczy\u0144ski, M. (2011). Answer set programming at a glance. Communications of the ACM, 54(12), 92\u2013103.","journal-title":"Communications of the ACM"},{"key":"5660_CR8","first-page":"1513","volume":"2008","author":"MW Chang","year":"2008","unstructured":"Chang, M. W., Ratinov, L. A., Rizzolo, N., & Roth, D. (2008). Learning and inference with constraints. Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, AAAI, 2008, 1513\u20131518.","journal-title":"Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, AAAI"},{"issue":"6","key":"5660_CR9","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/362384.362685","volume":"13","author":"EF Codd","year":"1970","unstructured":"Codd, E. F. (1970). A relational model of data for large shared data banks. Communications of the ACM, 13(6), 377\u2013387.","journal-title":"Communications of the ACM"},{"key":"5660_CR10","volume-title":"Date on database: Writings 2000\u20132006","author":"CJ Date","year":"2006","unstructured":"Date, C. J. (2006). Date on database: Writings 2000\u20132006. Berkely, CA, USA: Apress."},{"key":"5660_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-68856-3","volume-title":"Logical and relational learning","author":"L Raedt De","year":"2008","unstructured":"De Raedt, L. (2008). Logical and relational learning. Berlin: Cognitive Technologies, Springer."},{"key":"5660_CR12","doi-asserted-by":"crossref","unstructured":"De Raedt, L. (2012). Declarative modeling for machine learning and data mining. In: The European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, pp 2\u20133.","DOI":"10.1007\/978-3-642-33460-3_2"},{"key":"5660_CR13","unstructured":"De Raedt, L. (2015). Languages for learning and mining. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25\u201330, 2015 (pp. 4107\u20134111). USA.: Austin, Texas."},{"key":"5660_CR14","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1007\/3-540-45628-7_16","volume-title":"Computational logic: Logic programming and beyond, lecture notes in computer science","author":"M Denecker","year":"2002","unstructured":"Denecker, M., & Kakas, A. (2002). Abduction in logic programming. In A. Kakas & F. Sadri (Eds.), Computational logic: Logic programming and beyond, lecture notes in computer science (Vol. 2407, pp. 402\u2013436). Berlin, Heidelberg: Springer."},{"key":"5660_CR15","doi-asserted-by":"crossref","unstructured":"Eiter, T., Ianni, G., & Krennwallner, T. (2009). Answer set programming: A primer. In: 5th International Reasoning Web Summer School (RW 2009), Brixen\/Bressanone, Italy, August 30 \u2013 September 4, 2009, Springer, LNCS, vol 5689.","DOI":"10.1007\/978-3-642-03754-2_2"},{"key":"5660_CR16","volume-title":"Fundamentals of database systems","author":"R Elmasri","year":"2010","unstructured":"Elmasri, R., & Navathe, S. B. (2010). Fundamentals of database systems (6th ed.). Boston, MA, USA: Addison-Wesley Longman Publishing Co. Inc.","edition":"6"},{"issue":"1","key":"5660_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.is.2011.09.001","volume":"37","author":"W Fan","year":"2012","unstructured":"Fan, W., Geerts, F., & Zheng, L. (2012). View determinacy for preserving selected information in data transformations. Information Systems, 37(1), 1\u201312.","journal-title":"Information Systems"},{"key":"5660_CR18","unstructured":"Feige, U. (1996). A threshold of ln n for approximating set cover. In: Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing, ACM, New York, NY, USA, STOC \u201996, pp. 314\u2013318."},{"key":"5660_CR19","doi-asserted-by":"crossref","unstructured":"Flach, P. A., & Kakas, A. C. (2000). On the relation between abduction and inductive learning. In: D. M. Gabbay & R. Kruse (Eds.), Abductive reasoning and learning. Handbook of defeasible reasoning and uncertainty management systems (Vol. 4, pp. 1\u201333). Springer Netherlands","DOI":"10.1007\/978-94-017-1733-5_1"},{"key":"5660_CR20","doi-asserted-by":"crossref","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T., Schneider, M., & Ziller, S. (2011a). A portfolio solver for answer set programming: Preliminary report. In: Delgrande, J., Faber, WT (Eds.) Proceedings of the Eleventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR\u201911), Springer-Verlag, Lecture Notes in Artificial Intelligence, vol 6645, pp 352\u2013357","DOI":"10.1007\/978-3-642-20895-9_40"},{"issue":"2","key":"5660_CR21","doi-asserted-by":"crossref","first-page":"107","DOI":"10.3233\/AIC-2011-0491","volume":"24","author":"M Gebser","year":"2011","unstructured":"Gebser, M., Kaufmann, B., Kaminski, R., Ostrowski, M., Schaub, T., & Schneider, M. (2011b). Potassco: The potsdam answer set solving collection. AI Communications, 24(2), 107\u2013124.","journal-title":"AI Communications"},{"key":"5660_CR22","volume-title":"Answer set solving in practice. Synthesis lectures on artificial intelligence and machine learning","author":"M Gebser","year":"2012","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. (2012). Answer set solving in practice. Synthesis lectures on artificial intelligence and machine learning. San Rafael: Morgan and Claypool Publishers."},{"key":"5660_CR23","volume-title":"Association for the advancement of artificial intelligence","author":"M Gebser","year":"2013","unstructured":"Gebser, M., Kaufmann, B., Romero, J., Otero, R., Schaub, T., & Wanko, P. (2013). Domain-specific heuristics in answer set programming. In M. desJardins & M. L. Littman (Eds.), Association for the advancement of artificial intelligence. Palo Alto: AAAI Press."},{"key":"5660_CR24","unstructured":"Geerts, F., Goethals, B., & Mielik\u00e4inen, T. (2004). Tiling databases. In: E. Suzuki & S. Arikawa (Eds.), Discovery science: 7th international conference, DS 2004, Springer Berlin Heidelberg pp. 278\u2013289."},{"key":"5660_CR25","volume-title":"Matrix computations","author":"GH Golub","year":"1996","unstructured":"Golub, G. H., & Van Loan, C. F. (1996). Matrix computations (3rd ed.). Baltimore, MD, USA: Johns Hopkins University Press.","edition":"3"},{"issue":"36","key":"5660_CR26","doi-asserted-by":"crossref","first-page":"14,534","DOI":"10.1073\/pnas.1221839110","volume":"110","author":"PK Gopalan","year":"2013","unstructured":"Gopalan, P. K., & Blei, D. M. (2013). Efficient discovery of overlapping communities in massive networks. Proceedings of the National Academy of Sciences, 110(36), 14,534\u201314,539.","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"12\u201313","key":"5660_CR27","doi-asserted-by":"crossref","first-page":"1951","DOI":"10.1016\/j.artint.2011.05.002","volume":"175","author":"T Guns","year":"2011","unstructured":"Guns, T., Nijssen, S., & De Raedt, L. (2011). Itemset mining: A constraint programming perspective. Artificial Intelligence, 175(12\u201313), 1951\u20131983.","journal-title":"Artificial Intelligence"},{"key":"5660_CR28","unstructured":"Guns, T., Dries, A., Tack, G., Nijssen, S., & De Raedt, L. (2013a). Miningzinc: A modeling language for constraint-based mining. In: International Joint Conference on Artificial Intelligence, Beijing, China"},{"issue":"2","key":"5660_CR29","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1109\/TKDE.2011.204","volume":"25","author":"T Guns","year":"2013","unstructured":"Guns, T., Nijssen, S., & De Raedt, L. (2013b). k-pattern set mining under constraints. IEEE Transactions on Knowledge and Data Engineering, 25(2), 402\u2013418.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"2","key":"5660_CR30","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1109\/TKDE.2011.204","volume":"25","author":"T Guns","year":"2013","unstructured":"Guns, T., Nijssen, S., & De Raedt, L. (2013c). k-pattern set mining under constraints. IEEE Transactions on Knowledge and Data Engineering, 25(2), 402\u2013418.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"5660_CR31","doi-asserted-by":"crossref","unstructured":"Heath, I.J. (1971). Unacceptable file operations in a relational data base. In: Proceedings of the 1971 ACM SIGFIDET (Now SIGMOD) Workshop on Data Description, Access and Control, ACM, New York, NY, USA, SIGFIDET \u201971, pp. 19\u201333.","DOI":"10.1145\/1734714.1734717"},{"key":"5660_CR32","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1002\/(SICI)1520-6750(199809)45:6<615::AID-NAV5>3.0.CO;2-5","volume":"45","author":"DS Hochbaum","year":"1998","unstructured":"Hochbaum, D. S., & Pathria, A. (1998). Analysis of the greedy approach in problems of maximum k-coverage. Naval Research Logistics, 45, 615\u2013627.","journal-title":"Naval Research Logistics"},{"key":"5660_CR33","doi-asserted-by":"crossref","unstructured":"J\u00e4rvisalo, M. (2011). Itemset mining as a challenge application for answer set enumeration. In: Logic Programming and Non-Monotonic Reasoning, pp 304\u2013310.","DOI":"10.1007\/978-3-642-20895-9_35"},{"key":"5660_CR34","doi-asserted-by":"crossref","unstructured":"Jones, T.H., Song, I.Y., & Park, E.K. (1996). Ternary relationship decomposition and higher normal form structures derived from entity relationship conceptual modeling. In: Proceedings of the 1996 ACM 24th Annual Conference on Computer Science, ACM, New York, NY, USA, CSC \u201996, pp. 96\u2013104.","DOI":"10.1145\/228329.228340"},{"key":"5660_CR35","unstructured":"Kemp, C., Tenenbaum, J.B., Griffiths, T.L., Yamada, T., & Ueda, N. (2006). Learning systems of concepts with an infinite relational model. In: Proceedings of the 21th National Conference on Artificial Intelligence, AAAI Press, pp. 381\u2013388."},{"key":"5660_CR36","doi-asserted-by":"crossref","unstructured":"Kim, M., & Candan, K.S. (2011). Approximate tensor decomposition within a tensor-relational algebraic framework. In: Proceedings of the 20th ACM International Conference on Information and Knowledge Management, ACM, New York, NY, USA, CIKM \u201911, pp. 1737\u20131742.","DOI":"10.1145\/2063576.2063827"},{"key":"5660_CR37","doi-asserted-by":"crossref","unstructured":"Knobbe, A.J., & Ho, E.K.Y. (2006). Pattern teams. In: F\u00fcrnkranz J, Scheffer T, Spiliopoulou M (eds) Principles and practice of knowledge discovery in databases, Springer, Lecture Notes in Computer Science, vol 4213, pp. 577\u2013584.","DOI":"10.1007\/11871637_58"},{"key":"5660_CR38","unstructured":"Koehler, H. (2007). Domination normal form: Decomposing relational database schemas. In: Proceedings of the Thirtieth Australasian Conference on Computer Science - Volume 62, Australian Computer Society, Inc., Darlinghurst, Australia, Australia, ACSC \u201907, pp. 79\u201385."},{"key":"5660_CR39","doi-asserted-by":"crossref","unstructured":"Kok, S., & Domingos, P. (2007). Statistical predicate invention. In: Proceedings of The 24th International Conference on Machine Learning, pp. 433\u2013440.","DOI":"10.1145\/1273496.1273551"},{"key":"5660_CR40","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/1149114.1149117","volume":"7","author":"N Leone","year":"2002","unstructured":"Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., et al. (2002). The dlv system for knowledge representation and reasoning. ACM Transactions on Computational Logic, 7, 499\u2013562.","journal-title":"ACM Transactions on Computational Logic"},{"key":"5660_CR41","doi-asserted-by":"crossref","unstructured":"Li, T. (2005). A general model for clustering binary data. ACM SIGKDD (pp. 188\u2013197). New York, NY, USA: ACM.","DOI":"10.1145\/1081870.1081894"},{"key":"5660_CR42","first-page":"1594","volume":"8","author":"V Lifschitz","year":"2008","unstructured":"Lifschitz, V. (2008). What is answer set programming? Association for the Advancement of Artificial Intelligence, 8, 1594\u20131597.","journal-title":"Association for the Advancement of Artificial Intelligence"},{"key":"5660_CR43","unstructured":"Liu, B., Hsu, W., & Ma, Y. (1998). Integrating classification and association rule mining. In: ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 80\u201386."},{"key":"5660_CR44","doi-asserted-by":"crossref","unstructured":"Lu, H., Vaidya, J., & Atluri, V. (2008). Optimal boolean matrix decomposition: Application to role engineering. In: IEEE 24th ICDE, pp. 297\u2013306.","DOI":"10.1109\/ICDE.2008.4497438"},{"key":"5660_CR45","doi-asserted-by":"crossref","unstructured":"M\u00e9tivier, J.P., Boizumault, P., Cr\u00e9milleux, B., Khiari, M., & Loudni, S. (2012), A constraint language for declarative pattern discovery. In: Ossowski, S., Lecca, P. (eds) Proceedings of the ACM Symposium on Applied Computing, pp. 119\u2013125.","DOI":"10.1145\/2245276.2245302"},{"key":"5660_CR46","unstructured":"Miettinen, P. (2009). Matrix decomposition methods for data mining: computational complexity and algorithms. Department of Computer Science, series of publications A, report A-2009-4, University of Helsinki 2009 (Ph.D. thesis, monograph)."},{"key":"5660_CR47","doi-asserted-by":"crossref","unstructured":"Miettinen, P. (2012). Dynamic boolean matrix factorizations. In: Zaki, M.J., Siebes, A., Yu, J.X., Goethals, B., Webb, G.I., Wu, X. (eds). Proceedings of International Conference on Data Mining, IEEE Computer Society, pp. 519\u2013528.","DOI":"10.1109\/ICDM.2012.118"},{"issue":"10","key":"5660_CR48","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1109\/TKDE.2008.53","volume":"20","author":"P Miettinen","year":"2008","unstructured":"Miettinen, P., Mielik\u00e4inen, T., Gionis, A., Das, G., & Mannila, H. (2008). The discrete basis problem. IEEE Transactions on Knowledge and Data Engineering, 20(10), 1348\u20131362.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"5660_CR49","doi-asserted-by":"crossref","unstructured":"Miyata, Y., Furuhashi, T., & Uchikawa, Y. (1995). A study on fuzzy abductive inference. In: Proceedings of 1995 IEEE International Conference on Fuzzy Systems, Citeseer, vol.\u00a01, pp. 337\u2013342.","DOI":"10.1109\/FUZZY.1995.409701"},{"issue":"20","key":"5660_CR50","doi-asserted-by":"crossref","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(20), 629\u2013679.","journal-title":"The Journal of Logic Programming"},{"issue":"1","key":"5660_CR51","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10994-014-5471-y","volume":"100","author":"SH Muggleton","year":"2015","unstructured":"Muggleton, S. H., Lin, D., & Tamaddoni-Nezhad, A. (2015). Meta-interpretive learning of higher-order dyadic datalog: Predicate invention revisited. Machine Learning, 100(1), 49\u201373.","journal-title":"Machine Learning"},{"issue":"2","key":"5660_CR52","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1207\/s15516709cog1502_3","volume":"15","author":"D Osherson","year":"1991","unstructured":"Osherson, D., Stern, J., Wilkie, O., Stob, M., & Smith, E. (1991). Default probability. Cognitive Science, 15(2), 251\u2013269.","journal-title":"Cognitive Science"},{"issue":"2","key":"5660_CR53","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1002\/env.3170050203","volume":"5","author":"P Paatero","year":"1994","unstructured":"Paatero, P., & Tapper, U. (1994). Positive matrix factorization: A non-negative factor model with optimal utilization of error estimates of data values. Environmetrics, 5(2), 111\u2013126.","journal-title":"Environmetrics"},{"key":"5660_CR54","doi-asserted-by":"crossref","unstructured":"Paramonov, S., van Leeuwen, M., Denecker, M., & De Raedt, L. (2015). An exercise in declarative modeling for relational query mining. In: International Conference on Inductive Logic Programming, ILP, Kyoto, 20\u201322 August 2015, Springer","DOI":"10.1007\/978-3-319-40566-7_12"},{"key":"5660_CR55","doi-asserted-by":"crossref","unstructured":"Singh, A.P., & Gordon, G.J. (2008). Relational learning via collective matrix factorization. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, pp. 650\u2013658.","DOI":"10.1145\/1401890.1401969"},{"key":"5660_CR56","unstructured":"Van den Broeck, G., & Darwiche, A. (2013). On the complexity and approximation of binary evidence in lifted inference. In: The Neural Information Processing Systems, pp. 2868\u20132876."},{"key":"5660_CR57","unstructured":"Vojt\u00e1s, P. (1999). Fuzzy logic abduction. In: Proceedings of the EUSFLAT-ESTYLF Joint Conference, Palma de Mallorca, Spain, September 22\u201325, 1999, pp. 319\u2013322."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-017-5660-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-017-5660-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-017-5660-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T21:09:09Z","timestamp":1750799349000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-017-5660-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,8]]},"references-count":57,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["5660"],"URL":"https:\/\/doi.org\/10.1007\/s10994-017-5660-6","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2017,8,8]]}}}