{"id":"https://openalex.org/W2116650325","doi":"https://doi.org/10.1109/icdm.2011.101","title":"Mining Heavy Subgraphs in Time-Evolving Networks","display_name":"Mining Heavy Subgraphs in Time-Evolving Networks","publication_year":2011,"publication_date":"2011-12-01","ids":{"openalex":"https://openalex.org/W2116650325","doi":"https://doi.org/10.1109/icdm.2011.101","mag":"2116650325"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdm.2011.101","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5001272357","display_name":"Petko Bogdanov","orcid":"https://orcid.org/0000-0001-6310-3224"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Petko Bogdanov","raw_affiliation_strings":["[Dept. of Computer Science, University of California, Santa Barbara, CA, USA]"],"affiliations":[{"raw_affiliation_string":"[Dept. of Computer Science, University of California, Santa Barbara, CA, USA]","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007291317","display_name":"Misael Mongiov\u0131\u0300","orcid":"https://orcid.org/0000-0003-0528-5490"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Misael Mongiov\u00ec","raw_affiliation_strings":["[Dept. of Computer Science, University of California, Santa Barbara, CA, USA]"],"affiliations":[{"raw_affiliation_string":"[Dept. of Computer Science, University of California, Santa Barbara, CA, USA]","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036639779","display_name":"Ambuj K. Singh","orcid":"https://orcid.org/0000-0002-1997-7140"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ambuj K. Singh","raw_affiliation_strings":["[Dept. of Computer Science, University of California, Santa Barbara, CA, USA]"],"affiliations":[{"raw_affiliation_string":"[Dept. of Computer Science, University of California, Santa Barbara, CA, USA]","institution_ids":["https://openalex.org/I154570441"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.002,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":115,"citation_normalized_percentile":{"value":0.939255,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":99},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9996,"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.9996,"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.9971,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9869,"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/pruning","display_name":"Pruning","score":0.63530904}],"concepts":[{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.7313272},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7210921},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.63530904},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5561908},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4772082},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45517734},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43312895},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4251346},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.42145044},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2646502},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19976845},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16805038},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.13143224},{"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/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdm.2011.101","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":24,"referenced_works":["https://openalex.org/W1831144068","https://openalex.org/W1847535063","https://openalex.org/W2032672182","https://openalex.org/W2043905543","https://openalex.org/W2074613642","https://openalex.org/W2091895894","https://openalex.org/W2097056866","https://openalex.org/W2101196063","https://openalex.org/W2102135646","https://openalex.org/W2102470794","https://openalex.org/W2106236875","https://openalex.org/W2112056172","https://openalex.org/W2115155307","https://openalex.org/W2122659814","https://openalex.org/W2123442845","https://openalex.org/W2124387466","https://openalex.org/W2136151826","https://openalex.org/W2151078464","https://openalex.org/W2165557989","https://openalex.org/W2166563561","https://openalex.org/W2171662214","https://openalex.org/W2486046998","https://openalex.org/W2952627339","https://openalex.org/W323028997"],"related_works":["https://openalex.org/W4206442282","https://openalex.org/W2965171438","https://openalex.org/W2594301978","https://openalex.org/W2398738602","https://openalex.org/W2384505857","https://openalex.org/W2379704676","https://openalex.org/W2378744544","https://openalex.org/W2373300491","https://openalex.org/W1998810860","https://openalex.org/W1581805909"],"abstract_inverted_index":{"Networks":[0],"from":[1],"different":[2],"genres":[3],"are":[4,32],"not":[5],"static":[6,168],"entities,":[7],"but":[8],"exhibit":[9],"dynamic":[10,55,84],"behavior.":[11],"The":[12],"congestion":[13],"level":[14],"of":[15,49,75,134,142,148,170,192,222],"links":[16,31],"in":[17,21,51,63,68,82,102,151],"transportation":[18],"networks":[19,201],"varies":[20],"time":[22,117,236],"depending":[23],"on":[24,195],"the":[25,73,77,135,167,178],"traffic.":[26],"Similarly,":[27],"social":[28,199,215],"and":[29,53,104,144,160,172,181,198,213,229,235],"communication":[30,197,211],"employed":[33],"at":[34],"varying":[35],"rates":[36],"as":[37],"information":[38],"cascades":[39],"unfold.":[40],"In":[41],"recent":[42],"years":[43],"there":[44],"has":[45,60],"been":[46,61],"an":[47,106,131,146,188],"increase":[48],"interest":[50],"modeling":[52],"mining":[54],"networks.":[56,70],"However,":[57],"limited":[58],"attention":[59],"placed":[62],"high-scoring":[64],"sub":[65,80,204],"graph":[66,81,90,111],"discovery":[67],"time-evolving":[69],"We":[71,92,154,186],"define":[72,156],"problem":[74],"finding":[76],"highest-scoring":[78],"temporal":[79],"a":[83,120,157,161,226],"network,":[85],"termed":[86],"Heaviest":[87],"Dynamic":[88],"Sub":[89],"(HDS).":[91],"show":[93],"that":[94,113,206],"HDS":[95],"is":[96,219],"NP-hard":[97],"even":[98],"with":[99,232],"edge":[100],"weights":[101],"{-1,1}":[103],"devise":[105],"efficient":[107],"approach":[108,122,228],"for":[109,165,175,202],"large":[110],"instances":[112],"evolve":[114],"over":[115],"long":[116],"periods.":[118],"While":[119],"naive":[121,227],"would":[123],"enumerate":[124],"all":[125],"O(t^2)":[126],"sub-intervals,":[127],"our":[128,193],"solution":[129],"performs":[130],"effective":[132],"pruning":[133,177],"sub-interval":[136,179],"space":[137,180],"by":[138],"considering":[139],"O(t*log(t))":[140],"groups":[141],"sub-intervals":[143],"computing":[145],"aggregate":[147],"each":[149],"group":[150],"logarithmic":[152],"time.":[153],"also":[155],"fast":[158],"heuristic":[159],"tight":[162],"upper":[163],"bound":[164],"approximating":[166],"version":[169],"HDS,":[171],"use":[173],"them":[174],"further":[176],"quickly":[182],"verifying":[183],"candidate":[184],"sub-intervals.":[185],"perform":[187],"extensive":[189],"experimental":[190],"evaluation":[191],"algorithm":[194],"transportation,":[196],"media":[200],"discovering":[203],"graphs":[205],"correspond":[207],"to":[208],"traffic":[209],"congestions,":[210],"overflow":[212],"localized":[214],"discussions.":[216],"Our":[217],"method":[218],"two":[220],"orders":[221],"magnitude":[223],"faster":[224],"than":[225],"scales":[230],"well":[231],"network":[233],"size":[234],"length.":[237]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2116650325","counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":18},{"year":2018,"cited_by_count":14},{"year":2017,"cited_by_count":12},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":8}],"updated_date":"2025-01-19T18:08:33.169297","created_date":"2016-06-24"}