{"id":"https://openalex.org/W4410771013","doi":"https://doi.org/10.1109/cacml64929.2025.11010959","title":"Rumor Suppression Maximization Algorithm Based on Local Dominance Tree","display_name":"Rumor Suppression Maximization Algorithm Based on Local Dominance Tree","publication_year":2025,"publication_date":"2025-03-28","ids":{"openalex":"https://openalex.org/W4410771013","doi":"https://doi.org/10.1109/cacml64929.2025.11010959"},"language":"en","primary_location":{"id":"doi:10.1109/cacml64929.2025.11010959","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cacml64929.2025.11010959","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 4th Asia Conference on Algorithms, Computing and Machine Learning (CACML)","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/A5101141925","display_name":"Xu Jingke","orcid":null},"institutions":[{"id":"https://openalex.org/I83714178","display_name":"Shenyang Jianzhu University","ror":"https://ror.org/01zr73v18","country_code":"CN","type":"education","lineage":["https://openalex.org/I83714178"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Xu Jingke","raw_affiliation_strings":["Shenyang Jianzhu University,Department of Computer Science and Technology,Shenyang,China"],"affiliations":[{"raw_affiliation_string":"Shenyang Jianzhu University,Department of Computer Science and Technology,Shenyang,China","institution_ids":["https://openalex.org/I83714178"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025337002","display_name":"Di Zhao","orcid":"https://orcid.org/0000-0002-8575-0294"},"institutions":[{"id":"https://openalex.org/I83714178","display_name":"Shenyang Jianzhu University","ror":"https://ror.org/01zr73v18","country_code":"CN","type":"education","lineage":["https://openalex.org/I83714178"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhao Di","raw_affiliation_strings":["Shenyang Jianzhu University,Department of Computer Science and Technology,Shenyang,China"],"affiliations":[{"raw_affiliation_string":"Shenyang Jianzhu University,Department of Computer Science and Technology,Shenyang,China","institution_ids":["https://openalex.org/I83714178"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058737960","display_name":"Lei Zhou","orcid":"https://orcid.org/0000-0003-0860-0724"},"institutions":[{"id":"https://openalex.org/I83714178","display_name":"Shenyang Jianzhu University","ror":"https://ror.org/01zr73v18","country_code":"CN","type":"education","lineage":["https://openalex.org/I83714178"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhou Lei","raw_affiliation_strings":["Shenyang Jianzhu University,Department of Computer Science and Technology,Shenyang,China"],"affiliations":[{"raw_affiliation_string":"Shenyang Jianzhu University,Department of Computer Science and Technology,Shenyang,China","institution_ids":["https://openalex.org/I83714178"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101141925"],"corresponding_institution_ids":["https://openalex.org/I83714178"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14279341,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10400","display_name":"Network Security and Intrusion Detection","score":0.6944000124931335,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10400","display_name":"Network Security and Intrusion Detection","score":0.6944000124931335,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/rumor","display_name":"Rumor","score":0.8687422871589661},{"id":"https://openalex.org/keywords/dominance","display_name":"Dominance (genetics)","score":0.6574726700782776},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6357035636901855},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5833788514137268},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.549479603767395},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.50213623046875},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.4327332675457001},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.31519371271133423},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22101637721061707},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.12331178784370422},{"id":"https://openalex.org/keywords/political-science","display_name":"Political science","score":0.06397062540054321}],"concepts":[{"id":"https://openalex.org/C2780469804","wikidata":"https://www.wikidata.org/wiki/Q878352","display_name":"Rumor","level":2,"score":0.8687422871589661},{"id":"https://openalex.org/C151913843","wikidata":"https://www.wikidata.org/wiki/Q3454555","display_name":"Dominance (genetics)","level":3,"score":0.6574726700782776},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6357035636901855},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5833788514137268},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.549479603767395},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.50213623046875},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.4327332675457001},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.31519371271133423},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22101637721061707},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12331178784370422},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.06397062540054321},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C39549134","wikidata":"https://www.wikidata.org/wiki/Q133080","display_name":"Public relations","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cacml64929.2025.11010959","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cacml64929.2025.11010959","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 4th Asia Conference on Algorithms, Computing and Machine Learning (CACML)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320335777","display_name":"National Key Research and Development Program of China","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1980868027","https://openalex.org/W1981589225","https://openalex.org/W2003637873","https://openalex.org/W2042123098","https://openalex.org/W2061820396","https://openalex.org/W2065769502","https://openalex.org/W2111379929","https://openalex.org/W2130997550","https://openalex.org/W2135086682","https://openalex.org/W2139297408","https://openalex.org/W2171018098","https://openalex.org/W2395439732","https://openalex.org/W2775405813","https://openalex.org/W2967420273","https://openalex.org/W3134600612","https://openalex.org/W6623350049","https://openalex.org/W6683327057"],"related_works":["https://openalex.org/W2372853429","https://openalex.org/W2793319716","https://openalex.org/W3110636174","https://openalex.org/W4210503589","https://openalex.org/W2908713064","https://openalex.org/W2810386322","https://openalex.org/W2801267666","https://openalex.org/W2188429085","https://openalex.org/W2886888575","https://openalex.org/W3140274682"],"abstract_inverted_index":{"With":[0],"the":[1,7,21,56,72,82,100,118,126,130,133,140,148,176,182,194,203,207,225,235,244],"advancement":[2],"of":[3,9,23,26,34,58,85,102,121,147,196,206,212,217,227,239,248],"computer":[4],"technology":[5],"and":[6,44,53,81,159,202],"convenience":[8],"information":[10,36],"dissemination,":[11],"online":[12],"social":[13,38,42,67,232],"networks":[14],"have":[15],"become":[16,61],"a":[17,31,62,110],"significant":[18],"platform":[19],"for":[20],"spread":[22,57,195],"various":[24],"types":[25],"negative":[27,35],"information.":[28],"Rumors,":[29],"as":[30,139],"prominent":[32],"form":[33],"on":[37,71,125,166],"media,":[39],"can":[40,223],"cause":[41],"unrest":[43],"lead":[45],"to":[46,51,116,199],"economic":[47],"losses.":[48],"Therefore,":[49],"how":[50],"quickly":[52],"effectively":[54],"curb":[55],"rumors":[59,197],"has":[60],"key":[63],"issue":[64],"in":[65,107,186,231],"current":[66],"network":[68,104],"research.":[69],"Based":[70],"Independent":[73,127],"Cascade":[74,128],"Model,":[75,129],"combined":[76],"with":[77,132,162],"graph":[78],"sampling":[79],"techniques":[80],"Three":[83],"Degrees":[84],"Influence":[86],"principle,":[87],"an":[88],"improved":[89],"rumor":[90,156,228],"suppression":[91,157,229,246],"maximization":[92,230],"algorithm,":[93],"RSM-LDT":[94,149,183,221],",":[95],"is":[96,114,137,151,189,209],"proposed.":[97],"Firstly,":[98],"considering":[99],"role":[101],"deep":[103],"node":[105,131,142],"structures":[106],"influence":[108,120,136],"diffusion,":[109],"local":[111],"dominance":[112],"tree":[113],"defined":[115],"calculate":[117],"potential":[119,135],"nodes.":[122],"Secondly,":[123],"based":[124],"highest":[134],"selected":[138,180],"blocking":[141,177],"each":[143],"time.":[144],"The":[145,220],"effectiveness":[146],"algorithm":[150,184,208,222],"verified":[152],"by":[153,181],"comparing":[154],"its":[155],"effect":[158,247],"running":[160,204],"time":[161,205,237],"five":[163],"existing":[164],"algorithms":[165,241],"two":[167],"publicly":[168],"available":[169],"real":[170],"datasets.":[171],"Experimental":[172],"results":[173],"show":[174],"that":[175,216],"seed":[178],"set":[179],"proposed":[185],"this":[187],"paper":[188],"more":[190],"accurate,":[191],"significantly":[192],"reducing":[193],"compared":[198],"heuristic":[200,249],"algorithms,":[201],"four":[210],"orders":[211],"magnitude":[213],"faster":[214],"than":[215],"greedy":[218,240],"algorithms.":[219,250],"solve":[224],"problem":[226],"networks,":[233],"avoiding":[234],"high":[236],"complexity":[238],"while":[242],"addressing":[243],"poor":[245]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}