Chen, Jian; Huang, Jin; Wen, Zeyi; He, Zhen; Taylor, Kerry; Zhang, Rui
In this paper, we propose a newtype of queries to retrieve the top-kmost influential
locations from a candidate set C given sets of customers M and existing facilities F. The
influence models the popularity of a facility. Such queries have wide applications in decision
support systems. A naive solution sequentially scans (SS) all data sets, which is expensive,
and hence, we investigate two branch-and-bound algorithms for the query, namely Estimate
Expanding Pruning (EEP) and Bounding...[Show more]
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.