Optimal budget allocation: Theoretical guarantee and efficient algorithm

Tasuku Soma, Naonori Kakimura, Kazuhiro Inaba, Ken Ichi Kawarabayashi

研究成果: Conference contribution

31 被引用数 (Scopus)

抄録

2014 We consider the budget allocation problem over bipartite influence model proposed by Alon et al. (Alon et al., 2012). This problem can be viewed as the well-known influence maximization problem with budget constraints. We first show that this problem and its much more general form fall into a general setting; namely the monotone submodular function maximization over integer lattice subject to a knapsack constraint. Our framework includes Alon et al.'s model, even with a competitor and with cost. We then give a (1 - 1/e)-approximation algorithm for this more general problem. Furthermore, when influence probabilities are nonincreasing, we obtain a faster (1 - 1/e)-approximation algorithm, which runs essentially in linear time in the number of nodes. This allows us to implement our algorithm up to almost 10M edges (indeed, our experiments tell us that we can implement our algorithm up to 1 billion edges. It would approximately take us only 500 seconds.).

本文言語English
ホスト出版物のタイトル31st International Conference on Machine Learning, ICML 2014
出版社International Machine Learning Society (IMLS)
ページ556-568
ページ数13
ISBN(電子版)9781634393973
出版ステータスPublished - 2014
外部発表はい
イベント31st International Conference on Machine Learning, ICML 2014 - Beijing, China
継続期間: 2014 6 212014 6 26

出版物シリーズ

名前31st International Conference on Machine Learning, ICML 2014
1

Other

Other31st International Conference on Machine Learning, ICML 2014
CountryChina
CityBeijing
Period14/6/2114/6/26

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Networks and Communications
  • Software

フィンガープリント 「Optimal budget allocation: Theoretical guarantee and efficient algorithm」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル