{"id":"https://openalex.org/W2783860665","doi":"https://doi.org/10.1109/bigdata.2017.8258017","title":"Graphical approach for influence maximization in social networks under generic threshold-based non-submodular model","display_name":"Graphical approach for influence maximization in social networks under generic threshold-based non-submodular model","publication_year":2017,"publication_date":"2017-12-01","ids":{"openalex":"https://openalex.org/W2783860665","doi":"https://doi.org/10.1109/bigdata.2017.8258017","mag":"2783860665"},"language":"en","primary_location":{"id":"doi:10.1109/bigdata.2017.8258017","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata.2017.8258017","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Big Data (Big Data)","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/A5100733565","display_name":"Liang Ma","orcid":"https://orcid.org/0000-0002-4366-0784"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liang Ma","raw_affiliation_strings":["IBM T. J. Watson Research, Yorktown, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM T. J. Watson Research, Yorktown, NY, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102287047","display_name":"Guohong Cao","orcid":null},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guohong Cao","raw_affiliation_strings":["Pennsylvania State University, University Park, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Pennsylvania State University, University Park, PA, USA","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022713560","display_name":"Lance Kaplan","orcid":"https://orcid.org/0000-0002-3627-4471"},"institutions":[{"id":"https://openalex.org/I166416128","display_name":"DEVCOM Army Research Laboratory","ror":"https://ror.org/011hc8f90","country_code":"US","type":"government","lineage":["https://openalex.org/I1304082316","https://openalex.org/I1330347796","https://openalex.org/I166416128","https://openalex.org/I2802705668","https://openalex.org/I4210154437"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lance Kaplan","raw_affiliation_strings":["Army Research Laboratory, Adelphi, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Army Research Laboratory, Adelphi, MD, USA","institution_ids":["https://openalex.org/I166416128"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"970","last_page":"975"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":1.0,"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":1.0,"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.9991000294685364,"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/T11980","display_name":"Human Mobility and Location-Based Analysis","score":0.9689000248908997,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.9854082465171814},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.7169578671455383},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.704316258430481},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6606649160385132},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6352765560150146},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5771926045417786},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5670122504234314},{"id":"https://openalex.org/keywords/social-network","display_name":"Social network (sociolinguistics)","score":0.5028240084648132},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4952327311038971},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4572553038597107},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4393256604671478},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4231644570827484},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.41617298126220703},{"id":"https://openalex.org/keywords/graphical-model","display_name":"Graphical model","score":0.41582566499710083},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4100245237350464},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2932133376598358},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24419543147087097},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22707390785217285},{"id":"https://openalex.org/keywords/social-media","display_name":"Social media","score":0.19273868203163147}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9854082465171814},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.7169578671455383},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.704316258430481},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6606649160385132},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6352765560150146},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5771926045417786},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5670122504234314},{"id":"https://openalex.org/C4727928","wikidata":"https://www.wikidata.org/wiki/Q17164759","display_name":"Social network (sociolinguistics)","level":3,"score":0.5028240084648132},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4952327311038971},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4572553038597107},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4393256604671478},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4231644570827484},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.41617298126220703},{"id":"https://openalex.org/C155846161","wikidata":"https://www.wikidata.org/wiki/Q1143367","display_name":"Graphical model","level":2,"score":0.41582566499710083},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4100245237350464},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2932133376598358},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24419543147087097},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22707390785217285},{"id":"https://openalex.org/C518677369","wikidata":"https://www.wikidata.org/wiki/Q202833","display_name":"Social media","level":2,"score":0.19273868203163147},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/bigdata.2017.8258017","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata.2017.8258017","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Big Data (Big Data)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W137627111","https://openalex.org/W638149299","https://openalex.org/W808055529","https://openalex.org/W1680189815","https://openalex.org/W1984069252","https://openalex.org/W2015035514","https://openalex.org/W2041157860","https://openalex.org/W2042123098","https://openalex.org/W2056609785","https://openalex.org/W2061820396","https://openalex.org/W2108858998","https://openalex.org/W2137096596","https://openalex.org/W2141403143","https://openalex.org/W2145287244","https://openalex.org/W2160411082","https://openalex.org/W2393444374","https://openalex.org/W2399404755","https://openalex.org/W2401290885","https://openalex.org/W2478644023","https://openalex.org/W2755088640","https://openalex.org/W2963122331","https://openalex.org/W2963827921","https://openalex.org/W3115212327","https://openalex.org/W3123608443","https://openalex.org/W6788037297"],"related_works":["https://openalex.org/W2896347948","https://openalex.org/W2402949237","https://openalex.org/W4302557420","https://openalex.org/W2950500962","https://openalex.org/W2915041254","https://openalex.org/W2594118609","https://openalex.org/W2765425000","https://openalex.org/W3204684126","https://openalex.org/W2735578456","https://openalex.org/W2891776881"],"abstract_inverted_index":{"As":[0],"a":[1,10,45,56,130,160],"widely":[2],"observable":[3],"social":[4,23,30,57],"effect,":[5,31],"influence":[6,35,67,140,166,239],"diffusion":[7,81,105],"refers":[8],"to":[9,43,117,176,206],"process":[11],"where":[12,39],"innovations,":[13],"trends,":[14],"awareness,":[15],"etc.":[16],"spread":[17],"across":[18],"the":[19,22,32,40,49,65,89,92,99,104,110,148,182,189,197,220,224,231,250,254],"network":[20,58,156,183],"via":[21],"impact":[24],"among":[25],"individuals.":[26],"Motivated":[27],"by":[28,98,120,150,185,210],"such":[29],"concept":[33],"of":[34,48,72,132,226,253,260],"maximization":[36,141],"is":[37,42,77,128,230],"coined,":[38],"goal":[41],"select":[44],"bounded":[46],"number":[47],"most":[50],"influential":[51],"nodes":[52,214],"(seed":[53],"nodes)":[54],"from":[55],"so":[59],"that":[60,135,180,195,235],"they":[61],"can":[62,95,136],"jointly":[63],"trigger":[64],"maximal":[66],"diffusion.":[68],"A":[69],"rich":[70],"body":[71],"research":[73,111],"in":[74,159,196,219],"this":[75,144,170,229],"area":[76],"performed":[78],"under":[79],"statistical":[80],"models":[82,106],"with":[83],"provable":[84],"submodularity,":[85],"which":[86,257],"essentially":[87],"simplifies":[88],"problem":[90],"as":[91,194],"optimal":[93,191],"result":[94],"be":[96],"approximated":[97],"simple":[100],"greedy":[101],"search.":[102],"When":[103],"are":[107,258],"non-submodular,":[108],"however,":[109],"community":[112],"mostly":[113],"focuses":[114],"on":[115,242],"how":[116],"bound/approximate":[118],"them":[119],"tractable":[121],"submodular":[122],"functions.":[123],"In":[124,143],"other":[125],"words,":[126],"there":[127],"still":[129],"lack":[131],"efficient":[133,208],"methods":[134],"directly":[137,236],"resolve":[138],"non-submodular":[139,162,238],"problems.":[142],"regard,":[145],"we":[146,172],"fill":[147],"gap":[149],"proposing":[151],"seed":[152,192],"selection":[153],"strategies":[154],"using":[155],"graphical":[157,178],"properties":[158],"generalized":[161],"threshold-based":[163],"model,":[164,171],"called":[165],"barricade":[167],"model.":[168],"Under":[169],"first":[173,232],"establish":[174],"theories":[175],"reveal":[177],"conditions":[179,205],"ensure":[181],"generated":[184],"node":[186],"removals":[187],"has":[188],"same":[190],"set":[193],"original":[198],"network.":[199,222],"We":[200],"then":[201],"exploit":[202],"these":[203],"theoretical":[204],"develop":[207],"algorithms":[209],"strategically":[211],"removing":[212],"less-important":[213],"and":[215,245],"selecting":[216],"seeds":[217],"only":[218],"remaining":[221],"To":[223],"best":[225],"our":[227],"knowledge,":[228],"graph-based":[233],"approach":[234],"tackles":[237],"maximization.":[240],"Evaluations":[241],"both":[243],"synthetic":[244],"real-world":[246],"Facebook/Twitter":[247],"datasets":[248],"confirm":[249],"superior":[251],"efficiency":[252],"proposed":[255],"algorithms,":[256],"orders":[259],"magnitude":[261],"faster":[262],"than":[263],"benchmarks":[264],"for":[265],"large":[266],"networks.":[267]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}