{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T12:50:07Z","timestamp":1791204607085,"version":"4.2.0"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642387081","type":"print"},{"value":"9783642387098","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40991-2_18","type":"book-chapter","created":{"date-parts":[[2013,8,28]],"date-time":"2013-08-28T05:43:57Z","timestamp":1377668637000},"page":"272-287","source":"Crossref","is-referenced-by-count":7,"title":["An Analysis of Tensor Models for Learning on Structured Data"],"prefix":"10.1007","author":[{"given":"Maximilian","family":"Nickel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Volker","family":"Tresp","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Anthony, M., Harvey, M.: Linear Algebra: Concepts and Methods. Cambridge University Press (2012)","DOI":"10.1017\/CBO9780511844249"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Bader, B.W., Harshman, R.A., Kolda, T.G.: Temporal analysis of semantic graphs using ASALSAN. In: Seventh IEEE International Conference on Data Mining (ICDM 2007), Omaha, NE, USA, pp. 33\u201342 (2007)","DOI":"10.1109\/ICDM.2007.54"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Bordes, A., Weston, J., Collobert, R., Bengio, Y.: Learning structured embeddings of knowledge bases. In: Proceedings of the 25th Conference on Artificial Intelligence, San Francisco, USA (2011)","DOI":"10.1609\/aaai.v25i1.7917"},{"issue":"2","key":"18_CR4","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0169-7439(95)80060-M","volume":"28","author":"D.S. Burdick","year":"1995","unstructured":"Burdick, D.S.: An introduction to tensor products with applications to multiway data analysis. Chemometrics and Intelligent Laboratory Systems\u00a028(2), 229\u2013237 (1995)","journal-title":"Chemometrics and Intelligent Laboratory Systems"},{"issue":"6","key":"18_CR5","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1109\/JPROC.2009.2035722","volume":"98","author":"E.J. Candes","year":"2010","unstructured":"Candes, E.J., Plan, Y.: Matrix completion with noise. Proceedings of the IEEE\u00a098(6), 925\u2013936 (2010)","journal-title":"Proceedings of the IEEE"},{"issue":"6","key":"18_CR6","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"E.J. Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. Foundations of Computational Mathematics\u00a09(6), 717\u2013772 (2009)","journal-title":"Foundations of Computational Mathematics"},{"issue":"3","key":"18_CR7","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/BF02310791","volume":"35","author":"J.D. Carroll","year":"1970","unstructured":"Carroll, J.D., Chang, J.J.: Analysis of individual differences in multidimensional scaling via an n-way generalization of Eckart-Young decomposition. Psychometrika\u00a035(3), 283\u2013319 (1970)","journal-title":"Psychometrika"},{"issue":"3","key":"18_CR8","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1137\/070690729","volume":"30","author":"L. Lathauwer De","year":"2008","unstructured":"De Lathauwer, L.: Decompositions of a higher-order tensor in block termsPart II: definitions and uniqueness. SIAM Journal on Matrix Analysis and Applications\u00a030(3), 1033\u20131066 (2008)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"2","key":"18_CR9","doi-asserted-by":"crossref","first-page":"025010","DOI":"10.1088\/0266-5611\/27\/2\/025010","volume":"27","author":"S. Gandy","year":"2011","unstructured":"Gandy, S., Recht, B., Yamada, I.: Tensor completion and low-n-rank tensor recovery via convex optimization. Inverse Problems\u00a027(2), 025010 (2011)","journal-title":"Inverse Problems"},{"issue":"1","key":"18_CR10","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0167-9473(94)90132-5","volume":"18","author":"R.A. Harshman","year":"1994","unstructured":"Harshman, R.A., Lundy, M.E.: PARAFAC: parallel factor analysis. Computational Statistics & Data Analysis\u00a018(1), 39\u201372 (1994)","journal-title":"Computational Statistics & Data Analysis"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Hassoun, M.H.: Fundamentals of Artificial Neural Networks. MIT Press (1995)","DOI":"10.1109\/JPROC.1996.503146"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-21295-6_13","volume-title":"Inductive Logic Programming","author":"Y. Huang","year":"2011","unstructured":"Huang, Y., Tresp, V., Bundschus, M., Rettinger, A., Kriegel, H.-P.: Multivariate prediction for learning on the semantic web. In: Frasconi, P., Lisi, F.A. (eds.) ILP 2010. LNCS, vol.\u00a06489, pp. 92\u2013104. Springer, Heidelberg (2011)"},{"key":"18_CR13","first-page":"3176","volume-title":"Advances in Neural Information Processing Systems","author":"R. Jenatton","year":"2012","unstructured":"Jenatton, R., Le Roux, N., Bordes, A., Obozinski, G.: A latent factor model for highly multi-relational data. In: Advances in Neural Information Processing Systems, vol.\u00a025, pp. 3176\u20133184. MIT Press, Lake Tahoe (2012)"},{"issue":"3","key":"18_CR14","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"T.G. Kolda","year":"2009","unstructured":"Kolda, T.G., Bader, B.W.: Tensor decompositions and applications. SIAM Review\u00a051(3), 455\u2013500 (2009)","journal-title":"SIAM Review"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Kramer, S., Lavrac, N., Flach, P.: Propositionalization approaches to relational data mining. Springer-Verlag New York, Inc. (2001)","DOI":"10.1007\/978-3-662-04599-2_11"},{"key":"18_CR16","unstructured":"Liu, J., Musialski, P., Wonka, P., Ye, J.: Tensor completion for estimating missing values in visual data. In: 2009 IEEE 12th International Conference on Computer Vision, pp. 2114\u20132121 (2009)"},{"key":"18_CR17","first-page":"1097","volume-title":"Advances in Neural Information Processing Systems","author":"M. Mohri","year":"2009","unstructured":"Mohri, M., Rostamizadeh, A.: Rademacher complexity bounds for non-iid processes. In: Advances in Neural Information Processing Systems, vol.\u00a021, pp. 1097\u20131104. MIT Press, Cambridge (2009)"},{"key":"18_CR18","first-page":"809","volume-title":"Proceedings of the 28th International Conference on Machine Learning","author":"M. Nickel","year":"2011","unstructured":"Nickel, M., Tresp, V., Kriegel, H.P.: A three-way model for collective learning on multi-relational data. In: Proceedings of the 28th International Conference on Machine Learning, pp. 809\u2013816. ACM, Bellevue (2011)"},{"key":"18_CR19","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1145\/2187836.2187874","volume-title":"Proceedings of the 21st International Conference on World Wide Web","author":"M. Nickel","year":"2012","unstructured":"Nickel, M., Tresp, V., Kriegel, H.P.: Factorizing YAGO: scalable machine learning for linked data. In: Proceedings of the 21st International Conference on World Wide Web, pp. 271\u2013280. ACM, New York (2012)"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Rendle, S., Freudenthaler, C., Schmidt-Thieme, L.: Factorizing personalized markov chains for next-basket recommendation. In: Proceedings of the 19th International Conference on World Wide Web, pp. 811\u2013820. ACM (2010)","DOI":"10.1145\/1772690.1772773"},{"issue":"4","key":"18_CR21","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s13278-012-0069-5","volume":"2","author":"A. Rettinger","year":"2012","unstructured":"Rettinger, A., Wermser, H., Huang, Y., Tresp, V.: Context-aware tensor decomposition for relation prediction in social networks. Social Network Analysis and Mining\u00a02(4), 373\u2013385 (2012)","journal-title":"Social Network Analysis and Mining"},{"issue":"7","key":"18_CR22","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1109\/LSP.2011.2151856","volume":"18","author":"M. Signoretto","year":"2011","unstructured":"Signoretto, M., Van de Plas, R., De Moor, B., Suykens, J.A.: Tensor versus matrix completion: a comparison with application to spectral data. IEEE Signal Processing Letters\u00a018(7), 403\u2013406 (2011)","journal-title":"IEEE Signal Processing Letters"},{"key":"18_CR23","unstructured":"Srebro, N.: Learning with matrix factorizations. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA, USA (2004)"},{"key":"18_CR24","first-page":"1321","volume-title":"Advances in Neural Information Processing Systems","author":"N. Srebro","year":"2005","unstructured":"Srebro, N., Alon, N., Jaakkola, T.S.: Generalization error bounds for collaborative prediction with low-rank matrices. In: Advances in Neural Information Processing Systems, vol.\u00a017, pp. 1321\u20131328. MIT Press, Cambridge (2005)"},{"key":"18_CR25","first-page":"1010","volume":"arXiv","author":"R. Tomioka","year":"2010","unstructured":"Tomioka, R., Hayashi, K., Kashima, H.: Estimation of low-rank tensors via convex optimization. arXiv preprint arXiv:1010.0789 (2010)","journal-title":"arXiv preprint"},{"key":"18_CR26","unstructured":"Tomioka, R., Suzuki, T., Hayashi, K., Kashima, H.: Statistical performance of convex tensor decomposition. In: Advances in Neural Information Processing Systems, vol.\u00a024, pp. 972\u2013980 (2012)"},{"issue":"1","key":"18_CR27","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1090\/S0002-9947-1968-0226281-1","volume":"133","author":"H.E. Warren","year":"1968","unstructured":"Warren, H.E.: Lower bounds for approximation by nonlinear manifolds. Transactions of the American Mathematical Society\u00a0133(1), 167\u2013178 (1968)","journal-title":"Transactions of the American Mathematical Society"},{"key":"18_CR28","doi-asserted-by":"crossref","unstructured":"Wolf, L., Jhuang, H., Hazan, T.: Modeling appearances with low-rank SVM. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 1\u20136 (2007)","DOI":"10.1109\/CVPR.2007.383099"}],"container-title":["Lecture Notes in Computer Science","Advanced Information Systems Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40991-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T04:22:00Z","timestamp":1688444520000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40991-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387081","9783642387098"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40991-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}