{"id":"https://openalex.org/W7109038130","doi":"https://doi.org/10.1145/3769791","title":"Estimating Biclique Counts with Accuracy Guarantees","display_name":"Estimating Biclique Counts with Accuracy Guarantees","publication_year":2025,"publication_date":"2025-12-04","ids":{"openalex":"https://openalex.org/W7109038130","doi":"https://doi.org/10.1145/3769791"},"language":"en","primary_location":{"id":"doi:10.1145/3769791","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3769791","pdf_url":null,"source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1145/3769791","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Rashmika Gamage","orcid":"https://orcid.org/0000-0001-7838-6079"},"institutions":[{"id":"https://openalex.org/I129604602","display_name":"The University of Sydney","ror":"https://ror.org/0384j8v12","country_code":"AU","type":"education","lineage":["https://openalex.org/I129604602"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Rashmika Gamage","raw_affiliation_strings":["The University of Sydney, Sydney, Australia"],"raw_orcid":"https://orcid.org/0000-0001-7838-6079","affiliations":[{"raw_affiliation_string":"The University of Sydney, Sydney, Australia","institution_ids":["https://openalex.org/I129604602"]}]},{"author_position":"last","author":{"id":null,"display_name":"Lijun Chang","orcid":"https://orcid.org/0000-0002-6830-3900"},"institutions":[{"id":"https://openalex.org/I129604602","display_name":"The University of Sydney","ror":"https://ror.org/0384j8v12","country_code":"AU","type":"education","lineage":["https://openalex.org/I129604602"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Lijun Chang","raw_affiliation_strings":["The University of Sydney, Sydney, Australia"],"raw_orcid":"https://orcid.org/0000-0002-6830-3900","affiliations":[{"raw_affiliation_string":"The University of Sydney, Sydney, Australia","institution_ids":["https://openalex.org/I129604602"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I129604602"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.53807999,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":"6","first_page":"1","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.3199999928474426,"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.3199999928474426,"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/T10887","display_name":"Bioinformatics and Genomic Networks","score":0.0706000030040741,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.06120000034570694,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/bipartite-graph","display_name":"Bipartite graph","score":0.6759999990463257},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6593999862670898},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.5461999773979187},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.44290000200271606},{"id":"https://openalex.org/keywords/sample","display_name":"Sample (material)","score":0.43639999628067017},{"id":"https://openalex.org/keywords/scale","display_name":"Scale (ratio)","score":0.43209999799728394},{"id":"https://openalex.org/keywords/importance-sampling","display_name":"Importance sampling","score":0.3456999957561493},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3343000113964081},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3321000039577484}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6759999990463257},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6593999862670898},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5963000059127808},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5946999788284302},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.5461999773979187},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.44290000200271606},{"id":"https://openalex.org/C198531522","wikidata":"https://www.wikidata.org/wiki/Q485146","display_name":"Sample (material)","level":2,"score":0.43639999628067017},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.43209999799728394},{"id":"https://openalex.org/C52740198","wikidata":"https://www.wikidata.org/wiki/Q1539564","display_name":"Importance sampling","level":3,"score":0.3456999957561493},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3343000113964081},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3321000039577484},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.325300008058548},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31779998540878296},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.3174999952316284},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3046000003814697},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.296099990606308},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.2924000024795532},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.29089999198913574},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.2822999954223633},{"id":"https://openalex.org/C75917345","wikidata":"https://www.wikidata.org/wiki/Q2725298","display_name":"Sampling bias","level":3,"score":0.27549999952316284},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.2736999988555908},{"id":"https://openalex.org/C129848803","wikidata":"https://www.wikidata.org/wiki/Q2564360","display_name":"Sample size determination","level":2,"score":0.26910001039505005},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.26429998874664307},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.2599000036716461},{"id":"https://openalex.org/C100279318","wikidata":"https://www.wikidata.org/wiki/Q467440","display_name":"Sample space","level":2,"score":0.2596000134944916},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.2513999938964844}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3769791","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3769791","pdf_url":null,"source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3769791","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3769791","pdf_url":null,"source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3323630674","display_name":"Directionality-Aware Cohesive Subgraph Search over Directed Graphs","funder_award_id":"DP220103731","funder_id":"https://openalex.org/F4320334704","funder_display_name":"Australian Research Council"}],"funders":[{"id":"https://openalex.org/F4320334704","display_name":"Australian Research Council","ror":"https://ror.org/05mmh0f86"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W2006135590","https://openalex.org/W2022996068","https://openalex.org/W2027684023","https://openalex.org/W2054560566","https://openalex.org/W2124849682","https://openalex.org/W2550802162","https://openalex.org/W2605850919","https://openalex.org/W2759633270","https://openalex.org/W2787993231","https://openalex.org/W2997302914","https://openalex.org/W3037117430","https://openalex.org/W3084844108","https://openalex.org/W3166231268","https://openalex.org/W4210757530","https://openalex.org/W4223926598","https://openalex.org/W4281868159","https://openalex.org/W4283325326","https://openalex.org/W4380433124","https://openalex.org/W4386634620","https://openalex.org/W4393183810","https://openalex.org/W4401508059","https://openalex.org/W4402041895","https://openalex.org/W4407357355","https://openalex.org/W4408061188","https://openalex.org/W6967000870"],"related_works":[],"abstract_inverted_index":{"Efficiently":[0],"counting":[1,51],"bicliques":[2,89],"in":[3,13,90],"large":[4,29,167],"bipartite":[5],"graphs":[6],"is":[7],"a":[8,61,134,142],"fundamental":[9],"problem":[10,52],"with":[11,133,145],"applications":[12],"network":[14],"analysis,":[15],"bioinformatics,":[16],"and":[17,31,119,149,159,173],"social":[18],"sciences.":[19],"However,":[20],"existing":[21],"exact":[22],"algorithms":[23,34],"do":[24],"not":[25],"scale":[26],"well":[27],"to":[28,75,115,125],"graphs,":[30],"current":[32],"approximation":[33,46],"lack":[35],"formal":[36,55],"accuracy":[37,56,158],"guarantees.":[38,57],"In":[39],"this":[40],"paper,":[41],"we":[42],"present":[43],"the":[44,49,69,86,91,95,107,156],"first":[45],"algorithm":[47,104],"for":[48,100],"(p,q)-biclique":[50],"that":[53,112],"offers":[54],"Our":[58,103],"approach":[59],"introduces":[60],"novel":[62],"sampling":[63,131,136],"framework,":[64],"termed":[65],"BC-Shadow,":[66],"which":[67,140],"refines":[68],"sample":[70,92],"space":[71],"using":[72],"edge-oriented":[73],"techniques":[74],"strategically":[76],"balance":[77],"computational":[78],"costs":[79],"across":[80],"algorithmic":[81],"stages.":[82],"This":[83],"refinement":[84],"increases":[85],"density":[87],"of":[88,97,109],"space,":[93],"reducing":[94],"number":[96,108],"samples":[98,111],"required":[99],"accurate":[101],"estimation.":[102],"adaptively":[105],"determines":[106],"successful":[110],"are":[113],"needed":[114],"satisfy":[116],"predefined":[117],"error":[118],"failure":[120],"probability,":[121],"enabling":[122],"real-time":[123],"adjustment":[124],"graph":[126],"properties.":[127],"We":[128],"further":[129],"enhance":[130],"efficiency":[132],"new":[135],"structure,":[137],"named":[138],"zstar,":[139],"establishes":[141],"one-to-one":[143],"correspondence":[144],"(p,q)-bicliques,":[146],"eliminating":[147],"redundancies":[148],"improving":[150],"accuracy.":[151],"Comprehensive":[152],"theoretical":[153],"analyses":[154],"confirm":[155],"algorithm's":[157],"running":[160],"time":[161],"guarantees,":[162],"while":[163],"extensive":[164],"experiments":[165],"on":[166],"real-world":[168],"datasets":[169],"demonstrate":[170],"its":[171],"scalability":[172],"effectiveness.":[174]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-12-06T00:00:00"}