Compact models for influential nodes identification problem in directed networks
Influential nodes identification problem (INIP) is one of the most important problems in complex networks. Existing methods mainly deal with this problem in undirected networks, while few studies focus on it in directed networks. Moreover, the methods designed for identifying influential nodes in un...
Uložené v:
| Vydané v: | Chaos (Woodbury, N.Y.) Ročník 30; číslo 5; s. 053126 |
|---|---|
| Hlavní autori: | , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
01.05.2020
|
| ISSN: | 1089-7682, 1089-7682 |
| On-line prístup: | Zistit podrobnosti o prístupe |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Influential nodes identification problem (INIP) is one of the most important problems in complex networks. Existing methods mainly deal with this problem in undirected networks, while few studies focus on it in directed networks. Moreover, the methods designed for identifying influential nodes in undirected networks do not work for directed networks. Therefore, in this paper, we investigate INIP in directed networks. We first propose a novel metric to assess the influence effect of nodes in directed networks. Then, we formulate a compact model for INIP and prove it to be NP-Complete. Furthermore, we design a novel heuristic algorithm for the proposed model by integrating a 2-opt local search into a greedy framework. The experimental results show that, in most cases, the proposed methods outperform traditional measure-based heuristic methods in terms of accuracy and discrimination.Influential nodes identification problem (INIP) is one of the most important problems in complex networks. Existing methods mainly deal with this problem in undirected networks, while few studies focus on it in directed networks. Moreover, the methods designed for identifying influential nodes in undirected networks do not work for directed networks. Therefore, in this paper, we investigate INIP in directed networks. We first propose a novel metric to assess the influence effect of nodes in directed networks. Then, we formulate a compact model for INIP and prove it to be NP-Complete. Furthermore, we design a novel heuristic algorithm for the proposed model by integrating a 2-opt local search into a greedy framework. The experimental results show that, in most cases, the proposed methods outperform traditional measure-based heuristic methods in terms of accuracy and discrimination. |
|---|---|
| AbstractList | Influential nodes identification problem (INIP) is one of the most important problems in complex networks. Existing methods mainly deal with this problem in undirected networks, while few studies focus on it in directed networks. Moreover, the methods designed for identifying influential nodes in undirected networks do not work for directed networks. Therefore, in this paper, we investigate INIP in directed networks. We first propose a novel metric to assess the influence effect of nodes in directed networks. Then, we formulate a compact model for INIP and prove it to be NP-Complete. Furthermore, we design a novel heuristic algorithm for the proposed model by integrating a 2-opt local search into a greedy framework. The experimental results show that, in most cases, the proposed methods outperform traditional measure-based heuristic methods in terms of accuracy and discrimination.Influential nodes identification problem (INIP) is one of the most important problems in complex networks. Existing methods mainly deal with this problem in undirected networks, while few studies focus on it in directed networks. Moreover, the methods designed for identifying influential nodes in undirected networks do not work for directed networks. Therefore, in this paper, we investigate INIP in directed networks. We first propose a novel metric to assess the influence effect of nodes in directed networks. Then, we formulate a compact model for INIP and prove it to be NP-Complete. Furthermore, we design a novel heuristic algorithm for the proposed model by integrating a 2-opt local search into a greedy framework. The experimental results show that, in most cases, the proposed methods outperform traditional measure-based heuristic methods in terms of accuracy and discrimination. |
| Author | Jiang, Cheng Liu, Xueyong Yu, Xiao Zhang, Jun |
| Author_xml | – sequence: 1 givenname: Cheng surname: Jiang fullname: Jiang, Cheng – sequence: 2 givenname: Xueyong surname: Liu fullname: Liu, Xueyong – sequence: 3 givenname: Jun surname: Zhang fullname: Zhang, Jun – sequence: 4 givenname: Xiao surname: Yu fullname: Yu, Xiao |
| BookMark | eNpNjs1KxDAUhYOM4MzowjfI0k3HJE3SZilFHWFAF7oe2psbiKbJ2KT4-lZ04er88HE4G7KKKSIh15ztONP1rdoxxpRU4oysOWtN1ehWrP75C7LJ-X2BuKjVmrx0aTz1UOiYLIZMXZqojy7MGIvvA41Lnam3P9F56ItPkZ6mNAQcF5BaPyEUtDRi-UrTR74k564PGa_-dEveHu5fu311eH586u4OFdSalaoFi2owQjUgTGMNOMnlIBrLJcfWMTWAEdDUrRMKFHJQLYC2ygyolXRKbMnN7-5y5nPGXI6jz4Ah9BHTnI9CMqOlbqQW3ychVGg |
| CitedBy_id | crossref_primary_10_1016_j_physa_2021_126291 crossref_primary_10_1016_j_chaos_2024_114485 crossref_primary_10_1016_j_ijcip_2022_100583 |
| ContentType | Journal Article |
| DBID | 7X8 |
| DOI | 10.1063/5.0005452 |
| DatabaseName | MEDLINE - Academic |
| DatabaseTitle | MEDLINE - Academic |
| DatabaseTitleList | MEDLINE - Academic |
| Database_xml | – sequence: 1 dbid: 7X8 name: MEDLINE - Academic url: https://search.proquest.com/medline sourceTypes: Aggregation Database |
| DeliveryMethod | no_fulltext_linktorsrc |
| Discipline | Sciences (General) Physics |
| EISSN | 1089-7682 |
| GroupedDBID | --- -~X .DC 1UP 2-P 29B 4.4 53G 5VS 7X8 AAAAW AABDS AAGWI AAPUP AAYIH ABJGX ABJNI ACBRY ACGFS ACLYJ ACNCT ACZLF ADCTM AEJMO AENEX AFATG AFHCQ AGKCL AGLKD AGMXG AGTJO AHSDT AJJCW AJQPL ALEPV ALMA_UNASSIGNED_HOLDINGS AMVHM AQWKA ATXIE AWQPM BDMKI BPZLN DU5 EBS F5P FDOHQ FFFMQ HAM M6X M71 M73 N9A NPSNA O-B P2P RIP RNS RQS TAE WH7 |
| ID | FETCH-LOGICAL-c360t-8cde5b9257c297d9cf414b27d141e8f05bc92c738f25c5e1c58cc6d59be654f52 |
| IEDL.DBID | 7X8 |
| ISICitedReferencesCount | 4 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000536216700002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1089-7682 |
| IngestDate | Fri Jul 11 09:40:09 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c360t-8cde5b9257c297d9cf414b27d141e8f05bc92c738f25c5e1c58cc6d59be654f52 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| PQID | 2409646746 |
| PQPubID | 23479 |
| ParticipantIDs | proquest_miscellaneous_2409646746 |
| PublicationCentury | 2000 |
| PublicationDate | 20200501 |
| PublicationDateYYYYMMDD | 2020-05-01 |
| PublicationDate_xml | – month: 05 year: 2020 text: 20200501 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | Chaos (Woodbury, N.Y.) |
| PublicationYear | 2020 |
| SSID | ssj0001235 |
| Score | 2.317357 |
| Snippet | Influential nodes identification problem (INIP) is one of the most important problems in complex networks. Existing methods mainly deal with this problem in... |
| SourceID | proquest |
| SourceType | Aggregation Database |
| StartPage | 053126 |
| Title | Compact models for influential nodes identification problem in directed networks |
| URI | https://www.proquest.com/docview/2409646746 |
| Volume | 30 |
| WOSCitedRecordID | wos000536216700002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1NSwMxEB3UKnhRWxW_ieBBD6G72U2yOYmIxYOUHlR6K91JAgXZqqn-fpNsSg9eBK9LDstM5s3szNt5AFdVbsw0YzXVUgtaWothvitpZgTPcVpbjOuLX5_kcFiNx2qUGm4u0SqXmBiBWs8x9Mj7PvMoEaQxxO37Bw2qUWG6miQ01qFT-FImBKYcr7aFh_9AW4K9or6sZsvNQqLoh05KFvS1f2FwTCyD3f--0h7spJKS3LV3oAtrpunBVqR2outBN4WvI9dpx_TNPowiDuCCRCUcR3zpSmatXokP-TfS-MeOzHTiEkX3kSQ-4w-SNhMaTZqWRu4O4GXw8Hz_SJO4AsVCZAtaoTa8Vj5ikSmpFdoyL2smdV7mprIZr1ExlEVlGUducuQVotBc1d6LpeXsEDaaeWOOgNShCkA0AT68RT0iFCa3QmaYGW1UeQyXS_tN_OUNE4lpY-ZfbrKy4MkfzpzCNgtfu5FueAYd6wPUnMMmfi9m7vMi-v4HE6G5uQ |
| linkProvider | ProQuest |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Compact+models+for+influential+nodes+identification+problem+in+directed+networks&rft.jtitle=Chaos+%28Woodbury%2C+N.Y.%29&rft.au=Jiang%2C+Cheng&rft.au=Liu%2C+Xueyong&rft.au=Zhang%2C+Jun&rft.au=Yu%2C+Xiao&rft.date=2020-05-01&rft.issn=1089-7682&rft.eissn=1089-7682&rft.volume=30&rft.issue=5&rft.spage=053126&rft_id=info:doi/10.1063%2F5.0005452&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1089-7682&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1089-7682&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1089-7682&client=summon |