{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T10:04:41Z","timestamp":1769076281893,"version":"3.49.0"},"reference-count":31,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1109\/icde.2016.7498292","type":"proceedings-article","created":{"date-parts":[[2016,6,25]],"date-time":"2016-06-25T11:36:34Z","timestamp":1466854594000},"page":"811-822","source":"Crossref","is-referenced-by-count":41,"title":["SCouT: Scalable coupled matrix-tensor factorization - algorithm and discoveries"],"prefix":"10.1109","author":[{"given":"ByungSoo","family":"Jeon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Inah","family":"Jeon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lee","family":"Sael","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"U","family":"Kang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.89"},{"key":"ref30","article-title":"Scalable boolean tensor factorizations using random walks","author":"erd\u00f6s","year":"2013","journal-title":"CoRR"},{"key":"ref10","first-page":"59","article-title":"Large scale tensor decompositions: Algorithmic developments and applications","volume":"36","author":"papalexakis","year":"2013","journal-title":"IEEE Data Eng Bull"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.bdr.2015.01.004"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973440.14"},{"key":"ref13","article-title":"Foundations of the parafac procedure: model and conditions for an explanatory multi-mode factor analysis","volume":"16","author":"harshman","year":"1970","journal-title":"UCLA Working Papers in Phonetics"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113355"},{"key":"ref15","article-title":"Gnu octave","year":"0"},{"key":"ref16","article-title":"Microsoft academic graph dataset","year":"0"},{"key":"ref17","article-title":"Movielens dataset","year":"0"},{"key":"ref18","article-title":"Yelp dataset","year":"0"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2014.78"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2396809"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/1099-128X(200005\/06)14:3<301::AID-CEM594>3.3.CO;2-8"},{"key":"ref27","article-title":"A fast least squares algorithm for separating trilinear mixtures","author":"bro","year":"1999","journal-title":"Proc 2nd Int Workshop Independ Compon Anal Blind Signal Separat"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972771.14"},{"key":"ref6","article-title":"All-at-once optimization for coupled matrix and tensor factorizations","author":"acar","year":"2011","journal-title":"MLG'11 Proceedings of Mining and Learning with Graphs"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33460-3_39"},{"key":"ref5","article-title":"Link prediction via generalized coupled tensor factorisation","author":"ermis","year":"2012","journal-title":"CoRR"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/060676489"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973440.13"},{"key":"ref2","article-title":"Collaborative filtering meets mobile recommendation: A user-centered approach","author":"zheng","year":"2010","journal-title":"AAAI' 2010"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339583"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557080"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04930-9_14"},{"key":"ref22","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v24i1.7519","article-title":"Toward an architecture for never-ending language learning","author":"carlson","year":"2010","journal-title":"AAAI"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2011.80"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.169"},{"key":"ref23","article-title":"The tophits model for higher-order web link analysis","author":"kolda","year":"2006","journal-title":"Workshop on Link Analysis Counterterrorism and Security"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/78.824675"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.89"}],"event":{"name":"2016 IEEE 32nd International Conference on Data Engineering (ICDE)","location":"Helsinki, Finland","start":{"date-parts":[[2016,5,16]]},"end":{"date-parts":[[2016,5,20]]}},"container-title":["2016 IEEE 32nd International Conference on Data Engineering (ICDE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7491900\/7498210\/07498292.pdf?arnumber=7498292","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T22:00:57Z","timestamp":1718661657000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7498292\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/icde.2016.7498292","relation":{},"subject":[],"published":{"date-parts":[[2016,5]]}}}