Maximizing the influence of bichromatic reverse k nearest neighbors in geo-social networks
نویسندگان
چکیده
Geo-social networks offer opportunities for the marketing and promotion of geo-located services. In this setting, we explore a new problem, called Maximizing Influence Bichromatic Reverse k Nearest Neighbors (MaxInfBRkNN). The objective is to find set points interest (POIs), which are geo-textually socially relevant social influencers who expected largely promote POIs online. other words, problem aims detect an optimal with largest word-of-mouth (WOM) potential. This functionality useful in various real-life applications, including advertising, location-based viral marketing, personalized POI recommendation. However, solving MaxInfBRkNN theoretical guarantees challenging because prohibitive overheads on BRkNN retrieval geo-social networks, NP #P-hardness finding set. To achieve practical solutions, present framework carefully designed indexes, efficient batch processing algorithms, alternative selection policies that support both approximate heuristic solutions. Extensive experiments real synthetic datasets demonstrate good performance our proposed methods.
منابع مشابه
Maximizing Bichromatic Reverse Spatial and Textual k Nearest Neighbor Queries
The problem of maximizing bichromatic reverse k nearest neighbor queries (BRkNN) has been extensively studied in spatial databases. In this work, we present a related query for spatial-textual databases that finds an optimal location, and a set of keywords that maximizes the size of bichromatic reverse spatial textual k nearest neighbors (MaxBRSTkNN). Such a query has many practical application...
متن کاملMethod for Maximizing Bichromatic Reverse Nearest Neighbor in Road Networks
The problem of optimal location query in road networks is proposed in this paper. Use of the idea of maximizing bichromatic reverse nearest neighbor, the optimal location set that attracts the largest number of clients in the road network is found, where the user can choose appropriate location and establish new service point. To address this problem, effective point set of all single-client po...
متن کاملEfficiently Monitoring Reverse k-Nearest Neighbors in Spatial Networks
Given a set of clients C , a set of facilities F and a query q ∈ F , a reverse k-nearest neighbor (RkNN) query retrieves every client c ∈ C for which q is one of the k closest facilities. In the past few years, RkNN queries have received significant research attention due to their wide range of applications. In this paper, we study the problem of continuous monitoring of RkNN queries in road ne...
متن کاملEfficient Method for Maximizing Bichromatic Reverse Nearest Neighbor
Bichromatic reverse nearest neighbor (BRNN) has been extensively studied in spatial database literature. In this paper, we study a related problem called MaxBRNN: find an optimal region that maximizes the size of BRNNs. Such a problem has many real life applications, including the problem of finding a new server point that attracts as many customers as possible by proximity. A straightforward a...
متن کاملOn Processing of Continuous Bichromatic Reverse k-Nearest-Neighbor Queries
Bichromatic Reverse k-Nearest-Neighbor (BRkNN) query is a variant of the Reverse k-Nearest-Neighbor (RkNN) query that involves a set of service sites (e.g. gas stations) and a set of customer points (e.g. vehicles). It has many applications in Location-Based Services, in particular in mobile advertising. This paper investigates the processing of continuous BRkNN (CBRkNN) queries where the point...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: World Wide Web
سال: 2022
ISSN: ['1573-1413', '1386-145X']
DOI: https://doi.org/10.1007/s11280-022-01096-1