Multi-Objective Influence Maximization Under Varying-Size Solutions and Constraints
Identification of a set of influential spreaders in a network, called the Influence Maximization (IM) problem, has gained much popularity due to its immense practicality. In real-life applications, not only the influence spread size, but also some other criteria such as the selection cost and the si...
Gespeichert in:
| Veröffentlicht in: | 2022 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) S. 285 - 292 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Tagungsbericht |
| Sprache: | Englisch |
| Veröffentlicht: |
IEEE
10.11.2022
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Identification of a set of influential spreaders in a network, called the Influence Maximization (IM) problem, has gained much popularity due to its immense practicality. In real-life applications, not only the influence spread size, but also some other criteria such as the selection cost and the size of the seed set play an important role in selecting the optimal solution. However, majority of the existing works have treated this issue as a single-objective optimization problem, where decision-makers are forced to make their choices regarding other variables in advance despite having a thorough understanding of them. This research formulates a multi-objective version of the IM problem (referred to as MOIMP), which considers three competing objectives while subject to certain practical restrictions. Theoretical analysis reveals that the influence spreading function under the suggested MOIMP framework is no longer monotone, but submodular. We also considered three well-established multi-objective evolutionary algorithms to solve the proposed MOIMP. Since the proposed MOIMP addresses varying-size seeds, all the considered algorithms are significantly modified to fit into it. Experimental results on four real-life datasets, evaluating and comparing the performance of the considered algorithms, demonstrate the effectiveness of the proposed MOIMP. |
|---|---|
| AbstractList | Identification of a set of influential spreaders in a network, called the Influence Maximization (IM) problem, has gained much popularity due to its immense practicality. In real-life applications, not only the influence spread size, but also some other criteria such as the selection cost and the size of the seed set play an important role in selecting the optimal solution. However, majority of the existing works have treated this issue as a single-objective optimization problem, where decision-makers are forced to make their choices regarding other variables in advance despite having a thorough understanding of them. This research formulates a multi-objective version of the IM problem (referred to as MOIMP), which considers three competing objectives while subject to certain practical restrictions. Theoretical analysis reveals that the influence spreading function under the suggested MOIMP framework is no longer monotone, but submodular. We also considered three well-established multi-objective evolutionary algorithms to solve the proposed MOIMP. Since the proposed MOIMP addresses varying-size seeds, all the considered algorithms are significantly modified to fit into it. Experimental results on four real-life datasets, evaluating and comparing the performance of the considered algorithms, demonstrate the effectiveness of the proposed MOIMP. |
| Author | Biswas, Tarun K. Abbasi, Alireza Chakrabortty, Ripon K. |
| Author_xml | – sequence: 1 givenname: Tarun K. surname: Biswas fullname: Biswas, Tarun K. email: t.biswas@student.adfa.edu.au organization: School of Engineering and IT, University of New South Wales,Canberra,Australia,2600 – sequence: 2 givenname: Alireza surname: Abbasi fullname: Abbasi, Alireza email: a.abbasi@unsw.edu.au organization: School of Engineering and IT, University of New South Wales,Canberra,Australia,2600 – sequence: 3 givenname: Ripon K. surname: Chakrabortty fullname: Chakrabortty, Ripon K. email: r.chakrabortty@unsw.edu.au organization: School of Engineering and IT, University of New South Wales,Canberra,Australia,2600 |
| BookMark | eNo1j81OwzAQhI0EElDyBhzMA6Ts2rETH6OIn0otOYRyrRxng4xSByUpgj49QcBpRvNJo5lLdhr6QIzdICwRwdzmVfmUb5TSqVwKEGKJADpTRp6wyKQZaq0SpTXqcxaNo69BoU4FGLhg1ebQTT4u6zdyk_8gvgptd6DgiG_sp9_7o518H_g2NDTwFzt8-fAaV_5IvOq7ww8buQ0NL2YzDdaHabxiZ63tRor-dMG293fPxWO8Lh9WRb6OrUCcYkMuA5c2Bi3UWZo6W6tW10IkQrgEWgmibrSxgjKbgJNtJhU6BIdqjhMlF-z6t9cT0e598Pt53u7_u_wG-wNTfA |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/ASONAM55673.2022.10068593 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE/IET Electronic Library IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE/IET Electronic Library url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| EISBN | 9781665456616 1665456612 |
| EndPage | 292 |
| ExternalDocumentID | 10068593 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IL ACM ALMA_UNASSIGNED_HOLDINGS APO CBEJK LHSKQ RIE RIL |
| ID | FETCH-LOGICAL-a211t-9ec80c7d91a0b877cab5f6b22422c40f302bd69a2e8a40c3f8351c10c15d69453 |
| IEDL.DBID | RIE |
| IngestDate | Wed Jun 26 19:25:25 EDT 2024 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a211t-9ec80c7d91a0b877cab5f6b22422c40f302bd69a2e8a40c3f8351c10c15d69453 |
| PageCount | 8 |
| ParticipantIDs | ieee_primary_10068593 |
| PublicationCentury | 2000 |
| PublicationDate | 2022-Nov.-10 |
| PublicationDateYYYYMMDD | 2022-11-10 |
| PublicationDate_xml | – month: 11 year: 2022 text: 2022-Nov.-10 day: 10 |
| PublicationDecade | 2020 |
| PublicationTitle | 2022 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) |
| PublicationTitleAbbrev | ASONAM |
| PublicationYear | 2022 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssib051672090 |
| Score | 1.8126283 |
| Snippet | Identification of a set of influential spreaders in a network, called the Influence Maximization (IM) problem, has gained much popularity due to its immense... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 285 |
| SubjectTerms | Costs Evolutionary computation Multi-Objective Influence Maximization Optimization Social Network Analysis Social networking (online) Viral Marketing |
| Title | Multi-Objective Influence Maximization Under Varying-Size Solutions and Constraints |
| URI | https://ieeexplore.ieee.org/document/10068593 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1JSwMxFA62iHhSseJOBK-pmcxkOxZR9NAFqtJbyQoVnEo7FfHXm6QzFQ8evIUHgfCyvLyXfN8HwLUgPiQVWCJDfaxWcYu0FxYpxSJ9HFVG2yQ2wQcDMZnIUQ1WT1gY51z6fOa6sZne8u3crGKpLOxwzCI_Vwu0OGdrsFazeGjGOMES74CrmkfzpjceDnp9ShnPQyJISLfp_0tJJQWS-71_DmEfdH4geXC0CTYHYMuVh2Cc4LNoqF_XxxZ8bCRHYF99zt5qjCVM4kbwRS0ipgmNZ18ObsphUJUWRtnOJBZRLTvg-f7u6fYB1SoJSIXkrULSGYENtzJTWAvOjdLUMx1CMyGmwD7HRFsmFXFCFdjkPty5MpNhk9FgLmh-BNrlvHTHAPpI3ZI7zYwUhTDhNqa1N8orkmvtqD0BneiR6fuaCGPaOOP0D_sZ2I1-R-nX3DloV4uVuwDb5qOaLReXafq-AUwsnPo |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NSwMxEA1aRT2pWPHbCF5Ts9nNbvZYxNJiuy20Sm8ln9CCW2m3Iv56k3S34sGDt5BDCDNJJjPJew-Ae0aMTSpwiiQ1rlqVKCQMU4jz2NHHUS6F8mITSZax8TgdlGB1j4XRWvvPZ7rhmv4tX83lypXK7A7HsePn2gY7NIoIXsO1quVDgzghOMV74K5k0nxoDvtZs0dpnIQ2FSSkUY3wS0vFh5LW4T8ncQTqP6A8ONiEm2OwpfMTMPQAWtQXs_XBBTuV6Ajs8c_pW4myhF7eCL7yhUM1oeH0S8NNQQzyXEEn3OnlIoplHby0nkaPbVTqJCBu07cCpVoyLBOVBhwLliSSC2piYYMzITLCJsREqDjlRDMeYRkae-sKZIBlQG13RMNTUMvnuT4D0DjyllCLWKYsYtLex4QwkhtOQiE0Veeg7iwyeV9TYUwqY1z80X8L9tujXnfS7WTPl-DA-QD5P3RXoFYsVvoa7MqPYrpc3HhXfgOl_aBB |
| 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%3Abook&rft.genre=proceeding&rft.title=2022+IEEE%2FACM+International+Conference+on+Advances+in+Social+Networks+Analysis+and+Mining+%28ASONAM%29&rft.atitle=Multi-Objective+Influence+Maximization+Under+Varying-Size+Solutions+and+Constraints&rft.au=Biswas%2C+Tarun+K.&rft.au=Abbasi%2C+Alireza&rft.au=Chakrabortty%2C+Ripon+K.&rft.date=2022-11-10&rft.pub=IEEE&rft.spage=285&rft.epage=292&rft_id=info:doi/10.1109%2FASONAM55673.2022.10068593&rft.externalDocID=10068593 |