{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T21:40:08Z","timestamp":1741470008099,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642233999"},{"type":"electronic","value":"9783642234002"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23400-2_33","type":"book-chapter","created":{"date-parts":[[2011,8,17]],"date-time":"2011-08-17T11:34:15Z","timestamp":1313580855000},"page":"353-365","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Distributed Scalable Collaborative Filtering Algorithm"],"prefix":"10.1007","author":[{"given":"Ankur","family":"Narang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhinav","family":"Srivastava","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naga Praveen Kumar","family":"Katta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Ampazis, N.: Collaborative filtering via concept decomposition on the netflix dataset. In: ECAI, pp. 143\u2013175 (2008)","key":"33_CR1"},{"issue":"1","key":"33_CR2","first-page":"1919","volume":"8","author":"A. Banerjee","year":"2007","unstructured":"Banerjee, A., Dhillon, I., Ghosh, J., Merugu, S., Modha, D.S.: A generalized maximum entropy approach to bregman co-clustering and matrix approximation. Journal of Machine Learning Research\u00a08(1), 1919\u20131986 (2007)","journal-title":"Journal of Machine Learning Research"},{"unstructured":"Bennett, J., Lanning, S.: The netflix prize. In: KDD-Cup and Workshop at the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2007)","key":"33_CR3"},{"doi-asserted-by":"crossref","unstructured":"Brand, M.: Fast online svd revisions for lightweight recommender systems. In: SIAM International Conference on Data Mining, pp. 37\u201348 (2003)","key":"33_CR4","DOI":"10.1137\/1.9781611972733.4"},{"unstructured":"Breese, J.S., Heckerman, D., Kadie, C.: Empirical analysis of predictive algorithms for collaborative $\\text{filtering}$ . In: Fourteenth International Conference on Uncertainty in Artificial Intelligence, pp. 43\u201352 (1998)","key":"33_CR5"},{"doi-asserted-by":"crossref","unstructured":"Daruru, S., Marin, N.M., Walker, M., Ghosh, J.: Pervasive parallelism in data mining: dataflow solution to co-clustering large and sparse netflix data. In: 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1115\u20131124 (2009)","key":"33_CR6","DOI":"10.1145\/1557019.1557140"},{"unstructured":"Dhillon, I.S., Modha, D.S.: Concept decompositions for large sparse text data using clustering. In: Machine Learning, pp. 143\u2013175 (1999)","key":"33_CR7"},{"doi-asserted-by":"crossref","unstructured":"George, T., Merugu, S.: A scalable collaborative filtering framework based on co-clustering. In: Fifth International Conference on Data Mining, pp. 625\u2013628 (2005)","key":"33_CR8","DOI":"10.1109\/ICDM.2005.14"},{"key":"33_CR9","volume-title":"Matrix computations","author":"G.H. Golub","year":"1996","unstructured":"Golub, G.H., Loan, C.F.V.: Matrix computations. The Johns Hopkins University Press, Baltimore (1996)"},{"unstructured":"Hsu, K.-W., Banerjee, A., Srivastava, J.: I\/o scalable bregman co-clustering. In: Proceedings of the 12th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining (2008)","key":"33_CR10"},{"doi-asserted-by":"crossref","unstructured":"Mallela, I.D.S., Modha, D.: Information-theoretic co-clustering. In: Proceedings of the 9th International Conference on Knowledge Discovery and Data Mining, pp. 89\u201398 (2003)","key":"33_CR11","DOI":"10.1145\/956750.956764"},{"key":"33_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-642-13119-6_3","volume-title":"Algorithms and Architectures for Parallel Processing","author":"B. Kwon","year":"2010","unstructured":"Kwon, B., Cho, H.: Scalable co-clustering algorithms. In: Hsu, C.-H., Yang, L.T., Park, J.H., Yeo, S.-S. (eds.) ICA3PP 2010. LNCS, vol.\u00a06081, pp. 32\u201343. Springer, Heidelberg (2010)"},{"issue":"3","key":"33_CR13","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/245108.245121","volume":"40","author":"P. Resnick","year":"1997","unstructured":"Resnick, P., Varian, H.R.: Recommender systems - introduction to special section. Comm. ACM\u00a040(3), 56\u201358 (1997)","journal-title":"Comm. ACM"},{"doi-asserted-by":"crossref","unstructured":"Sarwar, B., Karypis, G., Konstan, J., Reidl, J.: Application of dimensionality reduction in recommender systems: a case study. In: WebKDD Workshop (2000)","key":"33_CR14","DOI":"10.21236\/ADA439541"},{"doi-asserted-by":"crossref","unstructured":"Sarwar, B.M., Karypis, G., Konstan, J.A., Riedl, J.: Analysis of recommendation algorithms for e-commerce. In: ACM Conference on Electronic Commerce, pp. 158\u2013167 (2000)","key":"33_CR15","DOI":"10.1145\/352871.352887"},{"doi-asserted-by":"crossref","unstructured":"Schafer, J.B., Konstan, J.A., Riedi, J.: Recommender systems in e-commerce. In: ACM Conference on Electronic Commerce, pp. 158\u2013166 (1999)","key":"33_CR16","DOI":"10.1145\/336992.337035"},{"unstructured":"Srebro, N., Jaakkola, T.: Weighted low rank approximation. In: Twentieth International Conference on Machine Learning, pp. 720\u2013728 (2003)","key":"33_CR17"},{"doi-asserted-by":"crossref","unstructured":"Zhou, Y., Wilkinson, D., Schreiber, R., Pan, R.: Large scale parallel collaborative filtering for the netflix prize. In: Fourth International Conference on Algorithmic Aspects in Information and Management, pp. 337\u2013348 (2008)","key":"33_CR18","DOI":"10.1007\/978-3-540-68880-8_32"},{"doi-asserted-by":"crossref","unstructured":"Ziegler, C.N., McNee, S.M., Konstan, J.A., Lausen, G.: Improving recommendation lists through topic diversification. In: Fourteenth International World Wide Web Conference (2005)","key":"33_CR19","DOI":"10.1145\/1060745.1060754"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2011 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23400-2_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T21:00:40Z","timestamp":1741467640000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23400-2_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642233999","9783642234002"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23400-2_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}