{"id":"https://openalex.org/W4220983402","doi":"https://doi.org/10.3233/ida-215790","title":"TSPS: A Topic based Shortest Path Set algorithm for influence maximization","display_name":"TSPS: A Topic based Shortest Path Set algorithm for influence maximization","publication_year":2022,"publication_date":"2022-03-14","ids":{"openalex":"https://openalex.org/W4220983402","doi":"https://doi.org/10.3233/ida-215790"},"language":"en","primary_location":{"id":"doi:10.3233/ida-215790","is_oa":false,"landing_page_url":"https://doi.org/10.3233/ida-215790","pdf_url":null,"source":{"id":"https://openalex.org/S2498839158","display_name":"Intelligent Data Analysis","issn_l":"1088-467X","issn":["1088-467X","1571-4128"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Intelligent Data Analysis","raw_type":"journal-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/A5043701026","display_name":"Xiuliang Duan","orcid":"https://orcid.org/0000-0002-6935-4371"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Xiuliang Duan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065905020","display_name":"Liqing Qiu","orcid":"https://orcid.org/0000-0002-1209-0125"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liqing Qiu","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5017188525","display_name":"Chengai Sun","orcid":"https://orcid.org/0000-0002-8654-3481"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chengai Sun","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5043701026"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.03330842,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":"26","issue":"2","first_page":"469","last_page":"480"},"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/T12592","display_name":"Opinion Dynamics and Social Influence","score":0.9883000254631042,"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.98089998960495,"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.7418340444564819},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6634832620620728},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6596152186393738},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6072661280632019},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5881422162055969},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4713078439235687},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.44387373328208923},{"id":"https://openalex.org/keywords/cascade","display_name":"Cascade","score":0.43750500679016113},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43151915073394775},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2950112819671631},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1855345070362091},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.08618378639221191},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08583566546440125}],"concepts":[{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.7418340444564819},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6634832620620728},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6596152186393738},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6072661280632019},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5881422162055969},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4713078439235687},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.44387373328208923},{"id":"https://openalex.org/C34146451","wikidata":"https://www.wikidata.org/wiki/Q5048094","display_name":"Cascade","level":2,"score":0.43750500679016113},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43151915073394775},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2950112819671631},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1855345070362091},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.08618378639221191},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08583566546440125},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C42360764","wikidata":"https://www.wikidata.org/wiki/Q83588","display_name":"Chemical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/ida-215790","is_oa":false,"landing_page_url":"https://doi.org/10.3233/ida-215790","pdf_url":null,"source":{"id":"https://openalex.org/S2498839158","display_name":"Intelligent Data Analysis","issn_l":"1088-467X","issn":["1088-467X","1571-4128"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Intelligent Data Analysis","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1570367356","https://openalex.org/W1904263638","https://openalex.org/W1977434113","https://openalex.org/W1979657701","https://openalex.org/W1996218898","https://openalex.org/W2006021775","https://openalex.org/W2041711198","https://openalex.org/W2066705378","https://openalex.org/W2076219102","https://openalex.org/W2101196063","https://openalex.org/W2106597862","https://openalex.org/W2108858998","https://openalex.org/W2112056172","https://openalex.org/W2122456937","https://openalex.org/W2141403143","https://openalex.org/W2144629587","https://openalex.org/W2402962589","https://openalex.org/W2414744193","https://openalex.org/W2742651782","https://openalex.org/W2776177985","https://openalex.org/W2804825113","https://openalex.org/W2898247783","https://openalex.org/W2913461375","https://openalex.org/W2935738336","https://openalex.org/W2958997491","https://openalex.org/W3023370371","https://openalex.org/W6603593944","https://openalex.org/W6742245167"],"related_works":["https://openalex.org/W2153719181","https://openalex.org/W1971748923","https://openalex.org/W2060986072","https://openalex.org/W1566155057","https://openalex.org/W2052574922","https://openalex.org/W2065045110","https://openalex.org/W64588465","https://openalex.org/W3120641340","https://openalex.org/W2117825986","https://openalex.org/W3134067061"],"abstract_inverted_index":{"This":[0],"paper":[1,58],"focuses":[2],"on":[3,76],"the":[4,20,35,39,89],"influence":[5,16,92],"maximization":[6],"problem":[7],"in":[8,88],"social":[9],"networks,":[10,79],"which":[11],"aims":[12],"to":[13],"find":[14],"some":[15],"nodes":[17],"that":[18,81],"maximize":[19],"spread":[21,93],"of":[22,72,91],"information.":[23,37],"Most":[24],"existing":[25],"achievements":[26],"usually":[27],"adopt":[28],"a":[29,60,69],"uniform":[30],"propagation":[31],"probability,":[32],"without":[33],"considering":[34],"topic":[36],"Moreover,":[38],"classic":[40],"Independent":[41],"Cascade":[42],"Model":[43],"and":[44,94],"its":[45],"approximations":[46],"have":[47],"suffered":[48],"from":[49],"much":[50],"running":[51,95],"time.":[52,96],"To":[53],"overcome":[54],"this":[55,57],"limitation,":[56],"proposed":[59],"Topic":[61],"based":[62],"Shortest":[63],"Path":[64],"Set":[65],"algorithm":[66],"(TSPS).":[67],"Additionally,":[68],"comprehensive":[70],"set":[71],"experiments":[73],"are":[74],"conducted":[75],"large":[77],"real-world":[78],"showing":[80],"our":[82],"proposal":[83],"provides":[84],"more":[85],"impressive":[86],"results":[87],"aspects":[90]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}