{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:01:55Z","timestamp":1761292915821},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642302169"},{"type":"electronic","value":"9783642302176"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30217-6_49","type":"book-chapter","created":{"date-parts":[[2012,5,9]],"date-time":"2012-05-09T10:14:58Z","timestamp":1336558498000},"page":"591-603","source":"Crossref","is-referenced-by-count":2,"title":["Unsupervised Sparse Matrix Co-clustering for Marketing and Sales Intelligence"],"prefix":"10.1007","author":[{"given":"Anastasios","family":"Zouzias","sequence":"first","affiliation":[]},{"given":"Michail","family":"Vlachos","sequence":"additional","affiliation":[]},{"given":"Nikolaos M.","family":"Freris","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"49_CR1","doi-asserted-by":"crossref","unstructured":"Anagnostopoulos, A., Dasgupta, A., Kumar, R.: Approximation Algorithms for co-Clustering. In: Proceedings of ACM Symposium on Principles of Database Systems (PODS), pp. 201\u2013210 (2008)","DOI":"10.1145\/1376916.1376945"},{"key":"49_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1502793.1502794","volume":"56","author":"S. Arora","year":"2009","unstructured":"Arora, S., Rao, S., Vazirani, U.: Expander Flows, Geometric Embeddings and Graph Partitioning. J. ACM\u00a056, 5:1\u20135:37 (2009)","journal-title":"J. ACM"},{"key":"49_CR3","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Papadimitriou, S., Modha, D.S., Faloutsos, C.: Fully Automatic Cross-associations. In: Proc. of International Conference on Knowledge Discovery and Data Mining (KDD), pp. 79\u201388 (2004)","DOI":"10.1145\/1014052.1014064"},{"key":"49_CR4","doi-asserted-by":"crossref","unstructured":"Cho, H., Dhillon, I.S., Guan, Y., Sra, S.: Minimum Sum-Squared Residue co-Clustering of Gene Expression Data. In: Proc. of SIAM Conference on Data Mining, SDM (2004)","DOI":"10.1137\/1.9781611972740.11"},{"key":"49_CR5","unstructured":"Chung, F.R.K.: Spectral Graph Theory. American Mathematical Society (1994)"},{"key":"49_CR6","doi-asserted-by":"crossref","unstructured":"Dhillon, I.S.: Co-Clustering Documents and Words using Bipartite Spectral Graph Partitioning. In: Proc. of International Conference on Knowledge Discovery and Data Mining (KDD), pp. 269\u2013274 (2001)","DOI":"10.1145\/502512.502550"},{"key":"49_CR7","doi-asserted-by":"crossref","unstructured":"Dhillon, I.S., Mallela, S., Modha, D.S.: Information-theoretic co-Clustering. In: Proc. of International Conference on Knowledge Discovery and Data Mining (KDD), pp. 89\u201398 (2003)","DOI":"10.1145\/956750.956764"},{"issue":"98","key":"49_CR8","doi-asserted-by":"crossref","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","volume":"23","author":"M. Fiedler","year":"1973","unstructured":"Fiedler, M.: Algebraic Connectivity of Graphs. Czechoslovak Mathematical Journal\u00a023(98), 298\u2013305 (1973)","journal-title":"Czechoslovak Mathematical Journal"},{"key":"49_CR9","doi-asserted-by":"crossref","unstructured":"Guattery, S., Miller, G.L.: On the Performance of Spectral Graph Partitioning Methods. In: Proc. of ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 233\u2013242 (1995)","DOI":"10.21236\/ADA292214"},{"issue":"9","key":"49_CR10","doi-asserted-by":"publisher","first-page":"1074","DOI":"10.1109\/43.159993","volume":"11","author":"L. Hagen","year":"1992","unstructured":"Hagen, L., Kahng, A.: New Spectral Methods for Ratio Cut Partitioning and Clustering. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems\u00a011(9), 1074\u20131085 (1992)","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"issue":"337","key":"49_CR11","doi-asserted-by":"crossref","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. Journal of the American Statistical Association\u00a067(337), 123\u2013129 (1972)","journal-title":"Journal of the American Statistical Association"},{"key":"49_CR12","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1145\/331524.331526","volume":"46","author":"T. Leighton","year":"1999","unstructured":"Leighton, T., Rao, S.: Multicommodity Max-flow Min-cut Theorems and their Use in Designing Approximation Algorithms. J. ACM\u00a046, 787\u2013832 (1999)","journal-title":"J. ACM"},{"key":"49_CR13","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U. Luxburg","year":"2007","unstructured":"Luxburg, U.: A Tutorial on Spectral Clustering. Statistics and Computing\u00a017, 395\u2013416 (2007)","journal-title":"Statistics and Computing"},{"issue":"1","key":"49_CR14","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/TCBB.2004.2","volume":"1","author":"S. Madeira","year":"2004","unstructured":"Madeira, S., Oliveira, A.L.: Biclustering Algorithms for Biological Data Analysis: a survey. Trans. on Comp. Biology and Bioinformatics\u00a01(1), 24\u201345 (2004)","journal-title":"Trans. on Comp. Biology and Bioinformatics"},{"key":"49_CR15","doi-asserted-by":"publisher","first-page":"66133","DOI":"10.1103\/PhysRevE.69.066133","volume":"69","author":"M.E.J. Newman","year":"2004","unstructured":"Newman, M.E.J.: Fast Algorithm for Detecting Community Structure in Networks. Phys. Rev. E\u00a069, 066133 (2004)","journal-title":"Phys. Rev. E"},{"key":"49_CR16","doi-asserted-by":"crossref","unstructured":"Papadimitriou, S., Sun, J.: DisCo: Distributed Co-clustering with Map-Reduce: A Case Study towards Petabyte-Scale End-to-End Mining. In: Proc. of International Conference on Data Mining (ICDM), pp. 512\u2013521 (2008)","DOI":"10.1109\/ICDM.2008.142"},{"issue":"8","key":"49_CR17","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J. Shi","year":"2000","unstructured":"Shi, J., Malik, J.: Normalized Cuts and Image Segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a022(8), 888\u2013905 (2000)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"49_CR18","unstructured":"Salomon, D.: Data Compression: The Complete Reference, 2nd edn. Springer-Verlag New York, Inc. (2000)"},{"key":"49_CR19","unstructured":"Shmoys, D.B.: Cut Problems and their Application to Divide-and-conquer, pp. 192\u2013235. PWS Publishing Co. (1997)"},{"key":"49_CR20","doi-asserted-by":"crossref","unstructured":"Sun, J., Faloutsos, C., Papadimitriou, S., Yu, P.S.: GraphScope: Parameter-free Mining of Large Time-evolving Graphs. In: Proc. of KDD, pp. 687\u2013696 (2007)","DOI":"10.1145\/1281192.1281266"},{"key":"49_CR21","doi-asserted-by":"crossref","unstructured":"Tanay, A., Sharan, R., Shamir, R.: Biclustering Algorithms: a survey. Handbook of Computational Molecular Biology (2004)","DOI":"10.1201\/9781420036275.ch26"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30217-6_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,15]],"date-time":"2022-01-15T07:16:54Z","timestamp":1642231014000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30217-6_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642302169","9783642302176"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30217-6_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}