Skip navigation

Please use this identifier to cite or link to this item: http://10.10.120.238:8080/xmlui/handle/123456789/282
Full metadata record
DC FieldValueLanguage
dc.rights.licenseAll Open Access, Green-
dc.contributor.authorSharma P.en_US
dc.contributor.authorBanerjee S.en_US
dc.date.accessioned2023-11-30T08:18:15Z-
dc.date.available2023-11-30T08:18:15Z-
dc.date.issued2022-
dc.identifier.isbn978-3031220630-
dc.identifier.issn0302-9743-
dc.identifier.otherEID(2-s2.0-85144342802)-
dc.identifier.urihttps://dx.doi.org/10.1007/978-3-031-22064-7_14-
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/282-
dc.description.abstractNow-a-days, Online Social Networks have been predominantly used by commercial houses for viral marketing where the goal is to maximize profit. In this paper, we study the problem of Profit Maximization in the two-phase setting. The input to the problem is a social network where the users are associated with a cost and benefit value, and a fixed amount of budget splitted into two parts. Here, the cost and the benefit associated with a node signify its incentive demand and the amount of benefit that can be earned by influencing that user, respectively. The goal of this problem is to find out the optimal seed sets for both phases such that the aggregated profit at the end of the diffusion process is maximized. First, we develop a mathematical model based on the Independent Cascade Model of diffusion that captures the aggregated profit in an expected sense. Subsequently, we show that selection of an optimal seed set for the first phase even considering the optimal seed set for the second phase can be selected efficiently, is an -Hard Problem. Next, we propose two solution methodologies, namely the single greedy and the double greedy approach for our problem that works based on marginal gain computation. A detailed analysis of both methodologies has been done. Experimentation with real-world datasets demonstrate the effectiveness and efficiency of the proposed approaches. From the experiments, we observe that the proposed solution approaches leads to more profit, and in some cases the single greedy approach leads to up to 23 improvement compared to its single-phase counterpart. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.en_US
dc.language.isoenen_US
dc.publisherSpringer Science and Business Media Deutschland GmbHen_US
dc.sourceLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)en_US
dc.titleProfit Maximization Using Social Networks in Two-Phase Settingen_US
dc.typeConference Paperen_US
Appears in Collections:Conference Paper

Files in This Item:
There are no files associated with this item.
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.