{"id":"https://openalex.org/W2140591663","doi":"https://doi.org/10.1145/2433396.2433480","title":"On the streaming complexity of computing local clustering coefficients","display_name":"On the streaming complexity of computing local clustering coefficients","publication_year":2013,"publication_date":"2013-02-04","ids":{"openalex":"https://openalex.org/W2140591663","doi":"https://doi.org/10.1145/2433396.2433480","mag":"2140591663"},"language":"en","primary_location":{"id":"doi:10.1145/2433396.2433480","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2433396.2433480","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the sixth 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/A5069687493","display_name":"Konstantin Kutzkov","orcid":"https://orcid.org/0000-0002-7334-6868"},"institutions":[{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Konstantin Kutzkov","raw_affiliation_strings":["IT University of Copenhagen, Copenhagen, Denmark","It university of copenhagen, copenhagen, denmark#TAB#"],"affiliations":[{"raw_affiliation_string":"IT University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I83467386"]},{"raw_affiliation_string":"It university of copenhagen, copenhagen, denmark#TAB#","institution_ids":["https://openalex.org/I83467386"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014293815","display_name":"Rasmus Pagh","orcid":"https://orcid.org/0000-0002-1516-9306"},"institutions":[{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Rasmus Pagh","raw_affiliation_strings":["IT University of Copenhagen, Copenhagen, Denmark","It university of copenhagen, copenhagen, denmark#TAB#"],"affiliations":[{"raw_affiliation_string":"IT University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I83467386"]},{"raw_affiliation_string":"It university of copenhagen, copenhagen, denmark#TAB#","institution_ids":["https://openalex.org/I83467386"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5069687493"],"corresponding_institution_ids":["https://openalex.org/I83467386"],"apc_list":null,"apc_paid":null,"fwci":2.2428,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.88571162,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"677","last_page":"686"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9998000264167786,"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.9998000264167786,"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/T11106","display_name":"Data Management and Algorithms","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9962999820709229,"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/cluster-analysis","display_name":"Cluster analysis","score":0.7181786298751831},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6723417639732361},{"id":"https://openalex.org/keywords/streaming-algorithm","display_name":"Streaming algorithm","score":0.6353030800819397},{"id":"https://openalex.org/keywords/impossibility","display_name":"Impossibility","score":0.6182995438575745},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.607517421245575},{"id":"https://openalex.org/keywords/algorithmic-complexity","display_name":"Algorithmic complexity","score":0.48371556401252747},{"id":"https://openalex.org/keywords/streaming-data","display_name":"Streaming data","score":0.480476051568985},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47235000133514404},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43612924218177795},{"id":"https://openalex.org/keywords/clustering-coefficient","display_name":"Clustering coefficient","score":0.43395429849624634},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4130502939224243},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.2842187285423279},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2707803249359131},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15795642137527466},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.10887736082077026}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.7181786298751831},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6723417639732361},{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.6353030800819397},{"id":"https://openalex.org/C2776261394","wikidata":"https://www.wikidata.org/wiki/Q315562","display_name":"Impossibility","level":2,"score":0.6182995438575745},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.607517421245575},{"id":"https://openalex.org/C2983064736","wikidata":"https://www.wikidata.org/wiki/Q20779668","display_name":"Algorithmic complexity","level":2,"score":0.48371556401252747},{"id":"https://openalex.org/C2777611316","wikidata":"https://www.wikidata.org/wiki/Q39045282","display_name":"Streaming data","level":2,"score":0.480476051568985},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47235000133514404},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43612924218177795},{"id":"https://openalex.org/C22047676","wikidata":"https://www.wikidata.org/wiki/Q898680","display_name":"Clustering coefficient","level":3,"score":0.43395429849624634},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4130502939224243},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.2842187285423279},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2707803249359131},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15795642137527466},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.10887736082077026},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2433396.2433480","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2433396.2433480","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the sixth ACM international conference on Web search and data mining","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:publications/767652ad-b1d4-4c0c-b0fb-d61040ef1210","is_oa":false,"landing_page_url":"https://pure.itu.dk/portal/da/publications/767652ad-b1d4-4c0c-b0fb-d61040ef1210","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Kutzkov, K & Pagh, R 2013, On the streaming complexity of computing local clustering coefficients. in WSDM '13 Proceedings of the sixth ACM international conference on Web search and data mining. Association for Computing Machinery, pp. 677-686 . https://doi.org/10.1145/2433396.2433480","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.303.6617","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.303.6617","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.itu.dk/people/pagh/papers/clustercoeff.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W1508887260","https://openalex.org/W1542957328","https://openalex.org/W1551652843","https://openalex.org/W1967066104","https://openalex.org/W1980223785","https://openalex.org/W1991800036","https://openalex.org/W1993355353","https://openalex.org/W1997010704","https://openalex.org/W2002205566","https://openalex.org/W2002576896","https://openalex.org/W2038073775","https://openalex.org/W2058357179","https://openalex.org/W2081193615","https://openalex.org/W2085491458","https://openalex.org/W2086694417","https://openalex.org/W2094631006","https://openalex.org/W2112090702","https://openalex.org/W2113139394","https://openalex.org/W2115059495","https://openalex.org/W2116759966","https://openalex.org/W2117071406","https://openalex.org/W2117848926","https://openalex.org/W2119885577","https://openalex.org/W2120595041","https://openalex.org/W2124637492","https://openalex.org/W2134491124","https://openalex.org/W2144146806","https://openalex.org/W2148606196","https://openalex.org/W2151626491","https://openalex.org/W2154191591","https://openalex.org/W2158432527","https://openalex.org/W2342372809","https://openalex.org/W3123534837","https://openalex.org/W3142570770","https://openalex.org/W3143219376","https://openalex.org/W4230053343","https://openalex.org/W6630324137"],"related_works":["https://openalex.org/W3191101401","https://openalex.org/W2241126753","https://openalex.org/W1824789409","https://openalex.org/W2991654599","https://openalex.org/W201138236","https://openalex.org/W3122033752","https://openalex.org/W2128692898","https://openalex.org/W2398953209","https://openalex.org/W1733902306","https://openalex.org/W3002138439"],"abstract_inverted_index":{"Due":[0],"to":[1,84,95],"a":[2,19],"large":[3],"number":[4,12,75,80],"of":[5,9,13,21,28,55,72,76,81],"applications,":[6],"the":[7,11,24,30,39,52,56,70,73,79,98,106,112],"problem":[8,27],"estimating":[10,29],"triangles":[14,82],"in":[15,38,61],"graphs":[16],"revealed":[17],"as":[18],"stream":[20],"edges,":[22],"and":[23,45,93,110],"closely":[25],"related":[26],"graph's":[31],"clustering":[32],"coefficient,":[33],"have":[34,48],"received":[35],"considerable":[36],"attention":[37],"last":[40],"decade.":[41],"Both":[42],"efficient":[43],"algorithms":[44,68,88,113],"impossibility":[46],"results":[47],"shed":[49],"light":[50],"on":[51],"computational":[53],"complexity":[54],"problem.":[57,99],"Motivated":[58],"by":[59],"applications":[60],"Web":[62],"mining,":[63],"Becchetti":[64],"et":[65],"al.~presented":[66],"new":[67],"for":[69,117],"estimation":[71],"local":[74],"triangles,":[77],"i.e.,":[78],"incident":[83],"individual":[85],"vertices.":[86],"The":[87],"are":[89,108,114],"shown,":[90],"both":[91],"theoretically":[92],"experimentally,":[94],"efficiently":[96],"handle":[97],"However,":[100],"at":[101],"least":[102],"two":[103],"passes":[104],"over":[105],"data":[107],"needed":[109],"thus":[111],"not":[115],"suitable":[116],"real":[118],"streaming":[119],"scenarios.":[120]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}