{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T14:27:49Z","timestamp":1725632869858},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642249570"},{"type":"electronic","value":"9783642249587"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-24958-7_81","type":"book-chapter","created":{"date-parts":[[2011,11,10]],"date-time":"2011-11-10T18:55:12Z","timestamp":1320951312000},"page":"700-708","source":"Crossref","is-referenced-by-count":0,"title":["Co-clustering for Binary Data with Maximum Modularity"],"prefix":"10.1007","author":[{"given":"Lazhar","family":"Labiod","sequence":"first","affiliation":[]},{"given":"Mohamed","family":"Nadif","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"81_CR1","doi-asserted-by":"crossref","unstructured":"White, S., Smyth, P.: A spectral clustering approach to finding communities in graphs. In: SDM, pp. 76\u201384 (2005)","DOI":"10.1137\/1.9781611972757.25"},{"key":"81_CR2","unstructured":"Ng, A.Y., Jordan, M., Weiss, Y.: On spectral clustering: Analysis and an algorithm. In: Proc. of NIPS, vol.14 (2001)"},{"key":"81_CR3","unstructured":"Cheng, Y., Church, G.: Biclustering of expression data. In: 8th International Conference on Intelligent Systems for Molecular Biology, ISMB 2000, pp. 93\u2013103 (2000)"},{"key":"81_CR4","unstructured":"Von Luxburg, U.: A Tutorial on Spectral Clustering, Technical Report at MPI Tuebingen (2006)"},{"key":"81_CR5","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1023\/A:1009769707641","volume":"2","author":"Z. Huang","year":"1998","unstructured":"Huang, Z.: Extensions to the k-means algorithm for proposition clustering large data sets with categorical values. Data Mining and Knowledge Discovery\u00a02, 283\u2013304 (1998)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"81_CR6","doi-asserted-by":"publisher","first-page":"26113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"M. Newman","year":"2004","unstructured":"Newman, M., Girvan, M.: Finding and evaluating community structure in networks. Physical Review E\u00a069, 026113 (2004)","journal-title":"Physical Review E"},{"key":"81_CR7","unstructured":"Ding, C., Xiaofeng, H., Hongyuan, Z., Horst, S.: Self-aggregation in scaled principal component space. Technical Report LBNL\u201349048. Ernest Orlando Lawrence Berkeley National Laboratory, Berkeley, CA, USA (2001)"},{"key":"81_CR8","doi-asserted-by":"crossref","unstructured":"Ding, C., Li, T., Peng, W., Park, H.: Orthogonal nonnegative matrix tri-factorizations for clustering. In: KDD 2006, Philadelphia, PA (2006)","DOI":"10.1145\/1150402.1150420"},{"key":"81_CR9","doi-asserted-by":"crossref","unstructured":"Dhillon, I., Mallela, S., Modha, D.S.: Information-Theoretic Co-clustering. In: KDD 2003, pp. 89\u201398 (2003)","DOI":"10.1145\/956750.956764"},{"key":"81_CR10","doi-asserted-by":"crossref","unstructured":"Dhillon, I.: Co-clustering documents and words using bipartite spectral graph partitioning. In: KDD 2001, pp. 269\u2013274 (2001)","DOI":"10.1145\/502512.502550"},{"key":"81_CR11","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1038\/44565","volume":"401","author":"D.D. Lee","year":"1999","unstructured":"Lee, D.D., Seung, H.S.: Learning the parts of objects by non-negative matrix factorization. Nature\u00a0401, 788\u2013791 (1999)","journal-title":"Nature"},{"key":"81_CR12","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.csda.2007.09.007","volume":"52","author":"G. Govaert","year":"2008","unstructured":"Govaert, G., Nadif, M.: Block clustering with Bernoulli mixture models: Comparison of different approaches. Computational Statistics and Data Analysis\u00a052, 233\u20133245 (2008)","journal-title":"Computational Statistics and Data Analysis"},{"key":"81_CR13","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations. John Hopkins Press (1999)"},{"key":"81_CR14","unstructured":"Marcotorchino, F.: Block seriation problems: A unified approach. In: Applied Stochastic Models and Data Analysis, vol.\u00a03, p. 7391. Wiley (1987)"},{"issue":"1","key":"81_CR15","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1198\/000313005X22770","volume":"59","author":"S. Niermann","year":"2005","unstructured":"Niermann, S.: Optimizing the ordering of tables with Evolutionary Computation. Tha American Statistician\u00a059(1), 41\u201346 (2005)","journal-title":"Tha American Statistician"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24958-7_81","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T11:09:42Z","timestamp":1560942582000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24958-7_81"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642249570","9783642249587"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24958-7_81","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}