{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T09:40:04Z","timestamp":1739353204663,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642044137"},{"type":"electronic","value":"9783642044144"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04414-4_30","type":"book-chapter","created":{"date-parts":[[2009,9,22]],"date-time":"2009-09-22T08:46:05Z","timestamp":1253609165000},"page":"368-383","source":"Crossref","is-referenced-by-count":24,"title":["Approximation Algorithms for Tensor Clustering"],"prefix":"10.1007","author":[{"given":"Stefanie","family":"Jegelka","sequence":"first","affiliation":[]},{"given":"Suvrit","family":"Sra","sequence":"additional","affiliation":[]},{"given":"Arindam","family":"Banerjee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Banerjee, A., Basu, S., Merugu, S.: Multi-way Clustering on Relation Graphs. In: SIAM Conf. Data Mining, SDM (2007)","DOI":"10.1137\/1.9781611972771.14"},{"key":"30_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/11744085_46","volume-title":"Computer Vision \u2013 ECCV 2006","author":"A. Shashua","year":"2006","unstructured":"Shashua, A., Zass, R., Hazan, T.: Multi-way Clustering Using Super-Symmetric Non-negative Tensor Factorization. In: Leonardis, A., Bischof, H., Pinz, A. (eds.) ECCV 2006. LNCS, vol.\u00a03954, pp. 595\u2013608. Springer, Heidelberg (2006)"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Dhillon, I.S., Mallela, S., Modha, D.S.: Information-theoretic co-clustering. In: KDD, pp. 89\u201398 (2003)","DOI":"10.1145\/956750.956764"},{"key":"30_CR4","first-page":"1919","volume":"8","author":"A. Banerjee","year":"2007","unstructured":"Banerjee, A., Dhillon, I.S., Ghosh, J., Merugu, S., Modha, D.S.: A Generalized Maximum Entropy Approach to Bregman Co-clustering and Matrix Approximation. JMLR\u00a08, 1919\u20131986 (2007)","journal-title":"JMLR"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Ackermann, M.R., Bl\u00f6mer, J.: Coresets and Approximate Clustering for Bregman Divergences. In: ACM-SIAM Symp. on Disc. Alg., SODA (2009)","DOI":"10.1137\/1.9781611973068.118"},{"key":"30_CR6","unstructured":"Ackermann, M.R., Bl\u00f6mer, J., Sohler, C.: Clustering for metric and non-metric distance measures. In: ACM-SIAM Symp. on Disc. Alg. (SODA) (April 2008)"},{"key":"30_CR7","unstructured":"Arthur, D., Vassilvitskii, S.: k-means++: The Advantages of Careful Seeding. In: ACM-SIAM Symp. on Discete Algorithms (SODA), pp. 1027\u20131035 (2007)"},{"key":"30_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-540-87481-2_11","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"R. Nock","year":"2008","unstructured":"Nock, R., Luosto, P., Kivinen, J.: Mixed Bregman clustering with approximation guarantees. In: Daelemans, W., Goethals, B., Morik, K. (eds.) ECML \/ PKDD 2008, Part II. LNCS (LNAI), vol.\u00a05212, pp. 154\u2013169. Springer, Heidelberg (2008)"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Sra, S., Jegelka, S., Banerjee, A.: Approximation algorithms for Bregman clustering, co-clustering and tensor clustering. Technical Report 177, MPI for Biological Cybernetics (2008)","DOI":"10.1007\/978-3-642-04414-4_30"},{"issue":"2-3","key":"30_CR10","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10994-006-0587-3","volume":"66","author":"S. Ben-David","year":"2007","unstructured":"Ben-David, S.: A framework for statistical clustering with constant time approximation algorithms for K-median and K-means clustering. Mach. Learn.\u00a066(2-3), 243\u2013257 (2007)","journal-title":"Mach. Learn."},{"issue":"2","key":"30_CR11","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.ipl.2008.03.013","volume":"108","author":"K. Puolam\u00e4ki","year":"2008","unstructured":"Puolam\u00e4ki, K., Hanhij\u00e4rvi, S., Garriga, G.C.: An approximation ratio for biclustering. Inf. Process. Letters\u00a0108(2), 45\u201349 (2008)","journal-title":"Inf. Process. Letters"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Anagnostopoulos, A., Dasgupta, A., Kumar, R.: Approximation algorithms for co-clustering. In: Symp. on Principles of Database Systems, PODS (2008)","DOI":"10.1145\/1376916.1376945"},{"key":"30_CR13","unstructured":"Zha, H., Ding, C., Li, T., Zhu, S.: Workshop on Data Mining using Matrices and Tensors. In: KDD (2008)"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Hasan, M., Velazquez-Armendariz, E., Pellacini, F., Bala, K.: Tensor Clustering for Rendering Many-Light Animations. In: Eurographics Symp. on Rendering, vol.\u00a027 (2008)","DOI":"10.1111\/j.1467-8659.2008.01248.x"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Kolda, T.G., Bader, B.W.: Tensor Decompositions and Applications. SIAM Review\u00a051(3) (to appear, 2009)","DOI":"10.1137\/07070111X"},{"issue":"337","key":"30_CR16","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1080\/01621459.1972.10481214","volume":"67","author":"J.A. Hartigan","year":"1972","unstructured":"Hartigan, J.A.: Direct clustering of a data matrix. J. of the Am. Stat. Assoc.\u00a067(337), 123\u2013129 (1972)","journal-title":"J. of the Am. Stat. Assoc."},{"key":"30_CR17","first-page":"93","volume-title":"Proc. ISMB","author":"Y. Cheng","year":"2000","unstructured":"Cheng, Y., Church, G.: Biclustering of expression data. In: Proc. ISMB, pp. 93\u2013103. AAAI Press, Menlo Park (2000)"},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"Dhillon, I.S.: Co-clustering documents and words using bipartite spectral graph partitioning. In: KDD, pp. 269\u2013274 (2001)","DOI":"10.1145\/502512.502550"},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"Bekkerman, R., El-Yaniv, R., McCallum, A.: Multi-way distributional clustering via pairwise interactions. In: ICML (2005)","DOI":"10.1145\/1102351.1102357"},{"key":"30_CR20","doi-asserted-by":"crossref","unstructured":"Agarwal, S., Lim, J., Zelnik-Manor, L., Perona, P., Kriegman, D., Belongie, S.: Beyond pairwise clustering. In: IEEE CVPR (2005)","DOI":"10.1109\/CVPR.2005.89"},{"key":"30_CR21","doi-asserted-by":"crossref","unstructured":"Govindu, V.M.: A tensor decomposition for geometric grouping and segmentation. In: IEEE CVPR (2005)","DOI":"10.1109\/CVPR.2005.50"},{"key":"30_CR22","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4175.001.0001","volume-title":"Learning with Kernels","author":"B. Sch\u00f6lkopf","year":"2001","unstructured":"Sch\u00f6lkopf, B., Smola, A.: Learning with Kernels. MIT Press, Cambridge (2001)"},{"key":"30_CR23","unstructured":"Hein, M., Bousquet, O.: Hilbertian metrics and positive definite kernels on probability measures. In: AISTATS (2005)"},{"key":"30_CR24","volume-title":"Parallel Optimization: Theory, Algorithms, and Applications","author":"Y. Censor","year":"1997","unstructured":"Censor, Y., Zenios, S.A.: Parallel Optimization: Theory, Algorithms, and Applications. Oxford University Press, Oxford (1997)"},{"issue":"6","key":"30_CR25","first-page":"1705","volume":"6","author":"A. Banerjee","year":"2005","unstructured":"Banerjee, A., Merugu, S., Dhillon, I.S., Ghosh, J.: Clustering with Bregman Divergences. JMLR\u00a06(6), 1705\u20131749 (2005)","journal-title":"JMLR"},{"issue":"3","key":"30_CR26","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1137\/06066518X","volume":"30","author":"V. Silva de","year":"2008","unstructured":"de Silva, V., Lim, L.H.: Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem. SIAM J. Matrix Anal. & Appl.\u00a030(3), 1084\u20131127 (2008)","journal-title":"SIAM J. Matrix Anal. & Appl."},{"key":"30_CR27","doi-asserted-by":"crossref","unstructured":"Jegelka, S., Sra, S., Banerjee, A.: Approximation algorithms for Bregman co-clustering and tensor clustering (2009); arXiv:cs.DS\/0812.0389v3","DOI":"10.1007\/978-3-642-04414-4_30"},{"key":"30_CR28","unstructured":"Chaudhuri, K., McGregor, A.: Finding metric structure in information theoretic clustering. In: Conf. on Learning Theory, COLT (July 2008)"},{"key":"30_CR29","doi-asserted-by":"crossref","unstructured":"Cho, H., Dhillon, I.S., Guan, Y., Sra, S.: Minimum Sum Squared Residue based Co-clustering of Gene Expression data. In: SDM, 114\u2013125 (2004)","DOI":"10.1137\/1.9781611972740.11"},{"key":"30_CR30","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1101\/gr.648603","volume":"13","author":"Y. Kluger","year":"2003","unstructured":"Kluger, Y., Basri, R., Chang, J.T.: Spectral biclustering of microarray data: Coclustering genes and conditions. Genome Research\u00a013, 703\u2013716 (2003)","journal-title":"Genome Research"},{"issue":"3","key":"30_CR31","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1109\/TCBB.2007.70268","volume":"5","author":"H. Cho","year":"2008","unstructured":"Cho, H., Dhillon, I.: Coclustering of human cancer microarrays using minimum sum-squared residue coclustering. IEEE\/ACM Tran. Comput. Biol. Bioinf.\u00a05(3), 385\u2013400 (2008)","journal-title":"IEEE\/ACM Tran. Comput. Biol. Bioinf."},{"key":"30_CR32","doi-asserted-by":"crossref","unstructured":"Baranzini, S.E., et al: Transcription-based prediction of response to IFN\u03b2 using supervised computational methods. PLoS Biology\u00a03(1) (2004)","DOI":"10.1371\/journal.pbio.0030002"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04414-4_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T08:44:39Z","timestamp":1739349879000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04414-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642044137","9783642044144"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04414-4_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}