Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Pareto optimization for subset selection with dynamic cost constraints|
|Citation:||Proceedings of the AAAI Conference on Artificial Intelligence, 2019 / vol.33, iss.1, pp.2354-2361|
|Publisher:||Association for the Advancement of Artificial Intelligence|
|Conference Name:||AAAI Conference on Artificial Intelligence (27 Jan 2019 - 01 Feb 2019 : Honolulu, Hawaii)|
|Vahid Roostapour, Aneta Neumann, Frank Neumann, Tobias Friedrich|
|Abstract:||In this paper, we consider the subset selection problem for function f with constraint bound B which changes over time. We point out that adaptive variants of greedy approaches commonly used in the area of submodular optimization are not able to maintain their approximation quality. Investigating the recently introduced POMC Pareto optimization approach, we show that this algorithm efficiently computes a φ = (αf/2)(1− α1f )-approximation, where αf is the sube modularity ratio of f, for each possible constraint bound b ≤ B. Furthermore, we show that POMC is able to adapt its set of solutions quickly in the case that B increases. Our experimental investigations for the influence maximization in social networks show the advantage of POMC over generalized greedy algorithms.|
|Description:||Presented at Thirty-Third AAAI Conference on Artificial Intelligence|
|Rights:||Copyright © 2019, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.|
|Appears in Collections:||Computer Science publications|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.