{"id":"https://openalex.org/W3210994262","doi":"https://doi.org/10.1145/3488560.3498390","title":"Finding a Concise, Precise, and Exhaustive Set of Near Bi-Cliques in Dynamic Graphs","display_name":"Finding a Concise, Precise, and Exhaustive Set of Near Bi-Cliques in Dynamic Graphs","publication_year":2022,"publication_date":"2022-02-11","ids":{"openalex":"https://openalex.org/W3210994262","doi":"https://doi.org/10.1145/3488560.3498390","mag":"3210994262"},"language":"en","primary_location":{"id":"doi:10.1145/3488560.3498390","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3488560.3498390","pdf_url":null,"source":{"id":"https://openalex.org/S4363608885","display_name":"Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077980769","display_name":"Hyeonjeong Shin","orcid":null},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Hyeonjeong Shin","raw_affiliation_strings":["KAIST, Seoul, Republic of Korea"],"affiliations":[{"raw_affiliation_string":"KAIST, Seoul, Republic of Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070170695","display_name":"Taehyung Kwon","orcid":"https://orcid.org/0000-0002-6177-7329"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Taehyung Kwon","raw_affiliation_strings":["KAIST, Seoul, Republic of Korea"],"affiliations":[{"raw_affiliation_string":"KAIST, Seoul, Republic of Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101799872","display_name":"Neil Shah","orcid":"https://orcid.org/0000-0003-3261-8430"},"institutions":[{"id":"https://openalex.org/I4210142583","display_name":"Snap (United States)","ror":"https://ror.org/04dgkhg68","country_code":"US","type":"company","lineage":["https://openalex.org/I4210142583"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Neil Shah","raw_affiliation_strings":["Snap Inc., Seattle, WA, USA"],"affiliations":[{"raw_affiliation_string":"Snap Inc., Seattle, WA, USA","institution_ids":["https://openalex.org/I4210142583"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028609723","display_name":"Kijung Shin","orcid":"https://orcid.org/0000-0002-2872-1526"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Kijung Shin","raw_affiliation_strings":["KAIST, Seoul, Republic of Korea"],"affiliations":[{"raw_affiliation_string":"KAIST, Seoul, Republic of Korea","institution_ids":["https://openalex.org/I157485424"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5077980769"],"corresponding_institution_ids":["https://openalex.org/I157485424"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00754717,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"908","last_page":"916"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12016","display_name":"Web Data Mining and Analysis","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6963880062103271},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.564918577671051},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.4911072254180908},{"id":"https://openalex.org/keywords/dense-graph","display_name":"Dense graph","score":0.47879037261009216},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4635426700115204},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4517459571361542},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45039573311805725},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36959901452064514},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.3489757180213928},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1841047704219818}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6963880062103271},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.564918577671051},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.4911072254180908},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.47879037261009216},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4635426700115204},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4517459571361542},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45039573311805725},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36959901452064514},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.3489757180213928},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1841047704219818},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3488560.3498390","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3488560.3498390","pdf_url":null,"source":{"id":"https://openalex.org/S4363608885","display_name":"Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7659725915","display_name":null,"funder_award_id":"NRF-2020R1C1C1008296","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"}],"funders":[{"id":"https://openalex.org/F4320322120","display_name":"National Research Foundation of Korea","ror":"https://ror.org/013aysd81"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W132921321","https://openalex.org/W175854469","https://openalex.org/W183656749","https://openalex.org/W1500512125","https://openalex.org/W1535144194","https://openalex.org/W1567562836","https://openalex.org/W1676999057","https://openalex.org/W1842663434","https://openalex.org/W1868111879","https://openalex.org/W1952056635","https://openalex.org/W1964669181","https://openalex.org/W1969192912","https://openalex.org/W1979312971","https://openalex.org/W1980503920","https://openalex.org/W2009723146","https://openalex.org/W2013568176","https://openalex.org/W2054560566","https://openalex.org/W2055245094","https://openalex.org/W2057305562","https://openalex.org/W2060778826","https://openalex.org/W2078129907","https://openalex.org/W2079535727","https://openalex.org/W2081193615","https://openalex.org/W2089417393","https://openalex.org/W2101460669","https://openalex.org/W2121470019","https://openalex.org/W2151626491","https://openalex.org/W2163970999","https://openalex.org/W2167295942","https://openalex.org/W2169088933","https://openalex.org/W2180772693","https://openalex.org/W2248736178","https://openalex.org/W2266714125","https://openalex.org/W2329329248","https://openalex.org/W2625814963","https://openalex.org/W2784511520","https://openalex.org/W2792367992","https://openalex.org/W2898464298","https://openalex.org/W2997422757","https://openalex.org/W2998215451","https://openalex.org/W3045909935","https://openalex.org/W3099747923","https://openalex.org/W3153434246","https://openalex.org/W3159973214","https://openalex.org/W4210896998","https://openalex.org/W4300323401"],"related_works":["https://openalex.org/W3037707435","https://openalex.org/W3166231268","https://openalex.org/W4390722723","https://openalex.org/W2145764405","https://openalex.org/W3008291108","https://openalex.org/W3042669702","https://openalex.org/W4294294408","https://openalex.org/W1997761863","https://openalex.org/W2913147187","https://openalex.org/W3037054849"],"abstract_inverted_index":{"A":[0],"variety":[1],"of":[2,21,50,69,77,105,122,155,194,229],"tasks":[3],"on":[4,136],"dynamic":[5,83,95,128,183],"graphs,":[6],"including":[7],"anomaly":[8],"detection,":[9,11],"community":[10],"compression,":[12],"and":[13,46,117,169,214,234],"graph":[14,232],"understanding,":[15],"have":[16],"been":[17],"formulated":[18],"as":[19],"problems":[20],"identifying":[22],"constituent":[23],"(near)":[24],"bi-cliques":[25,79,107,124,193],"(i.e.,":[26],"complete":[27],"bipartite":[28],"graphs).":[29],"Even":[30],"when":[31],"we":[32,87,99,112,144],"restrict":[33],"our":[34],"attention":[35],"to":[36,196,207,218,231],"maximal":[37],"ones,":[38],"there":[39],"can":[40,98],"be":[41],"exponentially":[42],"many":[43],"near":[44,70,78,106,123,156,192],"bi-cliques,":[45],"thus":[47],"finding":[48],"all":[49],"them":[51],"is":[52,65,188],"practically":[53],"impossible":[54],"for":[55,151],"large":[56,94],"graphs.":[57],"Then,":[58],"two":[59],"questions":[60],"naturally":[61],"arise:":[62],"(Q1)":[63],"What":[64],"a":[66,75,93,102,119,147,152],"''good''":[67],"set":[68,76,104,121,154],"bi-cliques?":[71],"That":[72],"is,":[73],"given":[74,120],"in":[80,108],"the":[81,126,137,161,166,171,175,211],"input":[82,127,162],"graph,":[84,96,163],"how":[85,97,114],"should":[86],"evaluate":[88],"its":[89,201],"quality?":[90],"(Q2)":[91],"Given":[92],"rapidly":[100],"identify":[101],"high-quality":[103,153],"it?":[109],"Regarding":[110,142],"Q1,":[111],"measure":[113],"concisely,":[115],"precisely,":[116],"exhaustively":[118],"describes":[125],"graph.":[129],"We":[130,224],"combine":[131],"these":[132],"three":[133],"perspectives":[134],"systematically":[135],"Minimum":[138],"Description":[139],"Length":[140],"principle.":[141],"Q2,":[143],"propose":[145],"CutNPeel,":[146],"fast":[148],"search":[149,167,176],"algorithm":[150],"bi-cliques.":[157],"By":[158],"adaptively":[159],"re-partitioning":[160],"CutNPeel":[164,187,230],"reduces":[165],"space":[168],"at":[170],"same":[172],"time":[173],"improves":[174],"quality.":[177],"Our":[178],"experiments":[179],"using":[180],"six":[181],"real-world":[182],"graphs":[184,219],"demonstrate":[185],"that":[186],"(a)":[189],"High-quality:":[190],"providing":[191],"up":[195,206],"51.2%":[197],"better":[198],"quality":[199],"than":[200,210],"state-of-the-art":[202],"competitors,":[203],"(b)":[204],"Fast:":[205],"68.8X":[208],"faster":[209],"next-best":[212],"competitor,":[213],"(c)":[215],"Scalable:":[216],"scaling":[217],"with":[220],"134":[221],"million":[222],"edges.":[223],"also":[225],"show":[226],"successful":[227],"applications":[228],"compression":[233],"pattern":[235],"discovery.":[236]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}