{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:01:27Z","timestamp":1755838887647},"publisher-location":"Cham","reference-count":26,"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_35","type":"book-chapter","created":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T13:03:30Z","timestamp":1573045410000},"page":"329-337","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An Efficient Algorithm for Enumerating Maximal Bicliques from a Dynamically Growing Graph"],"prefix":"10.1007","author":[{"given":"Rui","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingxue","family":"Liao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Caixia","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,7]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Yi, J., Maghoul, F.: Query clustering using click-through graph. In: International Conference on World Wide Web, pp. 1055\u20131056. ACM (2009)","DOI":"10.1145\/1526709.1526853"},{"issue":"12","key":"35_CR2","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.V.: 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."},{"issue":"12","key":"35_CR3","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":"35_CR4","doi-asserted-by":"crossref","unstructured":"Chu, W., Song, Y., Jaimes, A.: Video co-summarization: video summarization by visual co-occurrence. In: 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), Boston, MA, USA, pp. 3584\u20133592 (2015)","DOI":"10.1109\/CVPR.2015.7298981"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Kingsford, C., Nagarajan, N.: Uncovering genomic reassortments among influenza strains by enumerating maximal bicliques. In: 2008 IEEE International Conference on Bioinformatics and Biomedicine (BIBM), pp. 223\u2013230 (2008)","DOI":"10.1109\/BIBM.2008.78"},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0020-0190(99)00108-8","volume":"71","author":"L Nourine","year":"1999","unstructured":"Nourine, L., Raynaud, O.: A fast algorithm for building lattices. Inf. Process. Lett. 71, 199\u2013204 (1999)","journal-title":"Inf. Process. Lett."},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: ICDT 1999, January 1999","DOI":"10.1007\/3-540-49257-7_25"},{"key":"35_CR8","unstructured":"Pei, J., Han, J., Mao, R.: CLOSET: an efficient algorithm for mining frequent closed itemsets. In: DMKD 2000, May 2000"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Wang, J., Han, J., Pei, J.: CLOSET\u2009+\u2009: 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 (2003)","DOI":"10.1145\/956750.956779"},{"key":"35_CR10","unstructured":"Burdick, D., Calimlim, M., Gehrke, J.: MAFIA: a maximal frequent itemset algorithm for transactional databases. In: ICDE 2001, April 2001"},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"Zaki, M., Hsiao, C.: CHARM: an efficient algorithm for closed itemset mining. In: SDM 2002, April 2002","DOI":"10.1137\/1.9781611972726.27"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Uno, T., Asai, T., Uchida, Y., et al.: An efficient algorithm for enumerating closed patterns in transaction databases. In: Lecture Notes in Computer Science, vol. 3245, pp. 16\u201331 (2004)","DOI":"10.1007\/978-3-540-30214-8_2"},{"key":"35_CR13","unstructured":"Uno, T., Kiyomi, M., Arimura, H.: LCM ver.2: efficient mining algorithms for frequent\/closed\/maximal itemsets. In: Proceedings of IEEE ICDM 2004 Workshop, FIMI 2004 (2004)"},{"key":"35_CR14","doi-asserted-by":"crossref","unstructured":"Uno, T., Kiyomi, M., Arimura, H.: LCM ver.3: collaboration of array, bitmap and prefix tree for frequent itemset mining. In: OSDM 2005, Proceedings of the 1st International Workshop on Open Source Data Mining, pp. 77\u201386 (2005)","DOI":"10.1145\/1133905.1133916"},{"key":"35_CR15","unstructured":"Fan, Z.J., et al.: Efficient algorithm for extreme maximal biclique mining in cognitive frequency decision making. In: IEEE International Conference on Communication Software and Networks. IEEE, pp. 25\u201330 (2011)"},{"key":"35_CR16","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-tree. IEEE Trans. Knowl. Data Eng. 17, 1347\u20131362 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"35_CR17","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1137\/1.9781611975673.37","volume-title":"Proceedings of the 2019 SIAM International Conference on Data Mining","author":"Kyle Kloster","year":"2019","unstructured":"Kloster, K., Sullivan, B.D., van der Poel, A.: Mining maximal induced bicliques using odd cycle transversals. In: Proceedings of the 2019 SIAM International Conference on Data Mining (2019)"},{"key":"35_CR18","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1016\/B978-155860869-6\/50038-X","volume-title":"VLDB '02: Proceedings of the 28th International Conference on Very Large Databases","author":"Gurmeet Singh Manku","year":"2002","unstructured":"Manku, G.S., Motwani, R.: Approximate frequency counts over data streams. In: Proceedings of the International Conference on Very Large Data Bases, pp. 346\u2013357 (2002)"},{"key":"35_CR19","unstructured":"Li, H., Lee, S., Shan, M.: An efficient algorithm for mining frequent itemsets over the entire history of data streams. In: Proceedings of the International Workshop on Knowledge Discovery in Data Streams (2004)"},{"issue":"3","key":"35_CR20","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s10115-006-0003-0","volume":"10","author":"Y Chi","year":"2006","unstructured":"Chi, Y., Wang, H., Yu, P.S., Muntz, R.R.: Catch the moment: maintaining closed frequent itemsets over a data stream sliding window. Knowl. Inf. Syst. 10(3), 265\u2013294 (2006)","journal-title":"Knowl. Inf. Syst."},{"key":"35_CR21","doi-asserted-by":"crossref","unstructured":"Li, H., Lu, Z., Chen, H.: Mining approximate closed frequent itemsets over stream. In: Proceedings of the International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel\/Distributed Computing, pp. 405\u2013410 (2008)","DOI":"10.1109\/SNPD.2008.32"},{"issue":"3","key":"35_CR22","doi-asserted-by":"publisher","first-page":"293","DOI":"10.3233\/IDA-2008-12304","volume":"12","author":"T Calders","year":"2008","unstructured":"Calders, T., Dexters, N., Goethals, B.: Mining frequent items in a stream using flexible windows. Intell. Data Anal. 12(3), 293\u2013304 (2008)","journal-title":"Intell. Data Anal."},{"issue":"6","key":"35_CR23","doi-asserted-by":"publisher","first-page":"1052","DOI":"10.1016\/j.jfranklin.2011.04.006","volume":"348","author":"L Guo","year":"2011","unstructured":"Guo, L., Su, H., Qu, Y.: Approximate mining of global closed frequent itemsets over data streams. J. Frankl. Inst. 348(6), 1052\u20131081 (2011)","journal-title":"J. Frankl. Inst."},{"key":"35_CR24","unstructured":"Das, A., Tirthapura, S.: A change-sensitive algorithm for maintaining maximal bicliques in a dynamic bipartite graph (2017)"},{"key":"35_CR25","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1109\/TMSCS.2018.2802920","volume":"4","author":"A Das","year":"2018","unstructured":"Das, A., Tirthapura, S.: Incremental maintenance of maximal bicliques in a dynamic bipartite graph. IEEE Trans. Multi-Scale Comput. Syst. 4, 231\u2013242 (2018)","journal-title":"IEEE Trans. Multi-Scale Comput. Syst."},{"key":"35_CR26","doi-asserted-by":"crossref","unstructured":"Zhang, S., Liao, M., Xiao, Q., Hou, X., Lv, P.: An algorithm for maximal bicliques searching in dynamic relationship graph (2017)","DOI":"10.1109\/ICCCBDA.2018.8386510"}],"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_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T13:15:36Z","timestamp":1573046136000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-32591-6_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,7]]},"ISBN":["9783030325909","9783030325916"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-32591-6_35","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"}}]}}