{"id":"https://openalex.org/W2054560566","doi":"https://doi.org/10.1145/2783258.2783385","title":"Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling","display_name":"Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling","publication_year":2015,"publication_date":"2015-08-07","ids":{"openalex":"https://openalex.org/W2054560566","doi":"https://doi.org/10.1145/2783258.2783385","mag":"2054560566"},"language":"en","primary_location":{"id":"doi:10.1145/2783258.2783385","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2783258.2783385","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","raw_type":"proceedings-article"},"type":"conference-paper","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/A5062318856","display_name":"Michael Mitzenmacher","orcid":"https://orcid.org/0000-0001-5430-5457"},"institutions":[{"id":"https://openalex.org/I2801851002","display_name":"Harvard University Press","ror":"https://ror.org/006v7bf86","country_code":"US","type":"other","lineage":["https://openalex.org/I136199984","https://openalex.org/I2801851002"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael Mitzenmacher","raw_affiliation_strings":["Harvard University, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Harvard University, Cambridge, MA, USA","institution_ids":["https://openalex.org/I2801851002"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011053473","display_name":"Jakub Pachocki","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jakub Pachocki","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112534230","display_name":"Richard Peng","orcid":null},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Richard Peng","raw_affiliation_strings":["MIT, Cambridge, MA, USA","MIT, Cambridge MA, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"MIT, Cambridge MA, USA#TAB#","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069421706","display_name":"Charalampos E. Tsourakakis","orcid":"https://orcid.org/0000-0001-5591-3585"},"institutions":[{"id":"https://openalex.org/I2801851002","display_name":"Harvard University Press","ror":"https://ror.org/006v7bf86","country_code":"US","type":"other","lineage":["https://openalex.org/I136199984","https://openalex.org/I2801851002"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Charalampos Tsourakakis","raw_affiliation_strings":["Harvard University, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Harvard University, Cambridge, MA, USA","institution_ids":["https://openalex.org/I2801851002"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101058638","display_name":"Shen Xu","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shen Chen Xu","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA","Carnegie-Mellon University, Pittsburgh, Pa., USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie-Mellon University, Pittsburgh, Pa., USA#TAB#","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":9.9815,"has_fulltext":false,"cited_by_count":135,"citation_normalized_percentile":{"value":0.99026764,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"815","last_page":"824"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.9958000183105469,"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/scalability","display_name":"Scalability","score":0.6522965431213379},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6251715421676636},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.5450693368911743},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5408994555473328},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.500699520111084},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.4659608006477356},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4462781250476837},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4245012104511261},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.41273701190948486},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3718159794807434},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3596823811531067},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3545878231525421},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10457953810691833}],"concepts":[{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6522965431213379},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6251715421676636},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.5450693368911743},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5408994555473328},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.500699520111084},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.4659608006477356},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4462781250476837},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4245012104511261},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.41273701190948486},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3718159794807434},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3596823811531067},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3545878231525421},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10457953810691833},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2783258.2783385","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2783258.2783385","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.726.2701","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.726.2701","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.seas.harvard.edu/%7Ebabis/scalable-large-near-cliques.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":62,"referenced_works":["https://openalex.org/W183656749","https://openalex.org/W1016718777","https://openalex.org/W1500512125","https://openalex.org/W1501644705","https://openalex.org/W1535144194","https://openalex.org/W1567562836","https://openalex.org/W1576857282","https://openalex.org/W1586552957","https://openalex.org/W1595409123","https://openalex.org/W1604983895","https://openalex.org/W1676999057","https://openalex.org/W1758126261","https://openalex.org/W1868111879","https://openalex.org/W1888358353","https://openalex.org/W1968895412","https://openalex.org/W1977458171","https://openalex.org/W1978024959","https://openalex.org/W2002205566","https://openalex.org/W2005499394","https://openalex.org/W2009723146","https://openalex.org/W2012776084","https://openalex.org/W2013414394","https://openalex.org/W2013469283","https://openalex.org/W2030365814","https://openalex.org/W2032279394","https://openalex.org/W2033698604","https://openalex.org/W2036836182","https://openalex.org/W2045107949","https://openalex.org/W2045446569","https://openalex.org/W2047923585","https://openalex.org/W2050511894","https://openalex.org/W2051109346","https://openalex.org/W2051540665","https://openalex.org/W2055245094","https://openalex.org/W2079535727","https://openalex.org/W2081254453","https://openalex.org/W2082603400","https://openalex.org/W2084990336","https://openalex.org/W2090359754","https://openalex.org/W2111708605","https://openalex.org/W2112681514","https://openalex.org/W2116007667","https://openalex.org/W2119757574","https://openalex.org/W2121526866","https://openalex.org/W2133238553","https://openalex.org/W2136850043","https://openalex.org/W2150187954","https://openalex.org/W2152216760","https://openalex.org/W2153250079","https://openalex.org/W2217968126","https://openalex.org/W2266714125","https://openalex.org/W2401365453","https://openalex.org/W2607539118","https://openalex.org/W2952763838","https://openalex.org/W2953102514","https://openalex.org/W3004555699","https://openalex.org/W4230053343","https://openalex.org/W6607484853","https://openalex.org/W6626316349","https://openalex.org/W6635066253","https://openalex.org/W6637459119","https://openalex.org/W6713179650"],"related_works":["https://openalex.org/W2091826982","https://openalex.org/W245205139","https://openalex.org/W2036057584","https://openalex.org/W4246000090","https://openalex.org/W2107875203","https://openalex.org/W4234658180","https://openalex.org/W4235849992","https://openalex.org/W2910933086","https://openalex.org/W3143578817","https://openalex.org/W4288630335"],"abstract_inverted_index":{"Extracting":[0],"dense":[1],"subgraphs":[2],"from":[3,18],"large":[4],"graphs":[5,102],"is":[6,68],"a":[7,11,35,69,78,125],"key":[8],"primitive":[9],"in":[10,124],"variety":[12],"of":[13,37,98],"graph":[14,25],"mining":[15,19],"applications,":[16],"ranging":[17],"social":[20],"networks":[21],"and":[22,89,111,121],"the":[23,43,52,55,105],"Web":[24],"to":[26,100],"bioinformatics":[27],"[41].":[28],"In":[29],"this":[30,96],"paper":[31],"we":[32],"focus":[33],"on":[34],"family":[36,97],"poly-time":[38],"solvable":[39],"formulations,":[40],"known":[41],"as":[42],"k-clique":[44],"densest":[45,57,74,107],"subgraph":[46,58,75,108],"problem":[47,53,59,109],"(k-Clique-DSP)":[48],"[57].":[49],"When":[50],"k=2,":[51],"becomes":[54],"well-known":[56],"(DSP)":[60],"[22,":[61],"31,":[62],"33,":[63],"39].":[64],"Our":[65],"main":[66],"contribution":[67],"sampling":[70],"scheme":[71],"that":[72,81,116],"gives":[73],"sparsifier,":[76],"yielding":[77],"randomized":[79],"algorithm":[80,115],"produces":[82],"high-quality":[83],"approximations":[84],"while":[85],"providing":[86],"significant":[87],"speedups":[88],"improved":[90],"space":[91],"complexity.":[92],"We":[93],"also":[94],"extend":[95],"formulations":[99],"bipartite":[101],"by":[103],"introducing":[104],"(p,q)-biclique":[106],"((p,q)-Biclique-DSP),":[110],"devise":[112],"an":[113],"exact":[114],"can":[117],"treat":[118],"both":[119],"clique":[120],"biclique":[122],"densities":[123],"unified":[126],"way.":[127]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":17},{"year":2023,"cited_by_count":16},{"year":2022,"cited_by_count":20},{"year":2021,"cited_by_count":14},{"year":2020,"cited_by_count":14},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":2}],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2025-10-10T00:00:00"}