{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,22]],"date-time":"2026-09-22T22:25:45Z","timestamp":1790115945093,"version":"4.0.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540292449","type":"print"},{"value":"9783540316657","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11564126_18","type":"book-chapter","created":{"date-parts":[[2005,11,4]],"date-time":"2005-11-04T10:24:55Z","timestamp":1131099895000},"page":"146-156","source":"Crossref","is-referenced-by-count":28,"title":["A Correspondence Between Maximal Complete Bipartite Subgraphs and Closed Patterns"],"prefix":"10.1007","author":[{"given":"Jinyan","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haiquan","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Donny","family":"Soh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Limsoon","family":"Wong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/170035.170072","volume-title":"Proceedings of the 1993 ACM-SIGMOD International Conference on Management of Data","author":"R. Agrawal","year":"1993","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM-SIGMOD International Conference on Management of Data, Washington, D.C, May 1993, pp. 207\u2013216. ACM Press, New York (1993)"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., Lakhal, L.: Mining minimal non-redundant association rules using frequent closed itemsets. Computational Logic, 972\u2013986 (2000)","DOI":"10.1007\/3-540-44957-4_65"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1186\/gb-2003-4-3-r23","volume":"23","author":"B.J. Breitkreutz","year":"2003","unstructured":"Breitkreutz, B.J., Stark, C., Tyers, M.: The grid: The general repository for interaction datasets. Genome Biology\u00a04(3), R23 (2003)","journal-title":"Genome Biology\u00a04(3)"},{"issue":"1-6","key":"18_CR4","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S1389-1286(00)00083-9","volume":"33","author":"A.Z. Broder","year":"2000","unstructured":"Broder, A.Z., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.L.: Graph structure in the web. Computer Networks\u00a033(1-6), 309\u2013320 (2000)","journal-title":"Computer Networks"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0020-0190(94)90121-X","volume":"51","author":"D. Eppstein","year":"1994","unstructured":"Eppstein, D.: Arboricity and bipartite subgraph listing algorithms. Information Processing Letters\u00a051, 207\u2013211 (1994)","journal-title":"Information Processing Letters"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Goethals, B., Zaki, M.J.: FIMI 2003: Workshop on frequent itemset mining implementations. In: Third IEEE International Conference on Data Mining Workshop on Frequent Itemset Mining Implementations, pp. 1\u201313 (2003)","DOI":"10.1145\/1007730.1007744"},{"key":"18_CR7","unstructured":"Grahne, G., Zhu, J.: Efficiently using prefix-trees in mining frequent itemsets. In: Proceedings of FIMI 2003: Workshop on Frequent Itemset Mining Implementations (2003)"},{"key":"18_CR8","volume-title":"Handbook of Graph Theory","author":"J.L. Gross","year":"2004","unstructured":"Gross, J.L., Yellen, J.: Handbook of Graph Theory. CRC Press, Boca Raton (2004)"},{"issue":"11-16","key":"18_CR9","doi-asserted-by":"publisher","first-page":"1481","DOI":"10.1016\/S1389-1286(99)00040-7","volume":"31","author":"R. Kumar","year":"1999","unstructured":"Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.: Trawling the web for emerging cyber-communities. Computer Networks\u00a031(11-16), 1481\u20131493 (1999)","journal-title":"Computer Networks"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-540-27810-8_23","volume-title":"Algorithm Theory - SWAT 2004","author":"K. Makino","year":"2004","unstructured":"Makino, K., Uno, T.: New algorithms for enumerating all maximal cliques. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol.\u00a03111, pp. 260\u2013272. Springer, Heidelberg (2004)"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"910","DOI":"10.1126\/science.1065103","volume":"296","author":"S. Maslov","year":"2002","unstructured":"Maslov, S., Sneppen, K.: Specificity and stability in topology of protein networks. Science\u00a0296, 910\u2013913 (2002)","journal-title":"Science"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Murata, T.: Discovery of user communities from web audience measurement data. In: Proceedings of The 2004 IEEE\/WIC\/ACM International Conference on Web Intelligence (WI 2004), pp. 673\u2013676 (2004)","DOI":"10.1109\/WI.2004.10154"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-49257-7_25","volume-title":"Database Theory - ICDT\u201999","author":"N. Pasquier","year":"1999","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 398\u2013416. Springer, Heidelberg (1999)"},{"issue":"suppl.","key":"18_CR14","first-page":"274","volume":"20","author":"D.J. Reiss","year":"2004","unstructured":"Reiss, D.J., Schwikowski, B.: Predicting protein-peptide interactions via a network-based motif sampler. Bioinformatics (ISMB 2004 Proceedings)\u00a020(suppl.), i274\u2013i282 (2004)","journal-title":"Bioinformatics (ISMB 2004 Proceedings)"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1126\/science.1064987","volume":"295","author":"A.H. Tong","year":"2002","unstructured":"Tong, A.H., Drees, B., Nardelli, G., Bader, G.D., Brannetti, B., Castagnoli, L., Evangelista, M., Ferracuti, S., Nelson, B., Paoluzi, S., Quondam, M., Zucconi, A., Hogue, C.W., Fields, S., Boone, C., Cesareni, G.: A combined experimental and computational strategy to define protein interaction networks for peptide recognition modules. Science\u00a0295, 321\u2013324 (2002)","journal-title":"Science"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Uno, T., Kiyomi, M., Arimura, H.: LCM ver.2: Efficient mining algorithms for frequent\/closed\/maximal itemsets. In: IEEE ICDM 2004 Workshop FIMI 2004 (International Conference on Data Mining, Frequent Itemset Mining Implementations) (2004)","DOI":"10.1145\/1133905.1133916"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Wang, J., Han, J., Pei, J.: CLOSET+: Searching for the best strategies for mining frequent closed itemsets. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2003), Washington, DC, USA, pp. 236\u2013245 (2003)","DOI":"10.1145\/956750.956779"},{"issue":"1","key":"18_CR18","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1145\/959242.959249","volume":"5","author":"T. Washio","year":"2003","unstructured":"Washio, T., Motoda, H.: State of the art of graph-based data mining. SIGKDD Explorations\u00a05(1), 59\u201368 (2003)","journal-title":"SIGKDD Explorations"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Hsiao, C.-J.: CHARM: An efficient algorithm for closed itemset mining. In: Proceedings of the Second SIAM International Conference on Data Mining (2002)","DOI":"10.1137\/1.9781611972726.27"},{"key":"18_CR20","unstructured":"Zaki, M.J., Ogihara, M.: Theoretical foundations of association rules. In: Proc. 3rd SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (1998)"}],"container-title":["Lecture Notes in Computer Science","Knowledge Discovery in Databases: PKDD 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11564126_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T08:35:12Z","timestamp":1683275712000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11564126_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540292449","9783540316657"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11564126_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}