{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T13:49:42Z","timestamp":1768398582859,"version":"3.49.0"},"reference-count":38,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2010,10,1]],"date-time":"2010-10-01T00:00:00Z","timestamp":1285891200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["IIS-0713142IIS-1016614"],"award-info":[{"award-number":["IIS-0713142IIS-1016614"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2010,10]]},"abstract":"<jats:p>For difficult classification or regression problems, practitioners often segment the data into relatively homogeneous groups and then build a predictive model for each group. This two-step procedure usually results in simpler, more interpretable and actionable models without any loss in accuracy. In this work, we consider problems such as predicting customer behavior across products, where the independent variables can be naturally partitioned into two sets, that is, the data is dyadic in nature. A pivoting operation now results in the dependent variable showing up as entries in a \u201ccustomer by product\u201d data matrix. We present the Simultaneous CO-clustering And Learning (SCOAL) framework, based on the key idea of interleaving co-clustering and construction of prediction models to iteratively improve both cluster assignment and fit of the models. This algorithm provably converges to a local minimum of a suitable cost function. The framework not only generalizes co-clustering and collaborative filtering to model-based co-clustering, but can also be viewed as simultaneous co-segmentation and classification or regression, which is typically better than independently clustering the data first and then building models. Moreover, it applies to a wide range of bi-modal or multimodal data, and can be easily specialized to address classification and regression problems. We demonstrate the effectiveness of our approach on both these problems through experimentation on a variety of datasets.<\/jats:p>","DOI":"10.1145\/1839490.1839492","type":"journal-article","created":{"date-parts":[[2010,10,19]],"date-time":"2010-10-19T12:36:24Z","timestamp":1287491784000},"page":"1-31","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["SCOAL"],"prefix":"10.1145","volume":"4","author":[{"given":"Meghana","family":"Deodhar","sequence":"first","affiliation":[{"name":"University of Texas at Austin, Austin, TX"}]},{"given":"Joydeep","family":"Ghosh","sequence":"additional","affiliation":[{"name":"University of Texas at Austin, Austin, TX"}]}],"member":"320","published-online":{"date-parts":[[2010,10,22]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557029"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281199"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1314498.1314563"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1046920.1194902"},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the International Conference on Neural Networks to Power System (ANNPS). 407--412","author":"Baumann T."},{"key":"e_1_2_1_6_1","unstructured":"Breiman L. Friedman J. H. Olshen R. A. and Stone C. J. 1984. Classification and Regression Trees. Wadsworth Belmont CA.  Breiman L. Friedman J. H. Olshen R. A. and Stone C. J. 1984. Classification and Regression Trees. Wadsworth Belmont CA."},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of the International Conference on Intelligent Systems for Molecular Biology (ICMB). 93--103","author":"Cheng Y."},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of the SIAM Conference on Data Mining (SDM).","author":"Cho H."},{"key":"e_1_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Deodhar M. and Ghosh J. 2007. A framework for simultaneous co-clustering and learning from complex data. Department of Electrical and Computer Engineering University of Texas at Austin IDEAL-2007-08 http:\/\/www.lans.ece.utexas.edu\/papers\/techreports\/deodhar07Coclust. pdf.  Deodhar M. and Ghosh J. 2007. A framework for simultaneous co-clustering and learning from complex data. Department of Electrical and Computer Engineering University of Texas at Austin IDEAL-2007-08 http:\/\/www.lans.ece.utexas.edu\/papers\/techreports\/deodhar07Coclust. pdf.","DOI":"10.1145\/1281192.1281222"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557052"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956764"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1049\/ip-c.1993.0046"},{"key":"e_1_2_1_13_1","volume-title":"Fast sparse regression and classification. Tech. rep","author":"Friedman J."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.14"},{"key":"e_1_2_1_15_1","unstructured":"Gill P. E. Murray W. and Wright M. H. 1981. Practical Optimization. Academic Press Harcourt Brace and Company London.  Gill P. E. Murray W. and Wright M. H. 1981. Practical Optimization. Academic Press Harcourt Brace and Company London."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1177\/002224378702400201"},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Hastie T. Tibshirani R. and Friedman J. 2001. The Elements of Statistical Learning. Springer New York.  Hastie T. Tibshirani R. and Friedman J. 2001. The Elements of Statistical Learning. Springer New York.","DOI":"10.1007\/978-0-387-21606-5"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/312624.312682"},{"key":"e_1_2_1_19_1","volume-title":"Robust Statistics","author":"Huber P. J."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1991.3.1.79"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btg039"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00993958"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007961016262"},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the 20th International Conference on Machine Learning (ICML).","author":"Lee W."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-6-76"},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN","author":"Lokmic L.","year":"2000"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2004.2"},{"key":"e_1_2_1_28_1","doi-asserted-by":"crossref","unstructured":"McCullagh P. and Nelder J. A. 1983. Generalized Linear Models. Chapman and Hall London.  McCullagh P. and Nelder J. A. 1983. Generalized Linear Models. Chapman and Hall London.","DOI":"10.1007\/978-1-4899-3244-0"},{"key":"e_1_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Neal R. M. and Hinton G. E. 1998. A view of the EM algorithm that justifies incremental sparse and other variants. In Learning in Graphical Models MIT Press 355--368.   Neal R. M. and Hinton G. E. 1998. A view of the EM algorithm that justifies incremental sparse and other variants. In Learning in Graphical Models MIT Press 355--368.","DOI":"10.1007\/978-94-011-5014-9_12"},{"key":"e_1_2_1_30_1","volume-title":"Proceedings of the Itawaii International Conference on Systems Science (HICSS-34)","author":"Oh K."},{"key":"e_1_2_1_31_1","volume-title":"Proceedings of the 5th Australian Joint Conference on Artificial Intelligence. World Scientific, 343--348","author":"Quinlan J. R.","year":"1992"},{"key":"e_1_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Ramamurti V. and Ghosh J. 1998. On the use of localized gating in mixtures of experts networks. (invited paper) In Proceedings of the SPIE Conference on Applications and Science of Computational Intelligence. 24--35.  Ramamurti V. and Ghosh J. 1998. On the use of localized gating in mixtures of experts networks. (invited paper) In Proceedings of the SPIE Conference on Applications and Science of Computational Intelligence. 24--35.","DOI":"10.1117\/12.304812"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1177\/002224379903600407"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2003.822270"},{"key":"e_1_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Sharkey A. 1996. On combining artificial neural networks. Conn. Sci. 8 3\/4 299--314.  Sharkey A. 1996. On combining artificial neural networks. Conn. Sci. 8 3\/4 299--314.","DOI":"10.1080\/095400996116785"},{"key":"e_1_2_1_36_1","volume-title":"Proceedings of the 9th European Conference on Machine Learning. 128--137","author":"Wang Y."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1177\/002224379102800401"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/11539902_165"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1839490.1839492","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1839490.1839492","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:22:35Z","timestamp":1750245755000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1839490.1839492"}},"subtitle":["A framework for simultaneous co-clustering and learning from complex data"],"short-title":[],"issued":{"date-parts":[[2010,10]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,10]]}},"alternative-id":["10.1145\/1839490.1839492"],"URL":"https:\/\/doi.org\/10.1145\/1839490.1839492","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10]]},"assertion":[{"value":"2009-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2009-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-10-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}