Volatile Multi-Armed Bandits for Guaranteed Targeted Social Crawling. Conference Paper uri icon

abstract

  • We introduce a new variant of the multi-armed bandit problem, called Volatile Multi-Arm Bandit (VMAB). A general policy for VMAB is given with proven regret bounds. The problem of collecting intelligence on profiles in social networks is then modeled as a VMAB and experimental results show the superiority of our proposed policy. Copyright © 2013, Association for the Advancement of Artificial Intelligence. All rights reserved.

publication date

  • January 1, 2013