{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:20:01Z","timestamp":1750220401670,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":48,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,2,11]],"date-time":"2022-02-11T00:00:00Z","timestamp":1644537600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Samsung Electronics"},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["NRF-2020R1C1C1008296"],"award-info":[{"award-number":["NRF-2020R1C1C1008296"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Information & Communications Technology Planning & Evaluation","award":["2019-0-00075"],"award-info":[{"award-number":["2019-0-00075"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,2,11]]},"DOI":"10.1145\/3488560.3498390","type":"proceedings-article","created":{"date-parts":[[2022,2,15]],"date-time":"2022-02-15T21:42:57Z","timestamp":1644961377000},"page":"908-916","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Finding a Concise, Precise, and Exhaustive Set of Near Bi-Cliques in Dynamic Graphs"],"prefix":"10.1145","author":[{"given":"Hyeonjeong","family":"Shin","sequence":"first","affiliation":[{"name":"KAIST, Seoul, Republic of Korea"}]},{"given":"Taehyung","family":"Kwon","sequence":"additional","affiliation":[{"name":"KAIST, Seoul, Republic of Korea"}]},{"given":"Neil","family":"Shah","sequence":"additional","affiliation":[{"name":"Snap Inc., Seattle, WA, USA"}]},{"given":"Kijung","family":"Shin","sequence":"additional","affiliation":[{"name":"KAIST, Seoul, Republic of Korea"}]}],"member":"320","published-online":{"date-parts":[[2022,2,15]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Mauricio GC Resende, and Sandra Sudarsky","author":"Abello James","year":"2002","unstructured":"James Abello, Mauricio GC Resende, and Sandra Sudarsky. 2002. Massive quasi-clique detection. In LATIN. Springer."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_2_1","DOI":"10.1016\/j.dam.2003.09.004"},{"doi-asserted-by":"crossref","unstructured":"Miguel Araujo Spiros Papadimitriou Stephan G\u00fcnnemann Christos Faloutsos Prithwish Basu Ananthram Swami Evangelos E Papalexakis and Danai Koutra. 2014. Com2: fast automatic discovery of temporal ('comet') communities. In PAKDD .","key":"e_1_3_2_2_3_1","DOI":"10.1007\/978-3-319-06605-9_23"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_4_1","DOI":"10.1287\/opre.1100.0851"},{"key":"e_1_3_2_2_5_1","volume-title":"arXiv preprint cs\/0310049","author":"Batagelj Vladimir","year":"2003","unstructured":"Vladimir Batagelj and Matjaz Zaversnik. 2003. An O (m) algorithm for cores decomposition of networks. arXiv preprint cs\/0310049 (2003)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_6_1","DOI":"10.1006\/jcss.1999.1690"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_7_1","DOI":"10.1093\/nar\/gkg340"},{"doi-asserted-by":"crossref","unstructured":"Moses Charikar. 2000. Greedy approximation algorithms for finding dense components in a graph. In APPROX .","key":"e_1_3_2_2_8_1","DOI":"10.1007\/3-540-44436-X_10"},{"key":"e_1_3_2_2_9_1","series-title":"SIAM Journal on computing","volume-title":"Arboricity and subgraph listing algorithms","author":"Chiba Norishige","year":"1985","unstructured":"Norishige Chiba and Takao Nishizeki. 1985. Arboricity and subgraph listing algorithms. SIAM Journal on computing , Vol. 14, 1 (1985), 210--223."},{"key":"e_1_3_2_2_10_1","first-page":"231","article-title":"Incremental maintenance of maximal bicliques in a dynamic bipartite graph","volume":"4","author":"Das Apurba","year":"2018","unstructured":"Apurba Das and Srikanta Tirthapura. 2018. Incremental maintenance of maximal bicliques in a dynamic bipartite graph. TMSCS , Vol. 4, 3 (2018), 231--242.","journal-title":"TMSCS"},{"unstructured":"The dblp computer science bibliography. 2021. DBLP Data . https:\/\/dblp.uni-trier.de\/db\/","key":"e_1_3_2_2_11_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_12_1","DOI":"10.1016\/j.tcs.2005.01.014"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_13_1","DOI":"10.1016\/0020-0190(94)90121-X"},{"doi-asserted-by":"crossref","unstructured":"David Eppstein Maarten L\u00f6ffler and Darren Strash. 2010. Listing all maximal cliques in sparse graphs in near-optimal time. In ISAAC .","key":"e_1_3_2_2_14_1","DOI":"10.1007\/978-3-642-17517-6_36"},{"key":"e_1_3_2_2_15_1","volume-title":"The minimum description length principle for pattern mining: A survey. arXiv preprint arXiv:2007.14009","author":"Galbrun Esther","year":"2020","unstructured":"Esther Galbrun. 2020. The minimum description length principle for pattern mining: A survey. arXiv preprint arXiv:2007.14009 (2020)."},{"volume-title":"Finding a maximum density subgraph","author":"Goldberg Andrew V","unstructured":"Andrew V Goldberg. 1984. Finding a maximum density subgraph .University of California Berkeley.","key":"e_1_3_2_2_16_1"},{"volume-title":"The minimum description length principle","author":"Gr\u00fcnwald Peter D","unstructured":"Peter D Gr\u00fcnwald. 2007. The minimum description length principle .MIT press.","key":"e_1_3_2_2_17_1"},{"doi-asserted-by":"crossref","unstructured":"Meng Jiang Alex Beutel Peng Cui Bryan Hooi Shiqiang Yang and Christos Faloutsos. 2015. A general suspiciousness metric for dense blocks in multimodal data. In ICDM .","key":"e_1_3_2_2_18_1","DOI":"10.1109\/ICDM.2015.61"},{"doi-asserted-by":"crossref","unstructured":"Samir Khuller and Barna Saha. 2009. On finding dense subgraphs. In ICALP .","key":"e_1_3_2_2_19_1","DOI":"10.1007\/978-3-642-02927-1_50"},{"doi-asserted-by":"crossref","unstructured":"Kyle Kloster Blair D Sullivan and Andrew van der Poel. 2019. Mining maximal induced bicliques using odd cycle transversals. In SDM .","key":"e_1_3_2_2_20_1","DOI":"10.1137\/1.9781611975673.37"},{"unstructured":"Jihoon Ko Yunbum Kook and Kijung Shin. 2020. Incremental Lossless Graph Summarization. In KDD .","key":"e_1_3_2_2_21_1"},{"doi-asserted-by":"crossref","unstructured":"Danai Koutra U Kang Jilles Vreeken and Christos Faloutsos. 2014. VoG: Summarizing and understanding large graphs. In SDM .","key":"e_1_3_2_2_22_1","DOI":"10.1137\/1.9781611973440.11"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_23_1","DOI":"10.1016\/S1389-1286(99)00040-7"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_24_1","DOI":"10.1109\/TKDE.2014.2320716"},{"unstructured":"Richard P Lippmann David J Fried Isaac Graf Joshua W Haines Kristopher R Kendall David McClung Dan Weber Seth E Webster Dan Wyschogrod Robert K Cunningham et al. 2000. Evaluating intrusion detection systems: The 1998 DARPA off-line intrusion detection evaluation. In DISCEX .","key":"e_1_3_2_2_25_1"},{"unstructured":"Guimei Liu Kelvin Sim and Jinyan Li. 2006. Efficient mining of large maximal bicliques. In DaWaK .","key":"e_1_3_2_2_26_1"},{"doi-asserted-by":"crossref","unstructured":"Kazuhisa Makino and Takeaki Uno. 2004. New algorithms for enumerating all maximal cliques. In SWAT .","key":"e_1_3_2_2_27_1","DOI":"10.1007\/978-3-540-27810-8_23"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_28_1","DOI":"10.1007\/s10878-010-9338-2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_29_1","DOI":"10.1023\/B:MACH.0000033117.77257.41"},{"doi-asserted-by":"crossref","unstructured":"Michael Mitzenmacher Jakub Pachocki Richard Peng Charalampos Tsourakakis and Shen Chen Xu. 2015. Scalable large near-clique detection in large-scale networks via sampling. In KDD .","key":"e_1_3_2_2_30_1","DOI":"10.1145\/2783258.2783385"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_31_1","DOI":"10.1007\/BF02760024"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_32_1","DOI":"10.1007\/s11590-015-0971-7"},{"key":"e_1_3_2_2_33_1","volume-title":"A way to simplify truth functions. The American mathematical monthly","author":"Quine Willard V","year":"1955","unstructured":"Willard V Quine. 1955. A way to simplify truth functions. The American mathematical monthly , Vol. 62, 9 (1955), 627--631."},{"key":"e_1_3_2_2_34_1","volume-title":"Obtaining maximal concatenated phylogenetic data sets from large sequence databases. Molecular biology and evolution","author":"Sanderson Michael J","year":"2003","unstructured":"Michael J Sanderson, Amy C Driskell, Richard H Ree, Oliver Eulenstein, and Sasha Langley. 2003. Obtaining maximal concatenated phylogenetic data sets from large sequence databases. Molecular biology and evolution , Vol. 20, 7 (2003), 1036--1042."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_35_1","DOI":"10.1145\/2783258.2783321"},{"key":"e_1_3_2_2_36_1","first-page":"120","article-title":"The Enron email dataset database schema and brief statistical report. Information sciences institute technical report","volume":"4","author":"Shetty Jitesh","year":"2004","unstructured":"Jitesh Shetty and Jafar Adibi. 2004. The Enron email dataset database schema and brief statistical report. Information sciences institute technical report, University of Southern California , Vol. 4, 1 (2004), 120--128.","journal-title":"University of Southern California"},{"unstructured":"Hyeonjeong Shin Taehyung Kwon Neil Shah and Kijung Shin. 2021 b. Finding a Concise Precise and Exhaustive Set of Near Bi-Cliques in Dynamic Graphs (Supplementary Document) . https:\/\/github.com\/hyeonjeong1\/cutnpeel","key":"e_1_3_2_2_37_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_38_1","DOI":"10.1145\/3154414"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_39_1","DOI":"10.1145\/3097983.3098087"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_40_1","DOI":"10.3389\/fdata.2020.594302"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_41_1","DOI":"10.5555\/1656479.1656483"},{"doi-asserted-by":"crossref","unstructured":"Charalampos Tsourakakis. 2015. The k-clique densest subgraph problem. In WWW .","key":"e_1_3_2_2_42_1","DOI":"10.1145\/2736277.2741098"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_43_1","DOI":"10.1137\/0206036"},{"unstructured":"The CAIDA UCSD. 2021. DDoS Attack 2007 . https:\/\/www.caida.org\/catalog\/datasets\/ddos-20070804_dataset","key":"e_1_3_2_2_44_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_45_1","DOI":"10.1007\/s00453-008-9238-3"},{"unstructured":"Weeplaces. 2021. Weeplaces Data . https:\/\/www.yongliu.org\/datasets.html","key":"e_1_3_2_2_46_1"},{"unstructured":"Yelp. 2021. Yelp Data . https:\/\/www.kaggle.com\/yelp-dataset\/yelp-dataset","key":"e_1_3_2_2_47_1"},{"doi-asserted-by":"crossref","unstructured":"Yi Zhou Jingwei Xu Zhenyu Guo Mingyu Xiao and Yan Jin. 2020. Enumerating maximal k-plexes with worst-case time guarantee. In AAAI .","key":"e_1_3_2_2_48_1","DOI":"10.1609\/aaai.v34i03.5625"}],"event":{"sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"],"acronym":"WSDM '22","name":"WSDM '22: The Fifteenth ACM International Conference on Web Search and Data Mining","location":"Virtual Event AZ USA"},"container-title":["Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3488560.3498390","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3488560.3498390","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:51Z","timestamp":1750191531000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3488560.3498390"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,11]]},"references-count":48,"alternative-id":["10.1145\/3488560.3498390","10.1145\/3488560"],"URL":"https:\/\/doi.org\/10.1145\/3488560.3498390","relation":{},"subject":[],"published":{"date-parts":[[2022,2,11]]},"assertion":[{"value":"2022-02-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}