TY - JOUR
T1 - MaxiZone
T2 - Maximizing Influence Zone over Geo-Textual Data
AU - Liu, Qing
AU - Zhu, Ziyuan
AU - Xu, Jianliang
AU - Gao, Yunjun
N1 - Funding Information:
This work is supported by Research Grants Council of Hong Kong under GRF Projects 12201018 & 12200817 and CRF Project C6030-18GF, the National Key R&D Program of China under Grant No. 2018YFB1004003, the NSFC under Grant No. 61972338, the NSFC-Zhejiang Joint Fund under Grant No. U1609217, and the ZJU-Hikvision Joint Project.
Publisher Copyright:
© 1989-2012 IEEE.
PY - 2021/10/1
Y1 - 2021/10/1
N2 - Given a geo-textual dataset \mathbb {O}O, a set \varphiϕ of keywords, a query object q \in \mathbb {O}q∈O, and an integer kk, a reverse top-kk keyword-based location query returns the influence zone \mathcal {R}R of qq such that qq belongs to the result of a top-kk spatial keyword query with query keywords \varphiϕ and any location in \mathcal {R}R as arguments. For a query object qq, the influence zone of qq varies for different keywords \varphiϕ. Users may be interested in identifying the maximum influence zone of the query object. To this end, in this paper, we study the problem called MaxiZone that finds the keyword set maximizing the influence zone of a specified query object. The MaxiZone problem has many real-life applications, e.g., a business owner would like to identify the maximum influence zone so as to attract as many customers as possible. A straightforward way to tackle the MaxiZone problem is to compute the influence zone for every candidate keyword set. Obviously, this is infeasible if there are a large number of candidate keyword sets. We propose a more efficient index-centric algorithm together with a series of optimizations as well as a sampling-based algorithm, to facilitate the query processing. Moreover, we extend the proposed algorithms to address a variant of MaxiZone problem called \tauτ-MaxiZone problem, which finds top-\tauτ keyword sets having the maximum influence zones. Extensive empirical study using real-world datasets demonstrates the effectiveness and efficiency of our proposed algorithms.
AB - Given a geo-textual dataset \mathbb {O}O, a set \varphiϕ of keywords, a query object q \in \mathbb {O}q∈O, and an integer kk, a reverse top-kk keyword-based location query returns the influence zone \mathcal {R}R of qq such that qq belongs to the result of a top-kk spatial keyword query with query keywords \varphiϕ and any location in \mathcal {R}R as arguments. For a query object qq, the influence zone of qq varies for different keywords \varphiϕ. Users may be interested in identifying the maximum influence zone of the query object. To this end, in this paper, we study the problem called MaxiZone that finds the keyword set maximizing the influence zone of a specified query object. The MaxiZone problem has many real-life applications, e.g., a business owner would like to identify the maximum influence zone so as to attract as many customers as possible. A straightforward way to tackle the MaxiZone problem is to compute the influence zone for every candidate keyword set. Obviously, this is infeasible if there are a large number of candidate keyword sets. We propose a more efficient index-centric algorithm together with a series of optimizations as well as a sampling-based algorithm, to facilitate the query processing. Moreover, we extend the proposed algorithms to address a variant of MaxiZone problem called \tauτ-MaxiZone problem, which finds top-\tauτ keyword sets having the maximum influence zones. Extensive empirical study using real-world datasets demonstrates the effectiveness and efficiency of our proposed algorithms.
KW - algorithm
KW - geo-textual data
KW - Influence zone
KW - query maximization
UR - http://www.scopus.com/inward/record.url?scp=85114964167&partnerID=8YFLogxK
U2 - 10.1109/TKDE.2020.2968908
DO - 10.1109/TKDE.2020.2968908
M3 - Journal article
AN - SCOPUS:85114964167
SN - 1041-4347
VL - 33
SP - 3381
EP - 3393
JO - IEEE Transactions on Knowledge and Data Engineering
JF - IEEE Transactions on Knowledge and Data Engineering
IS - 10
ER -