A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit <a rel="external noopener" href="https://pdfs.semanticscholar.org/0a77/6311c8ed35fbb04e25f5fab447a64e091cd0.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
<i title="Institute of Electrical and Electronics Engineers (IEEE)">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ht3yl6qfebhwrg7vrxkz4gxv3q" style="color: black;">IEEE Transactions on Knowledge and Data Engineering</a>
Influence maximization in social networks is of great importance for marketing new products. Signed social networks with both positive (friends) and negative (foes) relationships pose new challenges and opportunities, since the influence of negative relationships can be leveraged to promote information propagation. In this paper, we study the problem of influence maximization for advertisement recommendation in signed social networks. We propose a new framework to characterize the information<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tkde.2019.2947421">doi:10.1109/tkde.2019.2947421</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/74cyrr7mcbgelmgwrxow6y3uci">fatcat:74cyrr7mcbgelmgwrxow6y3uci</a> </span>
more »... opagation process in signed social networks, which models the dynamics of individuals' beliefs and attitudes towards the advertisement based on recommendations from both positive and negative neighbours. To achieve influence maximization in signed social networks, we design a novel Signed-PageRank (SPR) algorithm, which selects the initial seed nodes by jointly considering their positive and negative connections with the rest of the network. Our extensive experimental results confirm that our proposed SPR algorithm can effectively and efficiently influence a broader range of individuals in the signed social networks than benchmark algorithms on both synthetic and real datasets.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200207123943/https://pdfs.semanticscholar.org/0a77/6311c8ed35fbb04e25f5fab447a64e091cd0.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/0a/77/0a776311c8ed35fbb04e25f5fab447a64e091cd0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tkde.2019.2947421"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>