{"type":"ScholarlyArticle","title":"Pivot-based Maximal Biclique Enumeration","authors":[{"name":"Aman Abidi","slug":"aman-abidi","given":"Aman","family":"Abidi","affiliation":"Swinburne University of Technology , Melbourne , Australia"},{"name":"Rui Zhou","slug":"rui-zhou","given":"Rui","family":"Zhou","affiliation":"Swinburne University of Technology , Melbourne , Australia"},{"name":"Lu Chen","slug":"lu-chen","given":"Lu","family":"Chen","affiliation":"Swinburne University of Technology , Melbourne , Australia"},{"name":"Chengfei Liu","slug":"chengfei-liu","given":"Chengfei","family":"Liu","affiliation":"Swinburne University of Technology , Melbourne , Australia"}],"abstract":"Enumerating maximal bicliques in a bipartite graph is an important problem in data mining, with innumerable real-world applications across different domains such as web community, bioinformatics, etc. Although substantial research has been conducted on this problem, surprisingly, we find that pivot-based search space pruning, which is quite effective in clique enumeration, has not been exploited in biclique scenario. Therefore, in this paper, we explore the pivot-based pruning for biclique enumeration. We propose an algorithm for implementing the pivot-based pruning, powered by an effective index structure Containment Directed Acyclic Graph (CDAG). Meanwhile, existing literature indicates contradictory findings on the order of vertex selection in biclique enumeration. As such, we re-examine the problem and suggest an offline ordering of vertices which expedites the pivot pruning. We conduct an extensive performance study using real-world datasets from a wide range of domains. The experimental results demonstrate that our algorithm is more scalable and outperforms all the existing algorithms across all datasets and can achieve a significant speedup against the previous algorithms.","doi":"10.24963/ijcai.2020/492","url":"https://ijcai.org/proceedings/2020/492","pdf":"https://ijcai.org/proceedings/2020/0492.pdf","markdown":"https://ijcai.org/proceedings/2020/492.md","bibtex":"https://ijcai.org/proceedings/2020/bibtex/492","volume":{"slug":"2020","title":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2020","url":"https://ijcai.org/proceedings/2020/","year":2020,"location":"Yokohama","dates":"January 2021 (postponed from 11-17 July 2020)","editors":"Christian Bessiere","isbn":"978-0-9992411-6-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2020"},"section":"Multidisciplinary Topics and Applications","track":"Main track","number":492,"pages":{"first":3558,"last":3564},"keywords":["Multidisciplinary Topics and Applications: Databases","Data Mining: Mining Graphs, Semi Structured Data, Complex Data"],"videos":[{"label":"Video","url":"https://videos.ijcai20.org/24614/file_24614.m3u8","length_sec":299,"provider":"hls"}],"references":[{"position":1,"raw":"[Agrawal et al., 1989] Rakesh Agrawal, Alexander Borgida, and Hosagrahar Visvesvaraya Jagadish. Efficient manage- ment of transitive relationships in large data and knowl- edge bases. ACM SIGMOD Record, 18(2):253-262, 1989.","title":"Efficient management of transitive relationships in large data and knowledge bases","authors":"Rakesh Agrawal, Alexander Borgida, Hosagrahar Visvesvaraya, Jagadish","year":"1989","venue":"ACM SIGMOD Record","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Alzahrani and Horadam, 2019] Taher Alzahrani and Kathy J. Horadam. Finding maximal bicliques in bipartite networks using node similarity. Applied Network Science, 4(1):21:1-21:25, 2019.","title":"Finding maximal bicliques in bipartite networks using node similarity","authors":"Taher Alzahrani, Kathy J Horadam","year":"2019","venue":"Applied Network Science","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bron and Kerbosch, 1973] Coen Bron and Joep Kerbosch. Algorithm 457: finding all cliques of an undirected graph. Communications of the ACM, 16(9):575-577, 1973.","title":"Algorithm 457: finding all cliques of an undirected graph","authors":"Kerbosch Bron, Coen Bron, Joep Kerbosch","year":"1973","venue":"Communications of the ACM","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Damaschke, 2014] Peter Damaschke. Enumerating maxi- mal bicliques in bipartite graphs with favorable degree se- quences. Information Processing Letters, 114(6):317-321, 2014.","title":"Enumerating maximal bicliques in bipartite graphs with favorable degree sequences","authors":"Peter Damaschke","year":"2014","venue":"Information Processing Letters","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Das, 2019] Apurba Das. Incremental and parallel algo- rithms for dense subgraph mining. PhD thesis, Iowa State University, 2019.","title":"Incremental and parallel algorithms for dense subgraph mining","authors":"Apurba Das","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Driskell et al., 2004] Amy C Driskell, Cécile Ané, J Gordon Burleigh, Michelle M McMahon, Brian C O'Meara, and Michael J Sanderson. Prospects for building the tree of life from large sequence databases. Science, 306(5699):1172- 1174, 2004.","title":"Prospects for building the tree of life from large sequence databases","authors":"Amy C Driskell, Cécile Ané, Gordon Burleigh, Michelle M Mcmahon, Brian C O'meara, Michael J Sanderson","year":"2004","venue":"Science","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Gibson et al., 2005] David Gibson, Ravi Kumar, and An- drew Tomkins. Discovering large dense subgraphs in massive graphs. In Klemens Böhm, Christian S. Jensen, Laura M. Haas, Martin L. Kersten, Per-Åke Larson, and Beng Chin Ooi, editors, Proceedings of the 31st Interna- tional Conference on Very Large Data Bases, Trondheim, Norway, August 30 -September 2, 2005, pages 721-732. ACM, 2005.","title":"Discovering large dense subgraphs in massive graphs","authors":"David Gibson, Ravi Kumar, Andrew Tomkins","year":"2005","venue":"Proceedings of the 31st International Conference on Very Large Data Bases","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Kaytoue et al., 2011] Mehdi Kaytoue, Sergei O Kuznetsov, Amedeo Napoli, and Sébastien Duplessis. Mining gene expression data with pattern structures in formal concept analysis. Information Sciences, 181(10):1989-2001, 2011.","title":"Mining gene expression data with pattern structures in formal concept analysis","authors":"Mehdi Kaytoue, Sergei O Kuznetsov, Amedeo Napoli, Sébastien Duplessis","year":"2011","venue":"Information Sciences","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Kunegis, 2013] Jérôme Kunegis. Konect: the koblenz net- work collection. In Proceedings of the 22nd International Conference on World Wide Web, pages 1343-1350. ACM, 2013.","title":"Konect: the koblenz network collection","authors":"Jérôme Kunegis, Kunegis","year":"2013","venue":"Proceedings of the 22nd International Conference on World Wide Web","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Li et al., 2007] Jinyan Li, Guimei Liu, Haiquan Li, and Limsoon Wong. Maximal biclique subgraphs and closed pattern pairs of the adjacency matrix: A one-to-one cor- respondence and mining algorithms. IEEE Transactions on Knowledge and Data Engineering, 19(12):1625-1637, 2007.","title":"Maximal biclique subgraphs and closed pattern pairs of the adjacency matrix: A one-to-one correspondence and mining algorithms","authors":"Jinyan Li, Guimei Liu, Haiquan Li, Limsoon Wong","year":"2007","venue":"IEEE Transactions on Knowledge and Data Engineering","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Makino and Uno, 2004] Kazuhisa Makino and Takeaki Uno. New algorithms for enumerating all maximal cliques. In Scandinavian Workshop on Algorithm Theory, pages 260-272. Springer, 2004.","title":"New algorithms for enumerating all maximal cliques","authors":"Uno Makino, Kazuhisa Makino, Takeaki Uno","year":"2004","venue":"Scandinavian Workshop on Algorithm Theory","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Mouret et al., 2011] Sylvain Mouret, Ignacio E. Gross- mann, and Pierre Pestiaux. Time representations and mathematical models for process scheduling problems. Computers & Chemical Engineering, 35(6):1038-1063, 2011.","title":"Time representations and mathematical models for process scheduling problems","authors":"Sylvain Mouret, Ignacio E Grossmann, Pierre Pestiaux","year":"2011","venue":"Computers & Chemical Engineering","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Schweiger et al., 2011] Regev Schweiger, Michal Linial, and Nathan Linial. Generative probabilistic models for protein-protein interaction networks-the biclique per- spective. Bioinformatics, 27(13):i142-i148, 2011.","title":"Generative probabilistic models for protein-protein interaction networks-the biclique perspective","authors":"Schweiger","year":"2011","venue":"Bioinformatics","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Uno et al., 2004] Takeaki Uno, Masashi Kiyomi, and Hi- roki Arimura. Lcm ver. 2: Efficient mining algorithms for frequent/closed/maximal itemsets. In Fimi, volume 126, 2004.","title":"Lcm ver. 2: Efficient mining algorithms for frequent/closed/maximal itemsets","authors":"Takeaki Uno, Masashi Kiyomi, Hiroki Arimura","year":"2004","venue":"Fimi","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Vanahalli and Patil, 2019] Manjunath K Vanahalli and Nagamma Patil. An efficient parallel row enumerated algorithm for mining frequent colossal closed itemsets from high dimensional datasets. Information Sciences, 496:343-362, 2019.","title":"An efficient parallel row enumerated algorithm for mining frequent colossal closed itemsets from high dimensional datasets","authors":"K Manjunath, Nagamma Vanahalli, Patil","year":"2019","venue":"Information Sciences","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Wu et al., 2018] Liuyi Wu, Lijun Dong, Yi Wang, Feng Zhang, Victor E Lee, Xiaojun Kang, and Qingzhong Liang. Uniform-scale assessment of role minimization in bipartite networks and its application to access con- trol. Physica A: Statistical Mechanics and its Applications, 507:381-397, 2018.","title":"Uniform-scale assessment of role minimization in bipartite networks and its application to access control","authors":"Liuyi Wu, Lijun Dong, Yi Wang, Feng Zhang, Xiaojun Victor E Lee, Qingzhong Kang, Liang","year":"2018","venue":"Physica A: Statistical Mechanics and its Applications","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Xiang et al., 2011] Yang Xiang, Philip RO Payne, and Kun Huang. Transactional database transformation and its ap- plication in prioritizing human disease genes. IEEE/ACM transactions on computational biology and bioinformat- ics, 9(1):294-304, 2011.","title":"Transactional database transformation and its application in prioritizing human disease genes","authors":"Yang Xiang, Kun Philip Ro Payne, Huang","year":"2011","venue":"IEEE/ACM transactions on computational biology and bioinformatics","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Yoshinaka, 2011] Ryo Yoshinaka. Towards dual approaches for learning context-free grammars based on syntactic con- cept lattices. In Giancarlo Mauri and Alberto Leporati, editors, Developments in Language Theory -15th Inter- national Conference, DLT 2011, Milan, Italy, July 19-22, 2011. Proceedings, volume 6795 of Lecture Notes in Com- puter Science, pages 429-440. Springer, 2011.","title":"Towards dual approaches for learning context-free grammars based on syntactic concept lattices","authors":"Ryo Yoshinaka, Yoshinaka","year":"2011","venue":"Developments in Language Theory -15th International Conference, DLT 2011","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Zaki and Hsiao, 2002] Mohammed J Zaki and Ching-Jui Hsiao. Charm: An efficient algorithm for closed itemset mining. In Proceedings of the 2002 SIAM international conference on data mining, pages 457-473. SIAM, 2002.","title":"Charm: An efficient algorithm for closed itemset mining","authors":"J Mohammed, Ching-Jui Zaki, Hsiao","year":"2002","venue":"Proceedings of the 2002 SIAM international conference on data mining","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Zhang et al., 2014] Yun Zhang, Charles A Phillips, Gary L Rogers, Erich J Baker, Elissa J Chesler, and Michael A Langston. On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types. BMC bioinformatics, 15(1):110, 2014.","title":"On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types","authors":"Yun Zhang, Charles A Phillips, Gary L Rogers, Erich J Baker, Elissa J Chesler, Michael A Langston","year":"2014","venue":"BMC bioinformatics","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}