{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T12:31:05Z","timestamp":1726057865222},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030325909"},{"type":"electronic","value":"9783030325916"}],"license":[{"start":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T00:00:00Z","timestamp":1573084800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-32591-6_1","type":"book-chapter","created":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T08:03:30Z","timestamp":1573027410000},"page":"3-13","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Algorithm for Maximal Biclique Enumeration on Bipartite Graphs"],"prefix":"10.1007","author":[{"given":"CaiXia","family":"Qin","sequence":"first","affiliation":[]},{"given":"MingXue","family":"Liao","sequence":"additional","affiliation":[]},{"given":"YuanYuan","family":"Liang","sequence":"additional","affiliation":[]},{"given":"ChangWen","family":"Zheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,7]]},"reference":[{"issue":"1","key":"1_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.dam.2003.09.004","volume":"145","author":"G Alexe","year":"2004","unstructured":"Alexe, G., Alexe, S., Crama, Y., Foldes, S., Hammer, P.L., Simeone, B.: Consensus algorithms for the generation of all maximal bicliques. Discrete Appl. Math. 145(1), 11\u201321 (2004)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"1_CR2","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1145\/253262.253325","volume":"26","author":"S Brin","year":"1997","unstructured":"Brin, S., Motwani, R., Ullman, J.D., Tsur, S.: Dynamic itemset counting and implication rules for market basket data. ACM SIGMOD Rec. 26(2), 255\u2013264 (1997)","journal-title":"ACM SIGMOD Rec."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Flake, G.W., Lawrence, S., Giles, C.L.: Efficient identification of web communities. In: Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 150\u2013160. ACM (2000)","DOI":"10.1145\/347090.347121"},{"issue":"7","key":"1_CR4","doi-asserted-by":"publisher","first-page":"1447","DOI":"10.1016\/j.dam.2008.10.010","volume":"157","author":"A G\u00e9ly","year":"2009","unstructured":"G\u00e9ly, A., Nourine, L., Sadi, B.: Enumeration aspects of maximal cliques and bicliques. Discrete Appl. Math. 157(7), 1447\u20131459 (2009)","journal-title":"Discrete Appl. Math."},{"issue":"10","key":"1_CR5","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1109\/TKDE.2005.166","volume":"17","author":"G Grahne","year":"2005","unstructured":"Grahne, G., Zhu, J.: Fast algorithms for frequent itemset mining using FP-trees. IEEE Trans. Knowl. Data Eng. 17(10), 1347\u20131362 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.eswa.2016.09.023","volume":"67","author":"T Hashem","year":"2017","unstructured":"Hashem, T., Karim, M.R., Samiullah, M., Ahmed, C.F.: An efficient dynamic superset bit-vector approach for mining frequent closed itemsets and their lattice structure. Expert Syst. Appl. 67, 252\u2013271 (2017)","journal-title":"Expert Syst. Appl."},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Huan, J., Wang, W., Prins, J., Yang, J.: Spin: mining maximal frequent subgraphs from graph databases. In: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 581\u2013586. ACM (2004)","DOI":"10.1145\/1014052.1014123"},{"issue":"3","key":"1_CR8","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1023\/A:1021726221443","volume":"50","author":"A Inokuchi","year":"2003","unstructured":"Inokuchi, A., Washio, T., Motoda, H.: Complete mining of frequent patterns from graphs: mining graph data. Mach. Learn. 50(3), 321\u2013354 (2003)","journal-title":"Mach. Learn."},{"issue":"12","key":"1_CR9","doi-asserted-by":"publisher","first-page":"1625","DOI":"10.1109\/TKDE.2007.190660","volume":"19","author":"J Li","year":"2007","unstructured":"Li, J., Liu, G., Li, H., Wong, L.: Maximal biclique subgraphs and closed pattern pairs of the adjacency matrix: a one-to-one correspondence and mining algorithms. IEEE Trans. Knowl. Data Eng. 19(12), 1625\u20131637 (2007)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1_CR10","unstructured":"Malgrange, Y.: Recherche des sous-matrices premi\u00e8res d\u2019une matrice \u00e0 coefficients binaires. Applications \u00e0 certains probl\u00e8mes de graphe. In: Proceedings of the Deuxi\u00e8me Congr\u00e8s de l\u2019AFCALTI, pp. 231\u2013242 (1962)"},{"issue":"5","key":"1_CR11","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1109\/TSC.2016.2523997","volume":"10","author":"AP Mukherjee","year":"2017","unstructured":"Mukherjee, A.P., Tirthapura, S.: Enumerating maximal bicliques from a large graph using mapreduce. IEEE Trans. Serv. Comput. 10(5), 771\u2013784 (2017)","journal-title":"IEEE Trans. Serv. Comput."},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Nagarajan, N., Kingsford, C.: Uncovering genomic reassortments among influenza strains by enumerating maximal bicliques. In: 2008 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2008, pp. 223\u2013230. IEEE (2008)","DOI":"10.1109\/BIBM.2008.78"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: International Conference on Database Theory, pp. 398\u2013416. Springer (1999)","DOI":"10.1007\/3-540-49257-7_25"},{"key":"1_CR14","unstructured":"Pei, J., Han, J., Mao, R., et al.: CLOSET: an efficient algorithm for mining frequent closed itemsets. In: ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, vol. 4, pp. 21\u201330 (2000)"},{"issue":"12","key":"1_CR15","doi-asserted-by":"publisher","first-page":"1797","DOI":"10.1109\/TKDE.2010.97","volume":"22","author":"S Selvan","year":"2010","unstructured":"Selvan, S., Nataraj, R.: Efficient mining of large maximal bicliques from 3D symmetric adjacency matrix. IEEE Trans. Knowl. Data Eng. 22(12), 1797\u20131802 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Shin, K., Hooi, B., Faloutsos, C.: M-Zoom: fast dense-block detection in tensors with quality guarantees. In: Joint European Conference on Machine Learning and Knowledge Discovery in Databases, pp. 264\u2013280. Springer (2016)","DOI":"10.1007\/978-3-319-46128-1_17"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"1512","DOI":"10.1016\/j.procs.2018.05.105","volume":"132","author":"M Sinthuja","year":"2018","unstructured":"Sinthuja, M., Puviarasan, N., Aruna, P.: Geo map visualization for frequent purchaser in online shopping database using an algorithm LP-growth for mining closed frequent itemsets. Procedia Comput. Sci. 132, 1512\u20131522 (2018)","journal-title":"Procedia Comput. Sci."},{"key":"1_CR18","unstructured":"Uno, T., Asai, T., Uchida, Y., Arimura, H.: LCM: an efficient algorithm for enumerating frequent closed item sets. In: Fimi, vol. 90. Citeseer (2003)"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Uno, T., Kiyomi, M., Arimura, H.: LCM ver. 2: efficient mining algorithms for frequent\/closed\/maximal itemsets. In: Fimi, vol. 126 (2004)","DOI":"10.1145\/1133905.1133916"},{"key":"1_CR20","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, pp. 236\u2013245. ACM (2003)","DOI":"10.1145\/956750.956779"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Yan, X., Han, J.: CloseGraph: mining closed frequent graph patterns. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 286\u2013295. ACM (2003)","DOI":"10.1145\/956750.956784"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Hsiao, C.J.: CHARM: an efficient algorithm for closed itemset mining. In: Proceedings of the 2002 SIAM International Conference on Data Mining, pp. 457\u2013473. SIAM (2002)","DOI":"10.1137\/1.9781611972726.27"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Zhong-Ji, F., Ming-Xue, L., Xiao-Xin, H., Xiao-Hui, H., Xin, Z.: Efficient algorithm for extreme maximal biclique mining in cognitive frequency decision making. In: 2011 IEEE 3rd International Conference on Communication Software and Networks (ICCSN), pp. 25\u201330. IEEE (2011)","DOI":"10.1109\/ICCSN.2011.6013538"}],"container-title":["Advances in Intelligent Systems and Computing","Advances in Natural Computation, Fuzzy Systems and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-32591-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T11:05:46Z","timestamp":1695380746000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-32591-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,7]]},"ISBN":["9783030325909","9783030325916"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-32591-6_1","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2019,11,7]]},"assertion":[{"value":"7 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICNC-FSKD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kunming","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icncfskd2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}