{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:35:18Z","timestamp":1725471318533},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540352945"},{"type":"electronic","value":"9783540352969"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11776420_11","type":"book-chapter","created":{"date-parts":[[2006,9,28]],"date-time":"2006-09-28T10:49:15Z","timestamp":1159440555000},"page":"109-122","source":"Crossref","is-referenced-by-count":2,"title":["Significance and Recovery of Block Structures in Binary Matrices with Noise"],"prefix":"10.1007","author":[{"given":"Xing","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Nobel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of ACM SIGMOD 1993, pp. 207\u2013216 (1993)","DOI":"10.1145\/170035.170072"},{"key":"11_CR2","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H.: Fast discovery of association rules. In: Advances in Knowledge Discovery and Data Mining, pp. 307\u2013328. AAAI\/MITPress (1996)"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Gehrke, J., Gunopulos, D., Raghavan, P.: Automatic subspace clustering of high dimensional data for data mining applications. In: Proceedings of ACM SIGMOD 1998, pp. 94\u2013105 (1998)","DOI":"10.1145\/276304.276314"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1017\/S0305004100053056","volume":"80","author":"B. Bollob\u00e1s","year":"1976","unstructured":"Bollob\u00e1s, B., Erd\u00f6s, P.: Cliques in random graphs. Math. Proc. Cam. Phil. Soc.\u00a080, 419\u2013427 (1976)","journal-title":"Math. Proc. Cam. Phil. Soc."},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B. (ed.): Random Graphs, 2nd edn. Cambridge Studies in Advanced Mathematics (2001)","DOI":"10.1017\/CBO9780511814068"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Papadimitriou, S., Modha, D., Faloutsos, C.: Fully Automatic Cross-Associations. In: Proceedings of ACM SIGKDD 2004, pp. 79\u201388 (2004)","DOI":"10.21236\/ADA459025"},{"key":"11_CR7","unstructured":"Cheng, Y., Church, G.M.: Biclustering of expression data. In: Proceedings of ISMB 2000, pp. 93\u2013103 (2000)"},{"issue":"2","key":"11_CR8","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1006\/jagm.2001.1199","volume":"41","author":"M. Dawande","year":"2001","unstructured":"Dawande, M., Keskinocak, P., Swaminathan, J., Tayur, S.: On bipartite and multipartite clique problems. J. Algorithms\u00a041(2), 388\u2013403 (2001)","journal-title":"J. Algorithms"},{"key":"11_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0711-5","volume-title":"A Probabilistic Theory of Pattern Recognition","author":"L. Devroye","year":"1996","unstructured":"Devroye, L., Gy\u00f6rfi, L., Lugosi, G.: A Probabilistic Theory of Pattern Recognition. Springer, New York (1996)"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Dhillon, I., Mallela, S., Modha, D.: Information-Theoretic Co-clustering. In: Proceedings of ACM SIGKDD 2003, pp. 89\u201398 (2003)","DOI":"10.1145\/956750.956764"},{"issue":"9","key":"11_CR11","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1093\/bioinformatics\/btg038","volume":"19","author":"S. Dudoit","year":"2003","unstructured":"Dudoit, S., Fridlyand, J.: Bagging to improve the accuracy of a clustering procedure. Bioinformatics\u00a019(9), 1090\u20131099 (2003)","journal-title":"Bioinformatics"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1017\/S0305004100051124","volume":"77","author":"G.R. Grimmett","year":"1975","unstructured":"Grimmett, G.R., McDiarmid, C.J.H.: On colouring random graphs. Math. Proc. Cam. Phil. Soc.\u00a077, 313\u2013324 (1975)","journal-title":"Math. Proc. Cam. Phil. Soc."},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: Proceedings of ACM SIGMOD 2000, pp. 1\u201312 (2000)","DOI":"10.1145\/342009.335372"},{"key":"11_CR14","volume-title":"Principles of Data Mining","author":"D.J. Hand","year":"2001","unstructured":"Hand, D.J., Mannila, H., Smyth, P.: Principles of Data Mining. MIT Press, Cambridge (2001)"},{"key":"11_CR15","unstructured":"Karp, R.: Probabilistic Analysis of Algorithms. Class Notes, UC-Berkeley (1988)"},{"key":"11_CR16","unstructured":"Koyut\u00fcrk, M., Szpankowski, W., Grama, A.: Biclustering Gene-Feature Matrices for Statistically Significant Dense Patterns. In: IEEE Computer Society Bioinformatics Conference, Stanford, pp. 480\u2013483 (2004)"},{"issue":"6","key":"11_CR17","doi-asserted-by":"publisher","first-page":"1299","DOI":"10.1162\/089976604773717621","volume":"16","author":"T. Lange","year":"2004","unstructured":"Lange, T., Roth, V., Braun, M., Buhmann, J.: Stability-Based Validation of Clustering Solution. Neural Computation\u00a016(6), 1299\u20131323 (2004)","journal-title":"Neural Computation"},{"key":"11_CR18","unstructured":"Liu, J., Paulsen, S., Wang, W., Nobel, A.B., Prins, J.: Mining Approximate Frequent Itemsets from Noisy Data. In: Proceedings of ICDM 2005, pp. 721\u2013724 (2005)"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Liu, J., Paulsen, S., Sun, X., Wang, W., Nobel, A.B., Prins, J.: Mining approximate frequent itemsets in the presence of noise: algorithm and analysis. In: Proceedings of SDM (to appear, 2006)","DOI":"10.1137\/1.9781611972764.36"},{"key":"11_CR20","unstructured":"Matula, D.: The largest clique size in a random graph. Southern Methodist University, Tech. Report, CS 7608 (1976)"},{"issue":"1","key":"11_CR21","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.: Biclustering algorithms for biological data analysis: A survey. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a01(1), 24\u201345 (2004)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"11_CR22","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BF02883985","volume":"10","author":"M. Okamoto","year":"1958","unstructured":"Okamoto, M.: Some inequalities relating to the partial sum of binomial probabilities. Annals of the Institute of Statistical Mathematics\u00a010, 29\u201335 (1958)","journal-title":"Annals of the Institute of Statistical Mathematics"},{"key":"11_CR23","unstructured":"Pei, J., Tung, A.K., Han, J.: Fault-tolerant frequent pattern mining: Problems and challenges. In: Proceedings of DMKD 2001 (2001)"},{"issue":"5","key":"11_CR24","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1007\/s10115-003-0133-6","volume":"6","author":"J. Pei","year":"2002","unstructured":"Pei, J., Dong, G., Zou, W., Han, J.: Mining Condensed Frequent-Pattern Bases. Knowledge and Information Systems\u00a06(5), 570\u2013594 (2002)","journal-title":"Knowledge and Information Systems"},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Park, G., Szpankowshi, W.: Analysis of biclusters with applications to gene expression data. In: Proceeding of AoA 2005 (2005)","DOI":"10.46298\/dmtcs.3385"},{"key":"11_CR26","unstructured":"Reuning-Scherer, J.D.: Mixture Models for Block Clustering. Phd Thesis, Yale university (1997)"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Sepp\u00e4nen, J.K., Mannila, H.: Dense Itemsets. In: Proceedings of ACM SIGKDD 2004, pp. 683\u2013688 (2004)","DOI":"10.1145\/1014052.1014140"},{"issue":"1","key":"11_CR28","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1093\/bioinformatics\/18.suppl_1.S136","volume":"18","author":"A. Tanay","year":"2002","unstructured":"Tanay, A., Sharan, R., Shamir, R.: Discovering statistically significant biclusters in gene expression data. Bioinformatics\u00a018(1), 136\u2013144 (2002)","journal-title":"Bioinformatics"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Tanay, A., Sharan, R., Shamir, R.: Biclustering Algorithms: A Survey. In: Handbook of Computational Molecular Biology. Computer and Information Science Series, Chapman & Hall\/CRC (in press, 2005)","DOI":"10.1201\/9781420036275.ch26"},{"key":"11_CR30","unstructured":"Tibshirani, R., Walther, G., Hastie, T.: Estimating the number of clusters in a dataset via gap statistic. Technical Report 208, Dept of Statistics, Stanford University (2000)"},{"key":"11_CR31","doi-asserted-by":"crossref","unstructured":"Yang, C., Fayyad, U., Bradley, P.S.: Efficient discovery of error-tolerant frequent itemsets in high dimensions. In: Proceedings of ACM SIGKDD 2001, pp. 194\u2013203 (2001)","DOI":"10.1145\/502512.502539"}],"container-title":["Lecture Notes in Computer Science","Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11776420_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T20:39:33Z","timestamp":1683578373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11776420_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540352945","9783540352969"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/11776420_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}