{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:51:37Z","timestamp":1757631097030,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,4,5]],"date-time":"2021-04-05T00:00:00Z","timestamp":1617580800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,4,5]]},"DOI":"10.1145\/3460620.3460735","type":"proceedings-article","created":{"date-parts":[[2021,6,4]],"date-time":"2021-06-04T10:33:05Z","timestamp":1622802785000},"page":"76-81","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["An Effective Algorithm for Extracting Maximal Bipartite Cliques"],"prefix":"10.1145","author":[{"given":"Raghda Fawzey","family":"Hriez","sequence":"first","affiliation":[{"name":"Princess Sumaya University for Technology, Jordan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ghazi","family":"Al-Naymat","sequence":"additional","affiliation":[{"name":"Ajman University and Princess Sumaya University for Technology, UAE"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arafat","family":"Awajan","sequence":"additional","affiliation":[{"name":"Mutah University and Princess Sumaya University for Technology, Jordan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,6,4]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2003. Sandi graph. http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/data\/2mode\/Sandi\/Sandi.htm"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2003.09.004"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ygeno.2009.08.016"},{"key":"e_1_3_2_1_4_1","unstructured":"Vladimir Batagelj and Andrej Mrvar. 2006. Pajek datasets. http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/data\/(2006)."},{"key":"e_1_3_2_1_5_1","unstructured":"Alex Beutel. 2016. User behavior modeling with large-scale graph analysis. Ph.D. Dissertation. Ph. D. Thesis at Carnegie Mellon University."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488400"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"e_1_3_2_1_8_1","unstructured":"Yizong Cheng and George\u00a0M Church. 2000. Biclustering of expression data.. In Ismb Vol.\u00a08. 93\u2013103."},{"volume-title":"Systems Biology and Regulatory Genomics","author":"Chesler J","key":"e_1_3_2_1_9_1","unstructured":"Elissa\u00a0J Chesler and Michael\u00a0A Langston. 2007. Combinatorial genetic regulatory network analysis tools for high throughput transcriptomic data. In Systems Biology and Regulatory Genomics. Springer, 150\u2013165."},{"volume-title":"Ringen om de macht","author":"de Nooy W","key":"e_1_3_2_1_10_1","unstructured":"W de Nooy. 2006. Ringen om de macht. In Wilco Dekker&Ben van Raaij, De elite. De Volkskrant Top 200 van invloedrijkste Nederlanders. Meulenhoff, 85\u201394."},{"key":"e_1_3_2_1_11_1","volume-title":"Proc. Workshop Frequent Item Set Mining Implementations (FIMI","author":"Jianfei Zhu Grahne","year":"2004","unstructured":"Grahne G and Jianfei Zhu. 2004. Reducing the main memory consumptions of FPmax* and FPclose. In Proc. Workshop Frequent Item Set Mining Implementations (FIMI 2004, Brighton, UK), Aachen, Germany. Citeseer, 75."},{"key":"e_1_3_2_1_12_1","unstructured":"G\u00f6sta Grahne and Jianfei Zhu. 2003. Efficiently using prefix-trees in mining frequent itemsets.. In FIMI Vol.\u00a090."},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings, International Conference for the Critical Assessment of Microarray Data Analysis (CAMDA06)","author":"Kirova Roumyana","year":"2006","unstructured":"Roumyana Kirova, Michael\u00a0A Langston, Xinxia Peng, Andy\u00a0D Perkins, and Elissa\u00a0J Chesler. 2006. A systems genetic analysis of chronic fatigue syndrome: combinatorial data integration from SNPs to differential diagnosis of disease. In Proceedings, International Conference for the Critical Assessment of Microarray Data Analysis (CAMDA06)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/11564126_18"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.190660"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11823728_42"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2003.1250919"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27810-8_23"},{"key":"e_1_3_2_1_19_1","volume-title":"A graph-theoretical approach for pattern discovery in epidemiological research. IBM systems journal 46, 1","author":"Mushlin A","year":"2007","unstructured":"Richard\u00a0A Mushlin, Aaron Kershenbaum, Stephen\u00a0T Gallagher, and Timothy\u00a0R Rebbeck. 2007. A graph-theoretical approach for pattern discovery in epidemiological research. IBM systems journal 46, 1 (2007), 135\u2013149."},{"key":"e_1_3_2_1_20_1","volume-title":"Obtaining maximal concatenated phylogenetic data sets from large sequence databases. Molecular biology and evolution 20, 7","author":"Sanderson J","year":"2003","unstructured":"Michael\u00a0J Sanderson, Amy\u00a0C Driskell, Richard\u00a0H Ree, Oliver Eulenstein, and Sasha Langley. 2003. Obtaining maximal concatenated phylogenetic data sets from large sequence databases. Molecular biology and evolution 20, 7 (2003), 1036\u20131042."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/18.suppl_1.S136"},{"key":"e_1_3_2_1_22_1","unstructured":"Takeaki Uno Masashi Kiyomi and Hiroki Arimura. 2004. LCM ver. 2: Efficient mining algorithms for frequent\/closed\/maximal itemsets. In Fimi Vol.\u00a0126."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564737"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956779"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972726.27"},{"key":"e_1_3_2_1_26_1","volume-title":"3rd ACM SIGMOD workshop on research issues in data mining and knowledge discovery. 71\u201378","author":"Zaki Mohammed\u00a0Javeed","year":"1998","unstructured":"Mohammed\u00a0Javeed Zaki and Mitsunori Ogihara. 1998. Theoretical foundations of association rules. In 3rd ACM SIGMOD workshop on research issues in data mining and knowledge discovery. 71\u201378."},{"key":"e_1_3_2_1_27_1","volume-title":"On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types. BMC bioinformatics 15, 1","author":"Zhang Yun","year":"2014","unstructured":"Yun Zhang, Charles\u00a0A Phillips, Gary\u00a0L Rogers, Erich\u00a0J Baker, Elissa\u00a0J Chesler, and Michael\u00a0A Langston. 2014. On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types. BMC bioinformatics 15, 1 (2014), 110."}],"event":{"name":"DATA'21: International Conference on Data Science, E-learning and Information Systems 2021","acronym":"DATA'21","location":"Ma'an Jordan"},"container-title":["International Conference on Data Science, E-learning and Information Systems 2021"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460620.3460735","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460620.3460735","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:30:41Z","timestamp":1757543441000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460620.3460735"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,5]]},"references-count":27,"alternative-id":["10.1145\/3460620.3460735","10.1145\/3460620"],"URL":"https:\/\/doi.org\/10.1145\/3460620.3460735","relation":{},"subject":[],"published":{"date-parts":[[2021,4,5]]},"assertion":[{"value":"2021-06-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}