{"id":"https://openalex.org/W2919343842","doi":"https://doi.org/10.1145/3297156.3297185","title":"Dynamic Update Upper Bounds Influence Maximization Algorithm","display_name":"Dynamic Update Upper Bounds Influence Maximization Algorithm","publication_year":2018,"publication_date":"2018-12-08","ids":{"openalex":"https://openalex.org/W2919343842","doi":"https://doi.org/10.1145/3297156.3297185","mag":"2919343842"},"language":"en","primary_location":{"id":"doi:10.1145/3297156.3297185","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3297156.3297185","pdf_url":null,"source":{"id":"https://openalex.org/S4306523626","display_name":"Proceedings of the 2018 2nd International Conference on Computer Science and Artificial Intelligence","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 2018 2nd International Conference on Computer Science and Artificial Intelligence","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/A5104096891","display_name":"Junying Shang","orcid":null},"institutions":[{"id":"https://openalex.org/I125839683","display_name":"Beijing Institute of Technology","ror":"https://ror.org/01skt4w74","country_code":"CN","type":"education","lineage":["https://openalex.org/I125839683","https://openalex.org/I890469752"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Junying Shang","raw_affiliation_strings":["Beijing Institute of Technology, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Beijing Institute of Technology, Beijing, China","institution_ids":["https://openalex.org/I125839683"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100342160","display_name":"Kan Li","orcid":"https://orcid.org/0000-0003-3528-4739"},"institutions":[{"id":"https://openalex.org/I125839683","display_name":"Beijing Institute of Technology","ror":"https://ror.org/01skt4w74","country_code":"CN","type":"education","lineage":["https://openalex.org/I125839683","https://openalex.org/I890469752"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Kan Li","raw_affiliation_strings":["Beijing Institute of Technology, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Beijing Institute of Technology, Beijing, China","institution_ids":["https://openalex.org/I125839683"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5104096891"],"corresponding_institution_ids":["https://openalex.org/I125839683"],"apc_list":null,"apc_paid":null,"fwci":0.2289,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.61031519,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"212","last_page":"217"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9998999834060669,"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.9998999834060669,"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/T12592","display_name":"Opinion Dynamics and Social Influence","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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9797000288963318,"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/maximization","display_name":"Maximization","score":0.7679455280303955},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.7245745658874512},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7013943791389465},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6905125975608826},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6694591641426086},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6049050092697144},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5849279761314392},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5389398336410522},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4701136648654938},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.4601510167121887},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20861080288887024},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.06052771210670471},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.05803140997886658}],"concepts":[{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.7679455280303955},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.7245745658874512},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7013943791389465},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6905125975608826},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6694591641426086},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6049050092697144},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5849279761314392},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5389398336410522},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4701136648654938},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.4601510167121887},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20861080288887024},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.06052771210670471},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.05803140997886658},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"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/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3297156.3297185","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3297156.3297185","pdf_url":null,"source":{"id":"https://openalex.org/S4306523626","display_name":"Proceedings of the 2018 2nd International Conference on Computer Science and Artificial Intelligence","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 2018 2nd International Conference on Computer Science and Artificial Intelligence","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.6899999976158142}],"awards":[],"funders":[{"id":"https://openalex.org/F4320335777","display_name":"National Key Research and Development Program of China","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1944367023","https://openalex.org/W1984069252","https://openalex.org/W1988717476","https://openalex.org/W1990570693","https://openalex.org/W2042123098","https://openalex.org/W2061820396","https://openalex.org/W2065851162","https://openalex.org/W2108278206","https://openalex.org/W2108858998","https://openalex.org/W2132801025","https://openalex.org/W2141403143","https://openalex.org/W2158478952","https://openalex.org/W2166470254","https://openalex.org/W2398424829","https://openalex.org/W2963122331"],"related_works":["https://openalex.org/W2891776881","https://openalex.org/W2244559970","https://openalex.org/W1827895227","https://openalex.org/W2557467218","https://openalex.org/W2536297025","https://openalex.org/W2387536556","https://openalex.org/W2771290394","https://openalex.org/W2918080139","https://openalex.org/W4285104409","https://openalex.org/W3094650923"],"abstract_inverted_index":{"In":[0,34,56],"the":[1,23,35,40,61,65,94,103,112,115,123,128],"field":[2],"of":[3,26,37,64,68,71,114,130],"social":[4],"network":[5],"analysis,":[6],"influence":[7,27,38],"maximization":[8],"is":[9,16],"an":[10,75,83],"important":[11],"research":[12,41],"area.":[13],"The":[14],"goal":[15],"to":[17,51,119],"find":[18],"K":[19],"nodes":[20],"that":[21,93],"maximize":[22],"final":[24],"range":[25],"based":[28,43,59],"on":[29,44,49,60],"a":[30,137],"given":[31],"spread":[32],"model.":[33],"study":[36],"maximization,":[39],"method":[42],"greedy":[45],"algorithm":[46,81,96],"mainly":[47],"focuses":[48],"how":[50],"further":[52],"reduce":[53,98],"Monte-Carlo":[54],"simulations.":[55],"this":[57],"paper,":[58],"dynamic":[62],"update":[63],"upper":[66],"bound":[67],"marginal":[69],"benefit":[70],"node,":[72],"we":[73],"propose":[74],"Upper":[76,84],"Bound":[77,85],"Update":[78,86],"Greedy":[79],"(UBUG)":[80],"and":[82,106],"Heuristic":[87],"(UBUH)":[88],"algorithm.":[89],"Experimental":[90],"results":[91],"show":[92],"UBUG":[95],"can":[97],"more":[99],"MC":[100],"simulations":[101],"than":[102],"CELF":[104],"[1]":[105],"UBLF":[107],"[2]":[108],"algorithms":[109],"without":[110],"losing":[111],"accuracy":[113],"results.":[116],"And":[117],"compared":[118],"other":[120],"heuristic":[121],"algorithms,":[122],"UBUH":[124],"not":[125],"only":[126],"meets":[127],"requirements":[129],"high":[131],"calculation":[132],"speed":[133],"but":[134],"also":[135],"has":[136],"good":[138],"accuracy.":[139]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}