Show simple item record

dc.contributor.authorSarıtaç, Ömeren_US
dc.contributor.authorKarakurt, Altuğen_US
dc.contributor.authorTekin, Cemen_US
dc.coverage.spatialMonticello, IL, USAen_US
dc.date.accessioned2018-04-12T11:46:26Zen_US
dc.date.available2018-04-12T11:46:26Zen_US
dc.date.issued2017en_US
dc.identifier.isbn978-1-5090-4551-8en_US
dc.identifier.urihttp://hdl.handle.net/11693/37638en_US
dc.descriptionDate of Conference: 27-30 Sept. 2016en_US
dc.description.abstractIn this paper, we propose the Online Contextual Influence Maximization Problem (OCIMP). In OCIMP, the learner faces a series of epochs in each of which a different influence campaign is run to promote a certain product in a given social network. In each epoch, the learner first distributes a limited number of free-samples of the product among a set of seed nodes in the social network. Then, the influence spread process takes place over the network, other users get influenced and purchase the product. The goal of the learner is to maximize the expected total number of influenced users over all epochs. We depart from the prior work in two aspects: (i) the learner does not know how the influence spreads over the network, i.e., it is unaware of the influence probabilities; (ii) influence probabilities depend on the context. We develop a learning algorithm for OCIMP, called Contextual Online INfluence maximization (COIN). COIN can use any approximation algorithm that solves the offline influence maximization problem as a subroutine to obtain the set of seed nodes in each epoch. When the influence probabilities are Hölder continuous functions of the context, we prove that COIN achieves sublinear regret with respect to an approximation oracle that knows the influence probabilities for all contexts. Moreover, our regret bound holds for any sequence of contexts. We also test the performance of COIN on several social networks, and show that it performs better than other methods. © 2016 IEEE.en_US
dc.language.isoEnglishen_US
dc.source.title2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton)en_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/ALLERTON.2016.7852372en_US
dc.subjectApproximation algorithmsen_US
dc.subjectProbabilityen_US
dc.subjectTechnology transferen_US
dc.subjectContinuous functionsen_US
dc.subjectInfluence maximizationsen_US
dc.subjectOfflineen_US
dc.subjectRegret boundsen_US
dc.subjectSublinearen_US
dc.subjectSocial networking (online)en_US
dc.titleOnline Contextual Influence Maximization in social networksen_US
dc.typeConference Paperen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.citation.spage1204en_US
dc.citation.epage1211en_US
dc.identifier.doi10.1109/ALLERTON.2016.7852372en_US
dc.publisherInstitute of Electrical and Electronics Engineers Inc.en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record